A. Vasya and Socks

A. Vasya and Socks

time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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. Every m-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 and m (1 ≤ n ≤ 100; 2 ≤ m ≤ 100), separated by a space.

Output
Print a single integer — the answer to the problem.

Examples
input
2 2
output
3
input
9 3
output
13
Note
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.

问题链接：A. Vasya and Socks.

问题简述：

一个不洗袜子的小男孩，他每天早上穿一双新袜子，他的妈妈每m天给他买一双新袜子（该袜子在当天不能穿）。他自己本身有n双新袜子。问：他可以穿几天新袜子。(1 ≤ n ≤ 100; 2 ≤ m ≤ 100)

问题分析：

数据不大，直接按题目所给步骤计算。

程序说明：

AC通过的C语言程序如下：

#include<stdio.h>
#include<iostream>
using namespace std;

int n,m;

int main ()
{
	scanf("%d%d",&n,&m);
	int i = 0;//计算天数
	while(n>0)//当天是否有新袜子
	{
		n--;
		i++;
		if(i%m==0)n++;
	}
	printf("%d",i);
	return 0;
}