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.

样例输入

34 310 3100 5

样例输出

514124

大概意思：给出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;}