码迷,mamicode.com
首页 > 其他好文 > 详细

Codeforces Round #262 (Div. 2)460A. Vasya and Socks(简单数学题)

时间:2014-08-21 21:18:24      阅读:257      评论:0      收藏:0      [点我收藏+]

标签:codeforces   数学   

题目链接:http://codeforces.com/contest/460/problem/A


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.

Sample test(s)
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.



代码如下:

//#pragma warning (disable:4786)
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cstdlib>
#include <climits>
#include <ctype.h>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <deque>
#include <set>
#include <map>
#include <iostream>
#include <algorithm>
using namespace std;
const double eps = 1e-9;
#define INF 1e18
//typedef long long LL;
//typedef __int64 LL;
int main()
{
    int n, m;
    while(~scanf("%d%d",&n,&m))
    {
        int i, j;
        int sum = 0;
        int tt = 0;
        for(i = n,j = 1; i > 0; j++,i--)
        {
            if(j%m == 0)
                i++;
            sum++;
        }
        printf("%d\n",sum);
    }
    return 0;
}


Codeforces Round #262 (Div. 2)460A. Vasya and Socks(简单数学题),布布扣,bubuko.com

Codeforces Round #262 (Div. 2)460A. Vasya and Socks(简单数学题)

标签:codeforces   数学   

原文地址:http://blog.csdn.net/u012860063/article/details/38735585

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!