思路:用中国剩余定理求出结果,如果是0的话就等于21252
代码:
#include<iostream>
#include<cstdio>
using namespace std;
int extend_gcd(int a,int b,int &x,int &y){
if(b==0){
x=1;y=0;
return a;
}
else{
int r=extend_gcd(b,a%b,y,x);
y-=x*(a/b);
return r;
}
}
int CRT(int a[],int m[],int n){
int M=1;
for(int i=0;i<n;++i){
M*=m[i];
}
int ret=0;
for(int i=0;i<n;++i){
int x,y;
int tm=M/m[i];
extend_gcd(tm,m[i],x,y);
ret=(ret+tm*x*a[i])%M;
}
return (ret+M)%M;
}
int main(){
// freopen("data.txt","r",stdin);
int p,e,i,d;
int kase=0;
while(scanf("%d%d%d%d",&p,&e,&i,&d)!=EOF){
if(p==e&&e==i&&i==d&&d==-1)break;
int a[3]={p,e,i};
int m[3]={23,28,33};
int ans=CRT(a,m,3);
ans=(ans-d+21252)%21252;
if(ans==0)ans=21252;
printf("Case %d: the next triple peak occurs in %d days.\n",++kase,ans);
}
return 0;
}