F - F FZU 1150

F - F

Time Limit:1000MS    Memory Limit:32768KB    64bit IO Format:%I64d & %I64u

SubmitStatusPracticeFZU 1150

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

题解：水题，熟练掌握取模应该就能做出来，注意下细节就行了。

#include<stdio.h>    
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        int a=n,b=n,s=n;
        while(b/m)
        {
            b=a/m;
            s+=b;
            a=b+a%m;
            b=a;
        }
        printf("%d\n",s);
    }
}