X - Vasya and Socks

标签：sch   clu   first   numbers   problem   The   integer   tput   print   

Problem 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. 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

2 2

3

9 3

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.

解题思路：题目的意思就是Vasya每天穿一双袜子，当天晚上回家就扔掉这双袜子，而且第km天（k=1,2,...）母亲就会给她买一双袜子，求用完这些袜子一共需要多少天，水过！

AC代码：

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 int main(){
 4     int n,m;
 5     cin>>n>>m;
 6     for(int i=1;i<=n;++i)
 7         if(i%m==0)n++;
 8     cout<<n<<endl;
 9     return 0;
10 }

X - Vasya and Socks

标签：sch   clu   first   numbers   problem   The   integer   tput   print   

原文地址：https://www.cnblogs.com/acgoto/p/9192451.html