94-cigarettes


    内存限制:64MB 时间限制:3000ms 特判: No

    通过数:26 提交数:43 难度: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

提示:

没有提示哦

来源:

上传者:rooot

书中题目链接,请点击上面链接访问!

公告

    欢迎使用NYOJ2.0!