NYOJ 94 cigarettes【简单题类似用空瓶换汽水】

最新推荐文章于 2023-05-06 23:59:33 发布

淡定的小鱼

最新推荐文章于 2023-05-06 23:59:33 发布

阅读量571

点赞数 1

分类专栏：南阳

本文链接：https://blog.csdn.net/qq_16767427/article/details/41540689

版权

简单题同时被 2 个专栏收录

156 篇文章 0 订阅

订阅专栏

南阳

81 篇文章 0 订阅

订阅专栏

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.

样例输入

样例输出

5
14
124

来源

[rooot]原创

我模拟计算过程的，比较慢，暂时先这样写吧！现在想不出来其他的了。

 
#include<stdio.h>
int main()
{
	int s,n,k,i,r,sum;
	scanf("%d",&s);
	while(s--)
	{
		sum=0;
		scanf("%d%d",&n,&k);
		r=n;
		while(r>=k)
		{
			sum+=r/k;
			r=r/k+r%k;
		}
		printf("%d\n",n+sum);
	}
	return 0;
}