zoukankan      html  css  js  c++  java
  • Day7

    Some people believe that there are three cycles in a person's life that start the day he or she is born. These three cycles are the physical, emotional, and intellectual cycles, and they have periods of lengths 23, 28, and 33 days, respectively. There is one peak in each period of a cycle. At the peak of a cycle, a person performs at his or her best in the corresponding field (physical, emotional or mental). For example, if it is the mental curve, thought processes will be sharper and concentration will be easier.
    Since the three cycles have different periods, the peaks of the three cycles generally occur at different times. We would like to determine when a triple peak occurs (the peaks of all three cycles occur in the same day) for any person. For each cycle, you will be given the number of days from the beginning of the current year at which one of its peaks (not necessarily the first) occurs. You will also be given a date expressed as the number of days from the beginning of the current year. You task is to determine the number of days from the given date to the next triple peak. The given date is not counted. For example, if the given date is 10 and the next triple peak occurs on day 12, the answer is 2, not 3. If a triple peak occurs on the given date, you should give the number of days to the next occurrence of a triple peak.

    Input

    You will be given a number of cases. The input for each case consists of one line of four integers p, e, i, and d. The values p, e, and i are the number of days from the beginning of the current year at which the physical, emotional, and intellectual cycles peak, respectively. The value d is the given date and may be smaller than any of p, e, or i. All values are non-negative and at most 365, and you may assume that a triple peak will occur within 21252 days of the given date. The end of input is indicated by a line in which p = e = i = d = -1.

    Output

    For each test case, print the case number followed by a message indicating the number of days to the next triple peak, in the form:

    Case 1: the next triple peak occurs in 1234 days.

    Use the plural form ``days'' even if the answer is 1.

    Sample Input

    0 0 0 0
    0 0 0 100
    5 20 34 325
    4 5 6 7
    283 102 23 320
    203 301 203 40
    -1 -1 -1 -1

    Sample Output

    Case 1: the next triple peak occurs in 21252 days.
    Case 2: the next triple peak occurs in 21152 days.
    Case 3: the next triple peak occurs in 19575 days.
    Case 4: the next triple peak occurs in 16994 days.
    Case 5: the next triple peak occurs in 8910 days.
    Case 6: the next triple peak occurs in 10789 days.

    思路:同余方程组,此题三个模数互质,直接套即可,注意答案MOD一下21252(题意)
    typedef long long LL;
    typedef pair<LL, LL> PLL;
    
    void ex_gcd(LL a, LL b, LL &x, LL &y, LL &d) {
        if(!b) {
            d = a, x = 1, y = 0;
        } else {
            ex_gcd(b, a%b, y, x, d);
            y -= x*(a/b);
        }
    }
    
    LL inv(LL a, LL p) {  // inv(a) (modp)
        LL d, x, y;
        ex_gcd(a, p, x, y, d);
        return d == 1?(x % p + p) % p : -1;
    }
    
    LL China(int *a, int *m, int n) { // x = a[i] (modm[i])
        LL M = 1, ret = 0;
        for(int i = 0; i < n; ++i) M *= m[i];
        for(int i = 0; i < n; ++i) {
            LL w = M / m[i];
            ret = (ret + w * inv(w, m[i]) * a[i]) % M;
        }
        return (ret + M) % M;
    }
    
    int main() {
        int kase = 0, d, a[3], m[3], MOD = 21252;
        m[0] = 23, m[1] = 28, m[2] = 33;
        while(scanf("%d%d%d%d", &a[0], &a[1], &a[2], &d)) {
            if(a[0] == -1 && a[1] == -1 && a[2] == -1 && d == -1) break;
            LL ans = ((China(a, m, 3) - d) % MOD + MOD) % MOD;
            printf("Case %d: the next triple peak occurs in %lld days.
    ", ++kase, ans?ans:MOD);
        }
        return 0;    
    }
    View Code
    
    
  • 相关阅读:
    不懂不可耻,可耻的是每当遇到不懂的东西不是想办法去学去了解而是极力掩饰。
    在咱学校的论坛上看到的一句话,觉得……我们都在等待某个人,等到累了,就随便牵起某人的手,默默地走进礼...
    在Linux下用Virtualbox虚拟机安装Windows XP
    大学里的挂科是对考前三天不用功的惩罚.这是教算法的赵PZ讲的,窃以为很有道理。可是接下来的十一天里我...
    壮哥!才发现你博客里这么多好东西,慢慢欣赏了,哈哈~~~~~~~~~~
    哥们现在用的什么?ghs不是又被封了吗
    提取字符串中的数字并分别保存
    十一天八考之路
    WPF使ListBox支持手势多选功能
    动手实现扩展属性为对象动态添加获取数据(续)
  • 原文地址:https://www.cnblogs.com/GRedComeT/p/12222800.html
Copyright © 2011-2022 走看看