1865: cigarettes

香烟回收再利用问题

最新推荐文章于 2024-03-09 17:40:10 发布

学习读书

最新推荐文章于 2024-03-09 17:40:10 发布

阅读量126

点赞数

CC 4.0 BY-SA版权

分类专栏： C程序无错

本文链接：https://blog.youkuaiyun.com/qq_42709126/article/details/81195494

C程序无错专栏收录该内容

10 篇文章

订阅专栏

本文探讨了一个有趣的数学问题——如何通过收集烟蒂来制作新的香烟。文章提供了一段C语言代码，用于计算给定初始香烟数量及制作新烟所需的烟蒂数量时，一个人最多可以得到多少支香烟。

时间限制: 3 Sec 内存限制: 64 MB
提交: 48 解决: 30
您该题的状态：已完成
[提交][状态][讨论版]

题目描述

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.

样例输入

样例输出

5
14
124

代码：

#include<stdio.h>
   int main()
   {
       int t;
       scanf("%d",&t);
       while(t--)
       {
           int n,k;
           scanf("%d%d",&n,&k);
           int s=n;
       while(n>=k)
       {
           s+=n/k;
           n=n%k+n/k;
       }
       printf("%d\n",s);
       }
   }