joj2230

2230: Peter's smokes

---

Result	TIME Limit	MEMORY Limit	Run Times	AC Times	JUDGE
	1s	8192K	947	400	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

Problem Set with Online Judge System Version 3.12
Jilin University

Developed by skywind, SIYEE

 

 

 

 

 

#include<cstdio>
int main()
{
    int n,k;
    int sum;
    while(scanf("%d%d",&n,&k)==2)
    {
        sum=n+n/k;
        n=n/k+n%k;//printf("%d\n",n);
        while(n>=k)
        {
            int m=n/k;
            sum+=m;
            n=n/k+n%k;
        }
        printf("%d\n",sum);
    }
    return 0;
}