cigarettes

标签：style   blog   ar   color   os   sp   java   for   on   

描述

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

 1 import java.util.Arrays;
 2 import java.util.Scanner;
 3 
 4 public class Main {
 5     public static void main(String[] args) {
 6         Scanner scanner=new Scanner(System.in);
 7         int T;
 8         int n;
 9         int k;
10         int count;
11         int temp;
12         
13         T=scanner.nextInt();
14         
15         while(true){
16             if(T==0)
17                 break;
18             T--;
19             
20             n=scanner.nextInt();
21             k=scanner.nextInt();
22             
23             count=0;
24             temp=n;
25             while(true){
26                 if(n>=k){
27                     n=n-k+1;
28                     count++;
29                 }
30                 else
31                     break;
32             }
33             System.out.println(count+temp);    
34         }
35     }    
36 }

 

cigarettes

标签：style   blog   ar   color   os   sp   java   for   on   

原文地址：http://www.cnblogs.com/zqxLonely/p/4131763.html