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


    题目链接: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
    ",sum);
        }
        return 0;
    }
    


  • 相关阅读:
    spark 系列之六 SparkStreaming数据源之socket流
    spark 系列之五 SparkStreaming数据源之文件流
    spark 系列之四 Spark数据源之关系型数据库
    spark 系列之三 RDD,DataFrame与DataSet之间的转化
    spark 系列之二 Dataframe的使用
    spark 系列之一 RDD的使用
    Java Int类型与字符,汉字之间的转换
    Java实现栈
    名字的漂亮度
    在字符串中找出连续最长的数字串
  • 原文地址:https://www.cnblogs.com/slgkaifa/p/6874230.html
Copyright © 2020-2023  润新知