南阳oj入门题-cigarettes

最新推荐文章于 2024-03-09 17:40:10 发布

原创最新推荐文章于 2024-03-09 17:40:10 发布 · 672 阅读

0 ·

CC 4.0 BY-SA版权

刷题专栏收录该内容

71 篇文章

订阅专栏

本文探讨了一道关于香烟拼凑的问题，通过算法计算在特定条件下一个人最多能抽多少支烟。输入包括测试数据组数及每组数据中香烟总数和制作新烟所需的烟蒂数量，输出为最大可抽香烟数。文章提供了完整的C++代码实现，通过循环计算直至无法再用烟蒂制作新烟为止。

/**
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
*/ 
#include<iostream>
using namespace std;
int main()
{
	int N;
	cin>>N;
	while(N--)
	{
		int n,k;
		cin>>n>>k;
		int sum=0;
		sum+=n;
		while(n>=k)
		{
			sum+=n/k;
			n=n/k+n%k;	
		}
		cout<<sum<<endl; 
	}
	return 0;
}