A. Vasya and Socks

匿名 (未验证) 提交于 2018-06-16 18:34:18

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.

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;
}

文章来源: A. Vasya and Socks

每周VPS推荐 总有一款是你需要的!

没有找到想要的?点击这里去栏目页查看所有|点击这里搜索更多

易学教程内所有资源均来自网络或用户发布的内容,如有违反法律规定的内容欢迎反馈
如果有服务商和本站有合作意向,可以联系站长,QQ:121274060|邮箱:admin@e-learn.cn
了解到有朋友期望能在易学教程发布文章,奈何用户发布系统不完善,所以开通了码农岛,以供发布文章的需求
码农岛发布的文章需要同步到主站,可以加群联系群主
广告合作  |  商家投稿  |  易学教程交流群