cigarettes（南阳oj94）

标签：style   http   io   ar   color   os   sp   for   on   

描述

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.

样例输入

3
4 3
10 3
100 5

样例输出

5
14
124

来源

[rooot]原创

上传者

rooot

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

cigarettes（南阳oj94）

标签：style   http   io   ar   color   os   sp   for   on   

原文地址：http://blog.csdn.net/hdd871532887/article/details/41719091