描述
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
#include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
while(n--){
int m,k;
cin>>m>>k;
int sum=m;
while(m/k){
sum=sum+m/k;
m=m/k+m%k;
}
cout<<sum<<endl;
}
return 0;
}
扫码关注腾讯云开发者
领取腾讯云代金券
Copyright © 2013 - 2025 Tencent Cloud. All Rights Reserved. 腾讯云 版权所有
深圳市腾讯计算机系统有限公司 ICP备案/许可证号:粤B2-20090059 深公网安备号 44030502008569
腾讯云计算(北京)有限责任公司 京ICP证150476号 | 京ICP备11018762号 | 京公网安备号11010802020287
Copyright © 2013 - 2025 Tencent Cloud.
All Rights Reserved. 腾讯云 版权所有