山东理工OJ 2055 来淄博旅游

http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=2055

#include <stdio.h>#include <string.h>typedef struct node{    char name[22];    char begin[22];    char end[10];}Tourist;Tourist p[105];char from[10000][22];char to[4][10]={"zichuan","linzi","zhoucun","boshan"};int main(){    int n,i,j,c=0,count;    scanf("%d",&n);    for(i=0;i<n;i++)    {        scanf("%s %s %s",p[i].name,p[i].begin,p[i].end);for(j=0;j<c;j++)        {            if(strcmp(p[i].begin,from[j])==0)                break;        }        if(j==c)            strcpy(from[c++],p[i].begin);    }    for(i=0;i<c;i++){printf("%s :",from[i]);for(j=0;j<n;j++){if(strcmp(from[i],p[j].begin)==0)printf(" %s",p[j].name);}printf("\n");}for(i=0;i<4;i++){printf("%s :",to[i]);for(j=0;j<n;j++){if(strcmp(to[i],p[j].end)==0)printf(" %s",p[j].name);}printf("\n");}    return 0;}