【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

//              题意： 有n根烟,每吸完k根可兑换1根, 求一共可吸几根烟

//              题解： 要考虑假设在 n 很大,而 k 很小的情况下：  1 ）p = n / k ; p是否可以再整除 k;  2 ） 如果 n / k 有余数,这个余数可以与兑已换的再次参与兑换;  

//              OS：    怕不是个zz,不知道吸烟有害健康么,吸什么吸...

//代码如下：

 

#include <cstdio>
int main()
{
	int t;
	scanf ("%d",&t);
	while (t--)
	  {
	  	  int n,k,ans,p,q,r;
	  	  scanf ("%d%d",&n,&k);
// n = 1000; k = 5;
	  	  ans = n;
	  	  while (n >= k)
	  	    {
			  p = n / k;
			  r = n % k;
			  ans += p;
			  n = p + r;
			}
	  	  printf ("%d\n",ans);
	  }
return 0;
}