nefu 899这也是裸的找

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

int main()
{
    int n,k;
    while(scanf("%d%d",&n,&k)!=-1)
    {
       int r=1,l=n,mid,sum=0;
       while(r<=l)
       {
           sum++;
           mid=(r+l)/2;
           if(mid==k)  {printf("%d\n",sum);break;}
           if(mid<k) r=mid+1;
           else  l=mid-1;
       }
      
    }
    return 0;
}