Biorhythms HDU - 1370 （中国剩余定理）

 1 #include<iostream>
 2 #include<stack>
 3 #include<cstring>
 4 #include<iomanip>
 5 #include<stdio.h>
 6 #include<algorithm>
 7 #include<cmath>
 8 #include<queue>
 9 using namespace std;
10 # define ll long long
11 # define inf 1ll<<60
12 const int mod = 21252;
13 const int maxn = 1e3+100;
14 int exgcd(int a,int b,int &x,int &y){
15 int d=a;
16 if(b!=0){
17 d=exgcd(b,a%b,y,x);
18 y-=(a/b)*x;
19 }
20 else {
21 x=1;
22 y=0;
23 }
24 return d;
25 }
26 int china(int m0[],int b[]){
27 int x,y,n,m=1,a=0;
28 for(int j=0;j<3;j++){
29 m=m*m0[j];
30 }
31 for(int j=0;j<3;j++){
32 n=m/m0[j];
33 exgcd(n,m0[j],x,y);
34 a=a+n*b[j]*x;
35 }
36 return a%m;
37 }
38 int main(){
39 int T;
40 int b[15];
41 int p,e,i,d;
42 int Case=0;
43 scanf("%d",&T);
44 while(~scanf("%d%d%d%d",&p,&e,&i,&d)){
45 if(p==-1&&e==-1&&i==-1&&d==-1)break;
46 int m[3]={23,28,33};
47 b[0]=p,b[1]=e,b[2]=i;
48 int sum=china(m,b)-d;
49 if(sum<=0)sum+=mod;
50 printf("Case %d: the next triple peak occurs in %d days.\n",++Case,sum);
51 }
52 return 0;
53 }