nyoj_94 cigarettes

cigarettes

时间限制： 3000 ms  |  内存限制： 65535 KB

难度： 2

描述

Tom has many cigarettes. We hypothesized that he has n cigarettes and smokes them

one by one keeping all the butts. Out of k > 1 butts he can roll a new cigarette. 
Now，do you know how many cigarettes can Tom has?

输入

First input is a single line,it's n and stands for there are n testdata.then there are n lines ,each line contains two integer numbers giving the values of n and k.

输出

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

样例输入

3
4 3
10 3
100 5

样例输出

5
14
124

题意：

Tom有n支香烟，每k支又能搓成一支新的香烟，问Tom总共能拥有多少支香烟。

分析：

用变量sum来记录总香烟数，刚开始让sum=n。

每次让sum+=n/k；n=n/k+n%k。

直到n为0。

以下代码里会用到一些辅助变量：

#include<cstdio>
int main()
{
	int T;
	scanf("%d",&T);
	while(T--)
	{
		int a,b,y,s,sy;
		scanf("%d%d",&a,&b);
		int sum=a;
		s=a/b;
		y=a%b;
		sy=s+y;
		while(1)
		{
			sum+=s;
			s=sy/b;
			y=sy%b;
			sy=s+y;
			if(!s)
				break;
		}
		printf("%d\n",sum);
	}
	return 0;
}