南阳94 cigarettes

最新推荐文章于 2019-02-25 15:33:25 发布

DeterminedDiligent

最新推荐文章于 2019-02-25 15:33:25 发布

阅读量396

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/yuzhiwei1995/article/details/43711901

本文探讨了一个人通过收集烟蒂来制作新香烟的问题。具体地，文章提供了一个算法解决方案，该方案能够计算出给定初始香烟数量和制作新香烟所需的烟蒂数时，一个人最多可以得到多少支香烟。

间限制：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

#include<iostream>
using namespace std;
int main()
{
	int t,n,s,k;
	cin>>t;
	while(t--)
	{
		cin>>n>>k;
		int b=n,i=0;
		while(b>=k)
		{								
			b-=k;
			++i;			
			++b;						
		}
		cout<<n+i<<endl;
	}
	return 0;
}