cf 165B Burning Midnight Oil_cf165b 二分-CSDN博客

本文探讨了如何通过合理分配编程时间和休息时间，在夜间高效完成任务。通过使用二分查找算法来确定最小允许的每轮编程量，确保在有限时间内完成指定数量的代码行。以实例说明算法应用，提供解决类似问题的策略。

One day a highly important task was commissioned to Vasya — writing a program in a night. The program consists of n lines of code. Vasya is already exhausted, so he works like that: first he writes v lines of code, drinks a cup of tea, then he writes as much as $\text{[math]}$ lines, drinks another cup of tea, then he writes $\text{[math]}$ lines and so on: $\text{[math]}$ , $\text{[math]}$ , $\text{[math]}$ , ...

The expression $\text{[math]}$ is regarded as the integral part from dividing number a by number b.

The moment the current value $\text{[math]}$ equals 0, Vasya immediately falls asleep and he wakes up only in the morning, when the program should already be finished.

Vasya is wondering, what minimum allowable value v can take to let him write not less than n lines of code before he falls asleep.

Input

The input consists of two integers n and k, separated by spaces — the size of the program in lines and the productivity reduction coefficient, 1 ≤ n ≤ 109, 2 ≤ k ≤ 10.

Output

Print the only integer — the minimum value of v that lets Vasya write the program in one night.

Sample test(s)

input
7 2

output
4

input
59 9

output
54

Note

In the first sample the answer is v = 4. Vasya writes the code in the following portions: first 4 lines, then 2, then 1, and then Vasya falls asleep. Thus, he manages to write 4 + 2 + 1 = 7 lines in a night and complete the task.

In the second sample the answer is v = 54. Vasya writes the code in the following portions: 54, 6. The total sum is 54 + 6 = 60, that's even more than n = 59.

二分查找，注意边界就行了

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;

int judge(int n,int k,int v)
{
    double vis=v;
    int res=vis/k/1.0;
    int ans=v,m=k;
    while(res>0)
    {
        //cout<<res<<endl;
        ans+=res;
        k*=m;
        res=(int)(vis/k/1.0);
    }
    //cout<<ans<<endl;
    if(ans==n)
        return 0;
    if(ans<n)
        return 1;
    if(ans>n)
        return -1;
}

int main()
{
    int n,k;
    cin>>n>>k;
    int v,l=k,r=n,res,flag=0;
    if(k<=n)
    while(l<=r)
    {
        v=(l+r)/2;
        //cout<<v<<endl;
        res=judge(n,k,v);
        if(res==0)
            {
                flag=1;
                break;
            }
        else
        {
            if(res>0)
                l=v+1;
            else
                r=v-1;
        }

    }
    else
    {
        flag=1;
        v=n ;
    }
    if(flag==0&&res>0)
        v+=1;
    cout<<v<<endl;
    return 0;
}