nyoj-94-cigarettes(香烟)



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

样例输出

514124

来源

[rooot]原创

上传者

rooot

每K个烟头可以换根新烟抽，求n根烟总共能抽几根

             

#include<iostream>using namespace std;int main(){    int n;    cin>>n;    while(n--)    {        int a,b;        cin>>a>>b;        int sum=0;        sum+=a;        while(a>=b)        {            a-=b;//只要a-b还大于b , 就相当于a会多一个            a++;            sum++;        }        cout<<sum<<endl;    }    return 0;}#include "stdio.h"#include<fstream>int main(){    //freopen("d:\\1.txt","r",stdin);    //freopen("d:\\2.txt","w",stdout);    int m;    scanf("%d",&m);    while(m--)    {        int n,k,sum;        scanf("%d%d",&n,&k);        sum=n;        while(n/k)        {            sum+=n/k;            n=n/k+n%k;        }        printf("%d\n",sum);    }    return 0;}