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
-
输入
#include<stdio.h>
int main()
{
int n,a,b,sum,i,k;
scanf("%d",&n);
while(n--)
{
scanf("%d %d",&a,&b);
for(i=0,k=a,sum=a;k>=b;i++)
{
sum+=k/b;
k=k%b+k/b;//注意这里应该是k%b和k/b,而不是a%b和a/b,刚开始写错了一直都过不了
a=k%b;
}
printf("%d\n",sum);
}
return 0;
}