XOR 2
Very easy
Execution time limit is 1 second
Runtime memory usage limit is 64 megabytes
Two integers in their binary representations with n and m digits are given. Find XOR of these numbers.
Input
Two integers n and m (1 ≤ n, m ≤ 500) are given. Then two numbers are given in binary representation, one number in one line.
Output
Print one number - the result. Delete all leading zeros.
Examples
Input #1
Answer #1
Input #2
Answer #2
Input #3
Answer #3
Submissions 1K
Acceptance rate 38%