zoj 3599 Game 博弈论

#include<iostream>
#include<cstdlib>
#include<stdio.h>
#define ll long long
using namespace std;
ll a[3000000],b[3000000];
int main()
{
int i,j,t,k;
ll n,ans;
scanf("%d",&t);
while(t--){
scanf("%d%lld",&k,&n);
i=j=0;
a[0]=b[0]=1;
while(a[i]<n){
i++;
a[i]=b[i-1]+1;
while(a[j+1]*k<a[i]) j++;
if(a[j]*k<a[i]) b[i]=b[j]+a[i];
else b[i]=a[i];
}
if(a[i]==n) ans=(ll)n-i-1;
else ans=(ll)n-i;
printf("%lld\n",ans);
}
return 0;
}