NYOJ 94 cigarettes

来源：互联网发布：肌研洁面泡沫知乎编辑：程序博客网时间：2024/05/01 02:24

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

样例输出

注-此题为：NYOJ 94 cigarettes

题意： k表示兑换率，即k个烟头可以兑换一只烟每K个烟头可以换根新烟抽，

求n根烟总共能抽几根

已AC代码：

#include<iostream>using namespace std;int main(){int T,n,k,s;cin>>T;while(T--){int a,b; cin>>n>>k;s=n;while(n>=k) //先抽 k 的倍数，计算可兑换多少 {a=n/k;   //可以兑换的烟数 b=n%k;  //抽 k 的倍数后，剩余的 s+=n/k; //可抽总数 n=a+b;    //当前总烟数 }cout<<s<<endl;}return 0;}

0 0