1409201706-ny-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有N跟烟一共可以吸几次。 解题思路       这题看着简单，但是很容易忽略情况，比如：10跟烟3个烟蒂可以组成一个完整的，第一次可以吸10次，第二次可以吸3次，第三次可以吸1次，很容易认为只可以吸两次。

特殊数据       11   3   -->16代码

#include<stdio.h>
int main()
{
	int t,n,k;
	int sum,yu;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&n,&k);
		sum=n;
	    while(n>=k)//一开始写的是n>k 
	    {
			sum+=n/k;
			n=n/k+n%k;//这点要格外注意 
		}
		printf("%d\n",sum);
	}
	return 0;
}