Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

Re:O(1)算法(中国剩余定理)

Posted by Maple920101 at 2008-07-14 17:13:40 on Problem 1006
In Reply To:O(1)算法(中国剩余定理) Posted by:FOR_RITZ at 2006-11-19 12:02:34
> /*用这个之前请先仔细看中国剩余定理哦*/
> #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;
> }

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator