Java程序练习-Peter's smokes

最新推荐文章于 2021-08-19 16:00:59 发布

最新推荐文章于 2021-08-19 16:00:59 发布 · 193 阅读

文章标签：

#java

本文探讨了一道有趣的数学问题：彼得拥有一定数量的香烟，抽完后收集烟蒂，并利用收集到的烟蒂制作新的香烟。文章通过提供一个Java程序来计算彼得能获得的最大香禽数量。

描述
Peter has n cigarettes. He smokes them one by one keeping all the butts. Out of k > 1 butts he can roll a new cigarette.
How many cigarettes can Peter have?

输入
Input is a sequence of 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.
样例输入
4 3
10 3
100 5
样例输出
5
14
124
参考代码

import java.util.*; public class Main { public static void main(String[] args) { Scanner cin = new Scanner(System.in); while(cin.hasNextInt()){ int n,k,c,t; n = cin.nextInt(); k = cin.nextInt(); c = 0; t = 0; while(n > 0){ c += n; t += n; n = t / k; t %= k; } System.out.println(c); } } }