| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
哪位大哥帮我看一下啊#include <iostream>
using namespace std;
void main()
{
int *M;
int p,e,i,d;
cin>>p>>e>>i>>d;
for(int m=0,j=0;p!=-1&&e!=-1&&i!=-1&&d!=-1;m++,j++)
{
M=new int[j];
if(((m+p)%23==0)&&((m+e)%28==0)&&((m+i)%33==0))
M[j]=m;
cin>>p>>e>>i>>d;
}
for (int n=0;n<j;n++)
cout<<"Case"<<' '<<n<<":"<<' '<<"the next triple occurs in"<<' '<<(21252-M[n]-d)<<' '<<"days."<<endl;
}
Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator