南京林业大学“未来之星”第六届程序设计大赛（决赛）试题F 参考代码

F

Time Limit : 3000/1000ms (Java/Other)   Memory Limit : 65535/32768K (Java/Other)

Total Submission(s) : 119   Accepted Submission(s) : 14

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

Problem Description

A strange plan is tied up with Qiu Ge's mobile phone. The phone costs her 1 yuan a day.
There are M yuan in her phone card, when she uses N yuan, 1 yuan will be returned. The question is how many days can be used for her?

Input

There are multiple cases, each case input include two integers M , N(2<=N<=M<=1000), input is terminated with M=0 and N = 0.

Output

For each case, each row prints an integer which represents how many days can be used.

Sample Input

2 2
4 3
0 0

Sample Output

3
5

Author

mtttt 

参考代码

#include <iostream>
#include <string>
using namespace std;

int main()
{
	int M,N;
	while(cin>>M>>N)
	{
		if (M==0&&N==0)
			break;
		int count=0;
		while(M--)
		{
			count++;
			if(count%N==0)
				M++;
		}
		cout<<count<<endl;
	}
	return 0;
}