zoukankan      html  css  js  c++  java
  • CSUOJ 1858 Biorhythms 中国剩余定理

    1858: Biorhythms

            Time Limit: 1 Sec     Memory Limit: 256 Mb     Submitted: 69     Solved: 37    


    Description

    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) separated by spaces. 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 cycle peaks, 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 are guaranteed that a triple peak will occur within 21252 days of the given date. A line in which all four values are -1 indicates the end of input.

    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 x: the next triple peak occurs in y days.
    where x and y are replaced by the appropriate values.

    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.
    

    Hint

    Source

    1999 Pacific NW Regional Contest

    http://acm.csu.edu.cn/csuoj/problemset/problem?pid=1858

    多校补题

    直接套中国剩余定理的模板

    #include <iostream>
    #include <cstdio>
    #include <algorithm>
    
    #define LL long long
    
    using namespace std;
    
    LL gcd(LL a, LL b, LL &x, LL &y) {
        if(b == 0) {
            x =1, y = 0;
            return a;
        }
        LL r = gcd(b, a % b, x, y);
        LL t  = y;
        y = x - a / b * y;
        x = t;
        return r;
    }
    
    LL multi(LL a, LL b, LL mod) {
        LL ret = 0;
        while(b) {
            if(b & 1) {
                ret = ret + a;
                if(ret >= mod) ret -= mod;
            }
            a = a + a;
            if(a >= mod) a -= mod;
            b >>= 1;
        }
        return ret;
    }
    
    LL crt(int n, LL m[], LL a[]) {
        LL M = 1, d, y, x = 0;
        for(int i = 0; i < n; i++) M *= m[i];
        for(int i = 0; i < n; i++) {
            LL w = M / m[i];
            d = gcd(m[i], w, d, y);
            y = (y % m[i] + m[i]) % m[i];
            x = ((x + multi(multi(a[i], w, M), y, M)) % M + M) % M;
        }
        return x;
    }
    
    int main()
    {
        int p, e, i, d;
        int cnt = 1;
        LL a[5], m[5];
        while(~scanf("%d%d%d%d", &p, &e, &i, &d)){
            if(p == e && e == i && i == d && d == -1) break;
            m[0] = 23;
            m[1] = 28;
            m[2] = 33;
            a[0] = p;
            a[1] = e;
            a[2] = i;
            int ans = crt(3, m, a);
            if(ans <= d) ans += 21252;
            printf("Case %d: the next triple peak occurs in %d days.
    ", cnt++, ans - d);
    
        }
        return 0;
    }
    
    /**********************************************************************
    	Problem: 1858
    	User: luoggg
    	Language: C++
    	Result: AC
    	Time:0 ms
    	Memory:1700 kb
    **********************************************************************/
    

      

  • 相关阅读:
    C# PC版微信消息监听自动回复
    http ContentLength 为0 下载问题
    linq to entity不识别方法"System.String ToString()"
    android 环境搭建
    已备份数据库的磁盘上结构版本为 661。服务器支持版本 539,无法还原或升级此数据库
    android 百度地图 团队开发及正式apk发布
    Jquery UI Autocomplete 在mvc中应用
    <input type="image">表单提交2次 重复插入数据问题
    仿腾讯新闻时间轴效果
    项目管理笔记
  • 原文地址:https://www.cnblogs.com/Hyouka/p/6789076.html
Copyright © 2011-2022 走看看