cigarettes

cigarettes
时间限制：3000 ms | 内存限制：65535 KB
难度：2
描述
Tom has many cigarettes. We hypothesized that he has n cigarettes and smokes them

one by one keeping all the butts. Out of k > 1 butts he can roll a new cigarette.
Now，do you know how many cigarettes can Tom has?

输入
First input is a single line,it’s n and stands for there are n testdata.then there are n lines ,each line contains two integer numbers giving the values of n and k.
输出
For each line of input, output one integer number on a separate line giving the maximum number of cigarettes that Peter can have.
样例输入
3
4 3
10 3
100 5
样例输出
5
14
124

AC代码：

#include <iostream>
using namespace std;
int main()
{
    int n,m,k,cnt;
    cin >> n;
    while (n--)
    {
        cin >> m >> k;
        cnt=m;
        while (m)
        {
            if(m>=k)
            {
                m=m-k+1;
                cnt++;
                continue;
            }
            m--;
        }
        cout << cnt << endl;
    }
    return 0;
}

标程：

#include "stdio.h"
#include<fstream>
int main()
{
    //freopen("d:\\1.txt","r",stdin);
    //freopen("d:\\2.txt","w",stdout);
    int m;
    scanf("%d",&m);
    while(m--)
    {
        int n,k,sum;
        scanf("%d%d",&n,&k);
        sum=n;
        while(n/k)                   
        { sum+=n/k;  n=n/k+n%k; }
        printf("%d\n",sum);
    }
    return 0;
}