POJ 2509【Peter's smokes】

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

k个烟头换一根烟，问能抽多根。

#include<stdio.h>
#include<stdlib.h>
int main()
{
    long long  m,n,sum=0;
    while(scanf("%lld%lld",&m,&n)!=EOF)
    {
        sum=0;
        while(m>=n)
        {
            sum+=(m-m%n);
            m=(m-m%n)/n+m%n;

        }
        sum+=m;
        printf("%lld\n",sum);
    }
    return 0;
}