蒟蒻一枚，这是系统太死板了吗？

#include
#include
int main(){
    int N,i,j,p,cha1,cha2,cha3,chaz;
    struct A
    {char name[20];
      int yu,shu,ying;
    }xue[1001];
      scanf("%d",&N);
    for(i=0;iscanf("%s %d %d %d",xue[i].name,&xue[i].yu,&xue[i].shu,&xue[i].ying);
    }
    for(p=0;pfor(j=N-1;j>p;j--){//这样是错的
    cha1=abs(xue[p].yu-xue[j].yu);
    cha2=abs(xue[p].shu-xue[j].shu);
    cha3=abs(xue[p].ying-xue[j].ying);
    chaz=abs(xue[p].yu+xue[p].shu+xue[p].ying-xue[j].yu-xue[j].shu-xue[j].ying);
                if(cha1<=5&&cha2<=5&cha3<=5&&chaz<=10)
                printf("%s %s\n",xue[p].name,xue[j].name);
                }
                }
    return 0;
    }

#include
#include
int main(){
    int N,i,j,p,cha1,cha2,cha3,chaz;
    struct A
    {char name[20];
      int yu,shu,ying;
    }xue[1001];
      scanf("%d",&N);
    for(i=0;iscanf("%s %d %d %d",xue[i].name,&xue[i].yu,&xue[i].shu,&xue[i].ying);
    }
    for(p=0;pfor(j=p+1;j//这样就全对，真的不理解
    cha1=abs(xue[p].yu-xue[j].yu);
    cha2=abs(xue[p].shu-xue[j].shu);
    cha3=abs(xue[p].ying-xue[j].ying);
    chaz=abs(xue[p].yu+xue[p].shu+xue[p].ying-xue[j].yu-xue[j].shu-xue[j].ying);
                if(cha1<=5&&cha2<=5&cha3<=5&&chaz<=10)
                printf("%s %s\n",xue[p].name,xue[j].name);
                }
                }
    return 0;
    }