#include<stdio.h>
int finish(int num,int n,int k)
{
int sum=0;
while(num>0)
{
sum+=num;
if(sum>=n) return(1);
num/=k;
}
return(0);
}
int bisearch(int n,int k)
{
int mid,bot=k,top=n;
while(top-bot>1)
{
mid=(bot+top)/2;
if(finish(mid,n,k))
top=mid;
else
bot=mid;
}
return(top);
}
void main()
{
int n,k,v;
scanf("%d%d",&n,&k);
if(n<=k) v=n;
else if(n==k+1) v=k;
else v=bisearch(n,k);
printf("%d\n",v);
}
没问题呀,是87呀
最后的结果是这样的:
bot=86,top=88,top-bot>1 继续循环,mid=87,finish(mid,n,k)返回1,top=mid,所以top=87,进行while条件判断top-bot=87-86=1,结束循环,所以最后结果是87