hdu 1020 找规律

#include<iostream>//根据1的位置找规律 #include<cstdio>#include<string>#include<algorithm>#include<cstring>#include<vector>#include<queue>#include<map>using namespace std;int main(){    int n;    while(scanf("%d",&n)!=EOF)    {        int p=1;        int cnt=0;        while(1)        {            cnt++;            if(p<=n)            p*=2;            else            p=(p-n)*2-1;            if(p==1)            break;        }        cout<<cnt<<endl;    }}