NYOJ 94 cigarettes

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 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;
}