Vasya and Socks

最新推荐文章于 2021-07-16 22:51:34 发布

原创最新推荐文章于 2021-07-16 22:51:34 发布 · 427 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#acm

AC路漫漫专栏收录该内容

180 篇文章

订阅专栏

本博客讨论了Vasya在使用袜子过程中遇到的问题，每天一双袜子的使用和补给，母亲每隔m天购买一次袜子，探讨Vasya在不同天数后是否用尽所有袜子。

Description

Vasya has n pairs of socks. In the morning of each day Vasya has to put on a pair of socks before he goes to school. When he comes home in the evening, Vasya takes off the used socks and throws them away. Everym-th day (at days with numbers m, 2m, 3m, ...) mom buys a pair of socks to Vasya. She does it late in the evening, so that Vasya cannot put on a new pair of socks before the next day. How many consecutive days pass until Vasya runs out of socks?

Input

The single line contains two integers n andm(1 ≤ n ≤ 100; 2 ≤ m ≤ 100), separated by a space.

Output

Print a single integer — the answer to the problem.

Sample Input

Input

2 2

Output

Input

9 3

Output

Hint

In the first sample Vasya spends the first two days wearing the socks that he had initially. Then on day three he puts on the socks that were bought on day two.

In the second sample Vasya spends the first nine days wearing the socks that he had initially. Then he spends three days wearing the socks that were bought on the third, sixth and ninth days. Than he spends another day wearing the socks that were bought on the twelfth day.

#include<stdio.h>
#include<string.h>
int main(){
	int n,m,sum,i,day;
	while(scanf("%d %d",&n,&m)!=EOF){
		sum=0;
		for(i=1;i<=n;i++){
			if(i==m||i%m==0)
			{
		    n++;
			sum++;
			}
             else{
             	sum++;
             }
		}
		printf("%d\n",sum);	
	}
	return 0;
}