南阳题目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

来源

这个题主要是模拟过程，我们来模拟一个10 3   总共有10只烟，吸完后有十个废品，3个可以构成一个新烟，所以可以构成3个，再吸完后，可以有4个废品（3只合成的一只第一次剩下的），可以合成一个，剩下两个废品不能合成，所以一共是10+3+1=14个

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
	int m,n,a,b,i,j;
	scanf("%d",&m);
	while(m--)
	{
		scanf("%d%d",&a,&b);
		int t=a;
		int sum=0;
		while(a>=b)
		{
			sum+=a/b;
			a=a/b+a%b;
		}
		printf("%d\n",sum+t);
	}
	return 0;
}