joj 2619 Magic Train Station

http://acm.jlu.edu.cn/joj/showproblem.php?pid=2619

注意：Hint: The name can be as long as 1000 character & may contains space.

没看好名字有一千位 所有wa了好多次

 

#include<stdio.h>int main(){int n,t1[1001],t2[1001],i,j,flag,r;char s[1001];while(scanf("%d",&n)!=EOF){flag=0;for(i=0;i<n;i++){getchar();gets(s);scanf("%d%d",&t1[i],&t2[i]);if(t1[i]>=t2[i])flag=1;}if(flag) printf("Illegal/n");else{flag=1;while(flag){flag=0;for(i=0;i<n-1;i++){if(t1[i]>t1[i+1]){flag=1;r=t1[i];t1[i]=t1[i+1];t1[i+1]=r;r=t2[i];t2[i]=t2[i+1];t2[i+1]=t2[i];}}}flag=1;for(i=0;i<n-1&&flag;i++){for(j=i+1;j<n;j++){if((t1[i]<t1[j]&&t2[i]>t2[j])||t2[i]<t1[j]) {flag=1;continue;}else{flag=0;break;}}if(!flag) {printf("Illegal/n");break;}}if(flag) printf("Legal/n");}}return 0;}