您的位置：首页 > 其它

FZU 1150 Peter's smokes

2009-07-21 19:48 369 查看

Peter's smokes

Time Limit:1s	Memory limit:32M
Accepted Submit:496	Total Submit:1090

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 is a sequence of 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.

Sample input

4 3
10 3
100 5

Output for the sample input

5
14
124

Original: Albert 2001

解题：

看怎么样才是最简单的代码了，不要把简单问题复杂化。

#include <iostream>
using namespace std;

int main()
{
	int n,k;
	int sum;
	while(cin>>n>>k)
	{
		sum=n;
		while(n>=k)
		{
			sum+=n/k;
			n=n/k+n%k;
		}
		cout<<sum<<endl;
	}
	return 0;
}

内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理

标签：

相关文章推荐

新的分享

章节导航

FZU 1150 Peter&#39;s smokes

FZU 1150 Peter's smokes