668
技术社区[云栖]
cigarettes-鍗氩-浜戞尔绀惧尯-阒块噷浜?
cigarettes镞堕棿闄愬埗锛?000 ms | 鍐呭瓨闄愬埗锛?5535 KB
闅惧害锛?
鎻忚堪
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锛宒o 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.}
最后更新：2017-04-02 15:14:52