FZU 1150 Farmer Bill's Problem

最新推荐文章于 2020-11-18 17:09:38 发布

_Occult_

最新推荐文章于 2020-11-18 17:09:38 发布

阅读量429

点赞数

CC 4.0 BY-SA版权

分类专栏： FZU -----------杂题----------- 文章标签： fzu

本文链接：https://blog.youkuaiyun.com/jtjy568805874/article/details/47376337

-----------杂题----------- 同时被 2 个专栏收录

234 篇文章

订阅专栏

FZU

43 篇文章

订阅专栏

本文探讨了一个简单的数学问题：给定一定数量的烟和可以利用烟蒂制作新烟的比例，计算最多能获得多少支烟。通过算法实现，提供了解决方案，并给出了具体的样例输入输出。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Description

Peter has n cigarettes. He smokes them one by one keeping all the butts. Out of k > 1 butts he can roll a new cigarette.

How many cigarettes can Peter have?

Input

Input is a sequence of lines. Each line contains two integer numbers giving the values of n and k.

Output

For each line of input, output one integer number on a separate line giving the maximum number of cigarettes that Peter can have.

Sample Input

4 3

10 3

100 5

Sample Output

5

14

124

简单数学问题

#include<stack>
#include<queue>
#include<cmath>
#include<cstdio>
#include<vector>
#include<string>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long LL;
const int maxn=1000005;
LL T,n,m;

int main()
{
	while (~scanf("%lld%lld",&n,&m))
	{
		T=n;
		while (n>=m)
		{
			T+=n/m;
			n=n/m+n%m;
		}
		printf("%lld\n",T);
	}
	return 0;
}