hope to adopt
0 Answer
This doesn't solve for a, because when b has a 0 bit and c has a 0 bit, you don't know if a has a 0 bit or a 1 bit, because either works.
So there are many values for a
& Isn't this a bit and operation, just calculate a=c^b,
Explain:
Suppose that ampersand; It's a bit and, so a & The result of b is the result of adding and bits of a and b. So if we have b and c, we can add b and c bit by bit to get d, and then we can xor d and b to get a.
这家伙很懒,什么都没留下...