UVa 10346 Peter's Smokes (water ver.)

10346 - Peter's Smokes

Time limit: 3.000 seconds 

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=1287

Peter has n cigarettes. He smokes them one by one keeping all the butts. Out of k > 1 butts he can roll a new cigarette.

How many cigarettes can Peter have?

Input

Input is a sequence of lines. Each line contains two integer numbers giving the values of n and k. The input is terminated by end of file.

Output

For each line of input, output one integer number on a separate line giving the maximum number of cigarettes that Peter can have.

Sample Input

4 3

10 3

100 5

Sample Output

5

14

124

完整代码：

/*0.018s*/

#include <cstdio>

int main()
{
	int n, k, i;
	while (~scanf("%d%d", &n, &k))
	{
		for (i = n; i >= k; i = i % k + i / k) n += i / k;
		printf("%d\n", n);
	}
	return 0;
}