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

我们可以这样理解题目的意思:
Peter 有n根烟，他抽了k根后，又会得到一根烟，那么Peter一共可以抽多少根呢？给出的测试实例输入的是一开始有的烟，和K的大小，
输出的是一共可以抽到的烟。那么这道题其实已经很简单了，下面是给出的C语言代码。
#include
using namespace std;
int main()
{
int n,m;
while( cin >> n >> m)
{
int k = n;
while(n>m)
{
k = k + n/m;
n = n%m + n/m;
}
cout << k << endl;
}
return 0;
}