首页 > 学院 > 开发设计 > 正文

cigarettes

2019-11-08 02:45:10
字体:
来源:转载
供稿:网友

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.样例输入
34 310 3100 5样例输出
514124


发表评论 共有条评论
用户名: 密码:
验证码: 匿名发表