joj2230

 2230: Peter's smokes

---

Result	TIME Limit	MEMORY Limit	Run Times	AC Times	JUDGE
	1s	8192K	976	410	Standard

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 Specification

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

Output Specification

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

 

Problem Source: The UofA Local 2000.10.14

 

---

Submit / Problem List / Status / Discuss

 

 

水题一枚，WA了一回。第一次想时将当前的烟头数写错了，没有考虑可能在一次兑换后烟头剩余。

 

 1 #include<stdio.h>
 2 
 3 int main(void)
 4 {
 5     int n, k, sum;
 6 
 7     while(scanf("%d%d", &n, &k) == 2)
 8     {
 9         sum = n;
10 
11         while(n >= k)      //当烟头不足以换一根烟退出循环
12         {
13             sum += n/k;
14             n = n/k + n%k; //此时的烟头数
15         }
16         printf("%d\n",sum);
17     }
18     
19     return 0;
20 }

转载于:https://www.cnblogs.com/RootJie/archive/2012/01/25/2329482.html