首页 > 代码库 > cigarettes(南阳oj94)
cigarettes(南阳oj94)
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
- 来源
- [rooot]原创
- 上传者
rooot
#include<stdio.h> int main() { int test,n,k,t,ans; scanf("%d",&test); while(test--) { scanf("%d%d",&n,&k); ans=n; while(n>=k) { t=n/k; ans+=t; n=n-t*k+t; } printf("%d\n",ans); } return 0; }
cigarettes(南阳oj94)
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。