Codeforces Round #262 (Div. 2) A. Vasya and Socks【暴力/模拟/袜子在可以在合法情况下增加后用几天】

A. Vasya and Socks

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

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

【代码】：

#include <bits/stdc++.h>

using namespace std;
int sum;
int main()
{
    int n,m;
    while(cin>>n>>m)
    {
        for(int i=n,j=;i>=;i--,j++)//i:袜子个数
        {
            if(j%m==)
                i++;
            sum++;
        }
        cout<<sum<<endl;
    }
    return ;
}

双指针

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n,m;
    while(cin>>n>>m)
    {
        int day=;
        int k=;
        while(n--)//袜子消耗
        {
            if(day%m==)
            {
                n++;//当是m的倍数的时候再购进一双袜子
            }
            day++;//不管有没有袜子穿日子总要过下去
            k++;//维持的日子
        }
        printf("%d\n",k);
    }
    return ;
}

多变量记录