codefroces B.Burning Midnight Oil

二分

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<cmath>
using namespace std;
int n,k;
bool judge(int x)
{
    long long sum=0;
    long long t=1;
    while(x/t)
    {
        sum+=x/t;
        t*=k;
    }
    if(sum>=n) return true;
    else return false;
}

int main()
{
    int m;
    int a,b;
    int i,j;
    while(scanf("%d%d",&n,&k)==2)
    {
       int l=1,r=n;
        while(r>l)
        {
            int mid=(r+l)/2;
            if(judge(mid))
                r=mid;
            else
                l=mid+1;
        }
        printf("%d\n",l);
    }
    return 0;
}