B - Burning Midnight Oil CodeForces - 165B  （二分）

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.

Example

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.

大致题意：

给你一个n，k让你求出一个v 满足v/k+v/k*k·····>=n，找到满足这个条件的v的最小值。

这特么一看就是 赤裸裸的二分啊，握草，自己考试的时候自己竟然不会做。。自己之前写的二分都被狗吃了吗。。。简直是傻逼啊，但其实自己还是发现了一些小问题在里面的，自己的二分写的其实并不是很对，错误的就不说了 正确的应该是这样的

int head=1,tail=n;
		while(tail>=head)
		{
			int mid=(head+tail)/2;//头加尾减 
			if(chek(mid))
			{
				tail=mid-1;
			}
			else 
			{
				head=mid+1;
			}
		}

头加尾减，这样就可以保证循环可以跳出去，不会出现无限循环。

这其实就是一个很简单的二分啊，，，握草没啥思路吧，，，自己就是不会写 ，菜的抠脚。。。

上代码吧：

#include<stdio.h>
int n,k;
int chek(int x)
{
	int sum=x;
	while(x)
	{
		sum+=x/k;
		x=x/k;
	}
	//printf("%d\n",sum);
	if(sum>=n)
	{
		return 1;
	}
	return 0;
}
int main()
{
	while(scanf("%d%d",&n,&k)!=EOF)
	{
		int head=1,tail=n;
		while(tail>=head)
		{
			int mid=(head+tail)/2;//头加尾减 
			if(chek(mid))
			{
				tail=mid-1;
			}
			else 
			{
				head=mid+1;
			}
		}
		printf("%d\n",head);
	}
		
}