Description
RH the greeen sock likes to count.
He wants to find the minimum flips required in 3 positive integers x,y,z. Such that (X OR Y == Z), a bitwise OR operation.
The flip operation is the change of a single bit "1" to "0", or the change of bit "0" to "1" in binary representation.
E.g.
x = 0010 --> x = 0001
y = 0110 --> y = 0100
------------- ------------
z = 0101 z = 0101
Input
Input is three positive integers, x, y, z.
0 < x,y,z < 109
Output
Output is minimum number of flips to make x OR y == z
Don't forget to include "\n"