cigarettes

来源:互联网 发布:仿淘宝购物车代码 编辑:程序博客网 时间:2024/04/30 03:27

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

#include<stdio.h>int main(){int num,cigar,butt;scanf("%d",&num);while(num--){int sum=0;scanf("%d%d",&cigar,&butt);while(cigar){if(cigar<butt){sum=sum+cigar;cigar=0;}else{sum=sum+butt;cigar=cigar-butt+1;}}printf("%d\n",sum);}return 0;}

1 0