NOTES: Lowbit ()

Because Codeforces 437B this problem, contact to the lowbit.

Write the function First:

int lowbit (int  x) {    return x& (-x);}

And the definition given on the original topic:

Lowbit (x) equals 2k where k is the position of the first one in the binary representation of x. For example, lowbit(100102) =2, lowbit(100012) = 12, lowbit (100002) = 100002 (binary representation).

Easy to understand, is the binary form from the right number to the first 1, the bit represents the power of 2.

The principle of the function is the complement of the computer, i.e. (assuming 8 bits)

1 &-1 0000 0001 & 1111 1111 = 1

4 &-4 0000 0100 & 1111 1100 = 2

5 &-5 0000 0101 & 1111 1011 = 1

NOTES: Lowbit ()