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
时间限制：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
////////////////////////////////////
01.#include <iostream>
02.
03.using namespace std;
04.
05.int main()
06.{
07.int n,k;
08.int testNum;
09.
10.cin >> testNum;
11.while (testNum--)
12.{
13.cin >> n >> k;
14.if (k == 1)
15.continue;
16.int sum = 0;
17.while (true)
18.{
19.sum += n - n % k;
20.n = n / k + n % k;
21.if (n < k)
22.{
23.sum += n;
24.break;
25.}
26.
27.}
28.cout << sum << endl;
29.}
30.
31.return 0;
32.}
