In the FIBEASY question

I have used a section of code for calculating the nearest number which can be expressed as 2^k, where k is some number.

First approach by using : `floor(log2(N))`

Secod approach by using :

```
ll pos = 0 ;
while (N >>= 1) ++pos;
```

N has a limit of 10^18;

First approach : CodeChef: Practical coding for everyone

This fails in the second subtask.

Using bitwise shift gives an AC.

https://www.codechef.com/viewsolution/33177709

Any ideas why the first method fails…?