生理周期POJ 1006

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
using namespace std;
const int MAXN=1001;
inline void read(int &n)
{
	char c=‘+‘;int x=0;bool flag=0;
	while(c<‘0‘||c>‘9‘){c=getchar();if(c==‘-‘)flag=1;}
	while(c>=‘0‘&&c<=‘9‘){x=x*10+(c-48);c=getchar();}
	flag==1?n=-x:n=x;
}
int getgcd(int a,int b)
{
	return b==0?a:getgcd(b,a%b); 
}
int exgcd(int a,int b,int &x,int &y)
{
	if(b==0)
	{
		x=1;
		y=0;
		return a;
	}
	int r=exgcd(b,a%b,x,y);
	int tmp=x;
	x=y;
	y=(tmp-(a/b)*y);
	return r;
}
int crt(int *a,int *m,int num)
{
	int M=1,ans=0;
	for(int i=1;i<=num;i++)
		M*=m[i];
	int x,y;
	for(int i=1;i<=num;i++)
	{
		int nowm=(M/m[i]);
		int remain=exgcd(nowm,m[i],x,y);
		ans=(ans+a[i]*nowm*x)%M;
	}
	return ans;
}
int tl,qg,zs,day;
int now=1;
int a[MAXN];
int m[MAXN];
int main()
{
	ios::sync_with_stdio(0);
	m[1]=23;
	m[2]=28;
	m[3]=33;
	int tot=0;
	while(cin>>a[1]>>a[2]>>a[3]>>day)
	{
		if(a[1]==-1)break;
		int out=crt(a,m,3);
		if(out<=day)
			out+=21252;
		printf("Case %d: the next triple peak occurs in %d days.\n",++tot,out-day);	
	}
	return 0;
}