Zzuli:1069 learn from classmate Z

Title Description

Z In order to realize the dream of traveling to Yunnan in the summer vacation , Decide to spend only... Every day in the future 1 element , Every flower k Yuan, you can get 1 element , In limine Z Students have M element , Ask how many days you can last at most .

Input

Input 2 It's an integer M, k,(2 <= k <= M <= 1000).

Output

Output an integer , Express M The number of days that yuan can be consumed .

The sample input  Copy

4 3

Sample output  Copy

5

#include <stdio.h>
int main()
{
	int t=0,n=0,M,k;
	scanf("%d%d",&M,&k);
	while(M!=0)
	{
		M-=1;
		t++;
		n++;
		if(n%k==0)
		M+=1;
	}
	printf("%d",t);
	return 0;
}