[UVA][Math] 12444 - Bits and Pieces
Problem A: Bits and Pieces
Let A and B be non-negative integers and let C = A&B and D = A|B.
Given C and D, can you find A and B such that the absolute difference
(|A-B|) is minimal?
(A&B and A|B are bitwise AND and OR respectively, represented
with symbols &...
