NYOJ 94 cigarettes
来源:互联网 发布:linux下zip 编辑:程序博客网 时间:2024/06/06 04:35
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
- 来源
- [rooot]原创
- 上传者
rooot
#include<stdio.h>
int main()
{
int N,n,k,a,b,sum,a1,b1;
scanf("%d",&N);
while(N--)
{
sum=0;
scanf("%d %d",&n,&k);
a=n/k;//a表示刚开始可以卷多少支烟
b=n%k;//b表示卷完烟后剩多少支烟
sum=sum+a;
a1=a;//a1表示上次卷多少支烟
while(a+b>=k)
{
a=(a+b)/k;//卷的烟加上上次没卷的烟再卷
b=(a1+b)%k;//卷的烟加上上次没卷的烟再卷余下多少烟
a1=a;
sum+=a;
}
printf("%d\n",sum+n);
}
return 0;
}
阅读全文
0 0
- nyoj 94 cigarettes
- nyoj-94cigarettes
- NYOJ 94 cigarettes
- nyoj 94 cigarettes
- NYOJ 题目94 cigarettes
- nyoj.94 cigarettes 20141028
- nyoj-94-cigarettes(香烟)
- nyoj 94 cigarettes
- nyoj 94 cigarettes
- NYOJ---题目94cigarettes
- nyoj 94 cigarettes
- NYOJ 94 cigarettes
- NYOJ 94 cigarettes
- nyoj 94 cigarettes 【水题】
- 【NYOJ】[94]cigarettes
- NYOJ:94cigarettes
- NYOJ-94 cigarettes
- 【NYOJ-94】cigarettes
- Third week of machine learning on Coursera
- re+lxml+requests基础知识
- 设计模式
- spring装配Bean
- Elasticsearch(一)安装
- NYOJ 94 cigarettes
- 数组内置方法
- 吴恩达深度学习课后编程题讲解(python)
- Nice to see you, Scala
- AndroidUi--用GridLayout实现计算器界面
- 深入Java Web技术内幕-----1 web的请求过程:HTTP解析,DNS域名解析
- Windows下Python2,Python3共存且正确安装对应的pip,scrapy
- jzoj5385. 【NOIP2017提高A组模拟9.23】Carry
- Codeforces 864C Bus(模拟水题)