Burning Midnight Oil

 Burning Midnight Oil

Time Limit:2000MS    Memory Limit:262144KB    64bit IO Format:%I64d & %I64u

Submit Status Practice CodeForces 165B

Description

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 lines, drinks another cup of tea, then he writes lines and so on: , , , ...

The expression is regarded as the integral part from dividing number a by number b.

The moment the current value 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 ≤ 10⁹, 2 ≤ k ≤ 10.

Output

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

Sample Input

Input

7 2

Output

4

Input

59 9

Output

54
看到数据比较大，以为容易超时，就没多想。其实直接二分就行了。
注意，sum,x.可能比较大。
#include<iostream>
using namespace std;
int n,k;
int judge(int v)
{
	__int64 x=1;
	__int64 sum=0;
	while(v/x)
	{
		sum+=v/x;
		x*=k;
	}
	if(sum>=n)
	{
		return 1;
	}
	else
	{
		return 0;
	}
}
int main()
{
    while(cin>>n>>k)
	{
		int x=1;
		int y=n;
		int v;
		while(x<y)
		{
            v=(x+y)/2;
			if(judge(v))
			{
				y=v;
			}
			else
			{
				x=v+1;
			}
		}
		cout<<x<<endl;
	}
	return 0;
}