首页 > 其他 > 详细

cigarettes

时间:2014-04-19 07:18:20      阅读:473      评论:0      收藏:0      [点我收藏+]

题目94
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

bubuko.com,布布扣
 1 #include<stdio.h>
 2  int main(){
 3      int N;
 4      scanf("%d",&N);
 5   while(N--){
 6       int n,k,i,j,sum,t;
 7        scanf("%d %d",&n,&k);
 8          i=n;
 9          sum=n;
10    while(i>=k){
11        t=i/k;
12        j=i%k;
13        i=t+j;
14          sum=sum+t;
15               
16     }
17        printf("%d\n",sum); 
18   } return 0;
19  }
bubuko.com,布布扣

 

cigarettes,布布扣,bubuko.com

cigarettes

原文:http://www.cnblogs.com/acmgym/p/3674002.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!