| ||||||||||
| 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<stdio.h>
void main()
{
int p[10],e[10],m[10],d[10],i=0,fp,fe,fm,j;
do{
scanf("%d%d%d%d",&p[i],&e[i],&m[i],&d[i]);
i++;
}while((p[i-1]!=-1)&&(e[i-1]!=-1)&&(m[i-1]!=-1)&&(d[i-1]!=-1));
for(i=0;i<=10;i++)
for(j=1;;j++)
{
fp=23*j+p[i];
fe=28*j+e[i];
fm=33*j+m[i];
if(fp==fe==fm)
printf("%d",fp-d[i]);
}
}
Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator