Acm 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

大概意思：給出n根菸，k個菸頭。每k個菸頭可以換一根菸抽，最後可以抽多少根菸。

public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int testData = scan.nextInt();
		int number = 0;
		int n,k;
		while(testData-->0){
			n = scan.nextInt();
			k = scan.nextInt();
			number += n;
			number += remain(n,k);
			System.out.println(number);
			number = 0;
		}
	}
	static int remain(int n,int k){
		int num = 0;
		int center = 0;
		while(n >= k){
			center = n/k;
			num += center;
			n = center + n%k;
		}
		return num;
	}