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.

样例输入

34 310 3100 5

样例输出

514124

 

#include <stdio.h>int main(){int k, m, n;scanf("%d", &k);while(k--){int ans = 0, count,t = 0;scanf("%d%d", &m, &n);count = m;//count是为了记录本来就有的香烟if(n<=1 || m<n){printf("%d\n", count);continue;}while(m >= n){t = m/n;//t是为了记录每次通过换得的烟ans += t;//计数m = m/n+m%n;//换的烟和上次剩下的烟头}printf("%d\n", count + ans);}return 0;}