NYOJ-94-CSDN博客

本文链接：https://blog.csdn.net/SKY453589103/article/details/43270801

题目：

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.

样例输入

样例输出

5
14
124

把换得的新烟的烟头和之前没用上的烟头都要算上就行了。

代码：

#include <iostream>

using namespace std;

int main()
{
    int m;
    cin >> m;

    int n, k;
    while(m--)
    {
        cin >> n >> k;
        int res = n;
        int butts = n;
        for( ;butts >= k; )
        {
            res += butts / k;
            butts = butts % k + butts / k;
        }
        cout << res << endl;
    }

    return 0;
}