首页 > 代码库 > cigarettes
cigarettes
描述
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
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 else31 break;32 }33 System.out.println(count+temp); 34 }35 } 36 }
cigarettes
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。