> /*用这个之前请先仔细看中国剩余定理哦*/
> #include <stdio.h>
> int main()
> {	int p,e,i,d,a,t=0;
> 	while(1)
> 	{
> 		scanf("%d%d%d%d",&p,&e,&i,&d);
> 		if(p==-1 && e==-1 && i==-1 && d==-1)
> 			break;
> 		a=(5544*p+14421*e+1288*i-d+21252)%21252;
> 		if(!a)
> 			a=21252;
> 		printf("Case %d: the next triple peak occurs in %d days.\n",++t,a);
> 	}
> 	return 0;
> }

a=(5544*p+14421*e+1288*i-d+21252)%21252;
		if(!a)
			a=21252;

改成a=(5544*p+14421*e+1288*i-d+21251)%21252+1;呵呵

• Re:O（1）算法（中国剩余定理） (135) wsy217 2009-05-21 12:12:30