HDU1370Biorhythms(中国剩余定理)

Posted 2020-10-18 ---学习ing---

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. 


This problem contains multiple test cases! 

The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks. 

The output format consists of N output blocks. There is a blank line between output blocks. 

InputYou 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. 
OutputFor 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

1

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.

题意：

有3个循环周期，周期天数分别为23、28、33。对于某一年，已知某年这3个周期的某一峰值分别是当年的第a、b、c天，

问从第d天开始到最近一个满足3个周期都达到峰值的日期还有多少天。

简单的中国剩余定理。（kuangbin的模板）

#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<cstring>
int m[10],Mod[10],M;
long long extend_gcd(long long a,long long b,long long &x,long long &y)  
{  
    if(a==0&&b==0) return -1; if(b==0){x=1;y=0;return a;}  
    long long d=extend_gcd(b,a%b,y,x);  y-=a/b*x; return d; 
}
long long mod_reverse(long long a,long long n)  
{  
    long long x,y;  long long d=extend_gcd(a,n,x,y);  
    if(d==1) return (x%n+n)%n;  else return -1;  
} 
int T,a,b,c,d,Case;
void China()
{
    long long res=0;
    m[1]=a%Mod[1];m[2]=b%Mod[2];m[3]=c%Mod[3];
    for(int i=1;i<=3;i++){
        res=res+M/Mod[i]*mod_reverse(M/Mod[i],Mod[i])*m[i]%M;
    } res%=M;
    res=res-d; if(res<=0) res+=M;
    printf("Case %d: the next triple peak occurs in %lld days.\n",++Case,res);
}
int main()
{
    Mod[1]=23;Mod[2]=28;Mod[3]=33;M=23*28*33;
    scanf("%d",&T);Case=0;
    while(~scanf("%d%d%d%d",&a,&b,&c,&d)) {
        if(a==-1&&b==-1&&c==-1) break;China();
    }
    return 0;
}