Not able to understand logic of the question please explain

#1

question:

https://practice.geeksforgeeks.org/problems/replace-the-bit/0/?category[]=Bit%20Magic&problemStatus=unsolved&difficulty[]=-1&page=1&sortBy=submissions&query=category[]Bit%20MagicproblemStatusunsolveddifficulty[]-1page1sortBysubmissions

answer:

#2

hello @aarijrab

first we are checking whether kth bit of n is 1 or not.

if it is 1 then we are setting it to 0.
and this is the logic we are using to turn it 0.
To turn off the particular bit in given number we use bitwise ‘<<‘, ‘&’ and ‘~’ operators. Using expression “~(1 << (k – 1))“, we get a number which has all bits set, except the k’th bit. If we do bitwise ‘&’ of this expression with n, we get a number which has all bits same as n except the k’th bit which is 0.

#3

but my code is not woeking ,…could you please correct it and mention me errors in // comments

#4

@aarijrab

i think ur code is right.
they have not cleared from what direction they are counting k .

their explanation is also creating confusion->
image

here 3rd bit from left of 13 is set but then also they have returned 13
same is the case with second case.

#5

my code is not executing…please correct mt code

#6

u r trying to execute it in c .
change language setting to c++ and then it will work