You are given two arrays a and b each of size n. For each i (0<=i<n), you have to find smallest 'x' such that ↵
↵
-> x+y = a[i]↵
↵
-> x^y = b[i] (i.e. x xor y = b[i])↵
↵
0<=a[i],b[i]<=10^(15)↵
↵
1<=n<=50↵
↵
It is possible that there might be no 'x' possible.↵
Would be glad if anyone could help...↵
↵
-> x+y = a[i]↵
↵
-> x^y = b[i] (i.e. x xor y = b[i])↵
↵
0<=a[i],b[i]<=10^(15)↵
↵
1<=n<=50↵
↵
It is possible that there might be no 'x' possible.↵
Would be glad if anyone could help...↵
