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

我AC不了,help(新手)

Posted by 200530501412 at 2007-03-07 01:39:31 on Problem 1006
#include <iostream>
#include <vector>
using namespace std;

int main()
{
	int p,e,i,d;
	vector<int> vp,ve,vi,vd;
	unsigned int k;
	int count=1;
	while(1)
	{
		cin>>p>>e>>i>>d;
		if(p==-1&&e==-1&&i==-1&&d==-1)
			break;
		vp.push_back(p%23);
		ve.push_back(e%28);
		vi.push_back(i%33);
		vd.push_back(d);
	}//end of input
	for(k=0;k<vd.size();k++)
	{
		for(int j=1;j<=21252;j++)
		{
			if((vd[k]+j)%23==vp[k]&&(j+vd[k])%28==ve[k]&&(j+vd[k])%33==vi[k])
			{
				cout<<"case "<<count++<<": the next triple peak occurs in "
					<<j<<" days."<<endl;
				break;
			}
		}
	}

	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