더블릿|dovelet - 층 수 구하기/flr

문제

#include <iostream>
#include <cmath>
 
int main()
{
    int n;
    std::cin >> n;
    int count = 1;
    int floor = 0;
    while (true)
    {    
        floor++;
        count *= 2;
        if (n < count)
        {
            std::cout << floor;
            break;
        }
    }
 
    return 0;
}