BZOJ 1192(水题)

1192: [HNOI2006]鬼谷子的钱袋

水题。

BZOJ 1192

/**************************************************************
    Problem: 1192
    User: Dream_Tonight
    Language: C++
    Result: Accepted
    Time:40 ms
    Memory:1288 kb
****************************************************************/
 
#include <algorithm>
#include <iostream>
#include <cstring>
#include <vector>
#include <string>
#include <cstdio>
#include <cmath>
#include <stack>
#include <queue>
#include <list>
#include <map>
#include <set>
#include <iostream>
#include <cstdio>
 
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define mp make_pair
#define pb push_back
const int maxn = 1e5 + 7;
const int INF = 1e9;
 
struct node {
    int t;
    int v;
 
    node(int a, int b) {
        t = a;
        v = b;
    }
};
 
int main() {
    ll n, m = 1, k = 0, e, s, t, p, d = 0;
    scanf("%lld", &n);
    while (k < n) {
        d++;
        k += m;
        m *= 2;
    }
    cout << d;
    return 0;
}