Tricky XOR A project was going on related to image processing and to perform experiments and get desired result...
XORtime limit is too high for my solution can anyone suggest me a better way of solving this problem
XORi just posted my solution can you tell me better way of doing this problem
XORfind the number of pairs (i,j) such that 1≤i<j≤N and the bitwise XOR of Ai and Aj can be written...
GCDI updated the question. once check it