Title Description ：

Their thinking ：

Because it's processing on binary bits ,

So we need to use binary operators ,

Such as ：

&  ^  |  <<  >>

First create a variable to record binary digits ,

By shift right operator >>  Gradually advance from right to left to every bit of binary ,

And make its even digit become 0 Methods ：

By subtracting 1 * 10 Of n Power ,（ Binary system ）, Which is equivalent to subtracting decimal 2^n

among n The value is selected according to the binary position ：

for example ：

Subtract binary 10 The last digit remains unchanged

 

Subtract binary 100 after , The last digit remains unchanged

Remember to ,

The number of bits of the final binary number is constant ,

So only by subtracting 1 * 10 In order to ensure that the last digit remains unchanged

【 matters needing attention 】：

• This class deals with problems in binary bits ,

The easiest mistake to make ：

It ignores that the processing and storage of data by the computer itself are carried out in binary bits

Just print in the final output ,

That is, when human-computer interaction ,

You need to use the format controller or stream ,

Print out binary numbers in decimal format

therefore ,

There is no need to design an algorithm to convert the input decimal data into binary

• Shift right operator >> Equivalent to divided by 2
• Shift left operator << Equivalent to times 2

Reference code ：

#include<bits/stdc++.h> 

using namespace std;

int main( )
{
    int data = 0;
    cin >> data;
    int tmp = data;
    int id = 0;// Used to indicate its subscript 
    int sub = 1;// Must be initialized to  1
    while(tmp)
    {
        if((tmp % 2 == 1) && (id % 2 == 0))
        /* Judge whether the binary bits at this time are even digits , Whether the value on the even digit is  1*/
        {
            data = data - sub;
        }

        sub = sub * 2;
        id++;
        tmp = tmp >> 1;// The shift right operator is equivalent to dividing by 2
        // Or is it  tmp = tmp / 2;
    }

    cout << data;
  
    return 0;
}