NYOJ94cigarettes
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
#include<stdio.h> int main() { int n,a,b; int t1,t2,t3,k; scanf("%d",&n); while(n--) { scanf("%d%d",&a,&b); t2=0; k=a; while(a/b>0) { t1=a/b; t3=a%b; t2+=t1; //printf("t2==%d",t2);// a=t1+t3; } printf("%d\n",k+t2); } return 0; }
posted on 2012-08-02 14:42 LinuxPanda 阅读(129) 评论(0) 编辑 收藏 举报