poj 2509 Peter's smokes

http://poj.org/problem?id=2509

 

Peter's smokes

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 16957		Accepted: 6984

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

 

 

分析：

这道题没有可以“先借后还”的要求，所以要最后判断结果即可。

 

 

AC代码：

 1 #include<stdio.h>

 2 int main()

 3 {

 4     int a,b;

 5     while(~scanf("%d%d",&a,&b))

 6     {

 7         int sum = a;

 8         while(a >= b)

 9         {

10             sum += a/b;

11             a = a/b + a%b;

12         }

13         printf("%d\n",sum);

14     }

15     return 0;

16 }