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

题意：给n个香烟，每吸完k根，可以兑换一根香烟，求Tom能吸到烟的最大值

#include<stdio.h>int main(){int t,n,m,ans,i,k;scanf("%d",&t);while(t--){scanf("%d%d",&n,&k);ans=n;while(n>=k){m=n%k;n=n/k;ans=ans+n;n=n+m;}printf("%d\n",ans);}return 0;}