标签：
Description
Input
Output
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.
/* 中国剩余定理题目 分析： 设答案为n，则有 ①(n+d)%23=p;②(n+d)%28=e;③(n+d)%33=i; 设M1=28*33=924，M2=23*33=759,M3=23*28=644; 设 x1，x2，x3 则有 M1*x1=1(mod 23);M2*x2=1(mod 28);M3*x3=1(mod 33); 解得最小正整数的x1=6,x2=19,x3=2; n=((M1*x1*23)+(M2*x2*28)+(M3*x3*33))mod 21252 注：21252===>(23*28*33); */ #include<cstdio> #include<iostream> #define mod 21252 using namespace std; int p,e,i,d,cnt; void init() { int ans=((924*6*p)%mod+(759*19*e)%mod+(644*2*i)%mod-d+mod)%mod; if(ans==0)ans=21252; printf("Case %d: the next triple peak occurs in %d days.\n",++cnt,ans); } int main() { while(1) { scanf("%d%d%d%d",&p,&e,&i,&d); if(p==-1&&e==-1&&i==-1&&d==-1)break; init(); } return 0; }
标签：
原文地址：http://www.cnblogs.com/harden/p/5658279.html
