C大作业——搜索线路（国外英文资料）.docVIP

C大作业——搜索线路 //C language big homework //2011302530034 Information security class 2 / / Li Yuan #includestdio.h #includestdlib.h #includestring.h #define NUM 3 Struct time{ Int days; Int hours; Int minutes; }; Struct station{ Struct time arrive; Struct time leave; Char name[20]; Int money; Int distance; }; Struct routine{ Char train[20]; Char from[20]; Char to[20]; Struct time start; Struct time end; Struct time process; Int distance; Int money; }; Int sousuo (char, *a, char, *b); Struct, time, Shicha (struct, time, a, struct, time, B); Int compare (struct, time, a, struct, time, B); Int check (struct, time, a); Void outresult (struct, routine, a); Void outtrain (struct, station, a); Int, choose (); Struct, routine, pass (struct, station, *a, struct, station, *b); Int (main) / main function { Struct routine result[10]; Int, P, Q, m, n[NUM]={0}, G, h, K, I, J, s[3]={16,18,20}; Char, a, B, C, D, qi[20], zhong[20]; Struct, station, *e[6]={NULL, NULL, NULL, NULL, NULL}; Struct, station, *f[6]={NULL, NULL, NULL, NULL, NULL}; Struct, station, train[NUM][20]={{{0,0,0,0,0,0, T235, 0,0}, {1,12,13,1,12,13, Tianjin, 0,0}, {1,13,30,1,13,34, Cangzhou, 20126}, {1,14,38,1,14,58, Dezhou, 38239}, {1,15,47,1,15,50, Hengshui, 47301}, {1,17,18,1,17,22, Shijiazhuang, 63419}, {1,19,46,1,19,48, Anyang, 92644}, {1,21,27,1,21,34, Zhengzhou, 113831}, {1,22,18,1,22,22, Xuchang, 120917}, {2,0,28,2,0,30, Xinyang, 1431133}, {2,2,49,2,2,57, Wuchang, 1701367}, {2,4,57,2,4,59, Yueyang, 1911582}, {2,6,18,2,6,24, Changsha, 2031729}, {2,9,52,2,9,54, 2312062}, {2,11,28,2,11,30, Chenzhou, Shaoguan East, 2452215}, {2,13,43,2,13,43, Guangzhou, 2662436}}, {{0,0,0,0,0,0, T192, 0,0}, {1,19,04,1,19,04, Hankou, 0,0}, {1,19,46,1,19,48, Xiaogan, 13,70}, {1,21,13,1,21,15, Xinyang., 33214}, {1,23,39,1,23,42, Xuchang, 63430}, {2,0,30,2,0,40, Zhengzhou, 73516}, {2,2,1,2,2,3, Luoyang, 87640}, {2,3,34,2,3,36, Sanmenxia, 103762}, {2,6,40,2,6,51, Xian, 1371027}, {2,8,29,2,8,33, Baoji, 1501200}, {2,10,6,2,10,10, Tianshui,