scau 10692 XYM-入门之道

#include <stdio.h>
#include <stdlib.h>
void work()
{
int n,k;
int que[100000]={0};
int head,tail;
int i_count=0;
head=tail=1;
scanf ("%d%d",&n,&k);
que[tail++]=n;
while (head<tail)
{
if (que[head]<=k)
{
i_count++;
head++;
}
else
{
if (que[head]%2==0)
{
que[tail++]=que[head]/2;
que[tail++]=que[head]/2;
head++;
}
else
{
que[tail++]=que[head]/2;
que[tail++]=que[head]/2+1;
head++;
}
}
}
printf ("%d\n",i_count);
return ;
}
int main()
{
int t;
scanf ("%d",&t);
while (t--)
{
work();
}
return 0;
}