hdu 1210 Eddy's 洗牌问题

#include <iostream>
#include <cstdio>
using namespace std;

int solve(int n){
    int cur=2;
    int half=n/2;
    int res=1;
    while(cur!=1){
        if(cur<=half) cur*=2;
        else cur=(cur-half)*2-1;
        res++;
    }
    return res;
}

int main(){
    int n;
    while(cin>>n){
        cout<<solve(n*2)<<endl;
    }
    return 0;
}