You complete me

Here is a list of \(10^5\) distinct 32-bit unsigned integers.

Any two of them are called complementary if their bitwise XOR is composed of all 1s and no 0s.

How many complimentary pairs are there in this data set?

×

Problem Loading...

Note Loading...

Set Loading...