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

题目简单，大意是讲k个烟头可以换一根烟，某人有n根烟，到最后他一共能抽多少根。解题时注意记录烟头的个数。

代码如下：

#include<stdio.h>
#include<stdlib.h>
int main()
{
	int m,n,k;
	scanf("%d",&m);
	while(m--)
	{
		scanf("%d%d",&n,&k);
		int sum=n,buuts=n;
		while(buuts>=k)
		{
			n=buuts/k;
			sum=sum+n;
			buuts=n+(buuts%k);//要计算烟头的个数 
		}
		printf("%d\n",sum);
	}
	return 0;
}