POJ 2509 Peter's smoke

一道简单题，模拟吸烟这个过程既可，每吸k根得到的，加上余下的的，再每k根的去吸。

Peter's smokes

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 13338		Accepted: 5315

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

Source

The UofA Local 2000.10.14

代码如下

#include <iostream> using namespace std; int main() { int n; int k; int sum=0; while(cin>>n>>k) { sum=n; while(n/k) { sum+=(n/k); n=n%k+n/k; } cout<<sum<<endl; } return 0; }