A. Vasya and Socks

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

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

0 ·

CC 4.0 BY-SA版权

CF 专栏收录该内容

27 篇文章

订阅专栏

本文探讨了一个关于袜子使用的问题：一个人每天会消耗一对袜子，并且每m天会得到额外的一对。文章通过示例解释了如何计算初始数量的袜子能够维持多少天，并附带了一段AC代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

Input

9 3

Output

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.

AC代码（感觉也有点像模拟）

#include <iostream>
#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n, m, sum;
    while(scanf("%d %d",&n, &m)!=EOF)
    {
     sum = 0;
     while(n>=m)
     {
      n = n-m+1;
      sum+=m;
     }
     sum = sum + n;
     printf("%d\n",sum);
    }
    return 0;
}