西工大noj復(fù)習(xí)資料完整版

1、西北工業(yè)大學(xué)POJ答案絕對(duì)是史上最全版（不止100題哦按首字母排序）1 . “1 “的傳奇2 .A+B3 .A+B n4 .AB5 .ACKERMAN6 .Arithmetic Progressions7.Bee8 .Checksum algorithm9 .Coin Test10 .Dexter need help11 .Double12 .Easy problem13 .Favorite number14 .Graveyard15 .Hailstone16 .Hanoi n17 .Houseboat18 .Music Composer19 .Redistribute wealth20 .R

2、oad trip21.Scoring21 .Specialized Numbers23.Sticks22 .Sum of Consecutive23 .Symmetric Sort26. The Clock27. The Ratio of gainers to losers28. VOL 大學(xué)乒乓球比賽29. 畢業(yè)設(shè)計(jì)論文打印30. 邊沿與內(nèi)芯的差31. 不會(huì)吧，又是A+B32. 不屈的小蝸33. 操場(chǎng)訓(xùn)練34. 插入鏈表節(jié)點(diǎn)35. 插入排序36. 插入字符37. 成績(jī)表計(jì)算38. 成績(jī)轉(zhuǎn)換39. 出租車(chē)費(fèi)40. 除法41. 創(chuàng)建與遍歷職工鏈表42. 大數(shù)乘法43. 大數(shù)除法44. 大數(shù)加法4

3、5. 單詞頻次46. 迭代求根47. 多項(xiàng)式的猜想48. 二分查找49. 二分求根50. 發(fā)工資的日子51. 方差52. 分離單詞53. 分?jǐn)?shù)拆分54. 分?jǐn)?shù)化小數(shù)55. 分?jǐn)?shù)加減法56. 復(fù)數(shù)57. 高低交換58. 公園噴水器59. 韓信點(diǎn)兵60. 行程編碼壓縮算法61. 合并字符串62. 猴子分桃63. 火車(chē)站64. 獲取指定二進(jìn)制位65. 積分計(jì)算66. 級(jí)數(shù)和67. 計(jì)算A+B68. 計(jì)算PI69. 計(jì)算兀70. 計(jì)算成績(jī)71. 計(jì)算完全數(shù)72. 檢測(cè)位圖長(zhǎng)寬73. 檢查圖像文件格式74. 獎(jiǎng)金發(fā)放75. 階乘合計(jì)76. 解不等式77. 精確冪乘78. 恐怖水母79. 快速排序80.

4、粒子裂變81. 鏈表動(dòng)態(tài)增長(zhǎng)或縮短82. 鏈表節(jié)點(diǎn)刪除83. 兩個(gè)整數(shù)之間所有的素?cái)?shù)84. 路癡85. 冒泡排序86. 你會(huì)存錢(qián)嗎87. 逆序整數(shù)88. 排列89. 排列分析90. 平均值函數(shù)91. 奇特的分?jǐn)?shù)數(shù)列92. 求建筑高度93. 區(qū)間內(nèi)素?cái)?shù)94. 三點(diǎn)順序95. 山迪的麻煩96. 刪除字符97. 是該年的第幾天98. 是該年的第幾天？99. 數(shù)據(jù)加密100. 搜索字符101. 所有素?cái)?shù)102. 探索合數(shù)世紀(jì)103. 特殊要求的字符串104. 特殊整數(shù)105. 完全數(shù)106. 王的對(duì)抗107. 危險(xiǎn)的組合108. 文件比較109. 文章統(tǒng)計(jì)110. 五猴分桃111. 小型數(shù)據(jù)庫(kù)112.

5、 幸運(yùn)兒113. 幸運(yùn)數(shù)字”7“114. 選擇排序115. 尋找規(guī)律116. 循環(huán)移位117. 延伸的卡片118. 羊羊聚會(huì)119. 一維數(shù)組”賦值“120. 一維數(shù)組”加法“121. 勇闖天涯122. 右上角123. 右下角124. 圓及圓球等的相關(guān)計(jì)算125. 圓及圓球等相關(guān)計(jì)算126. 程序員添加行號(hào)127. 找出數(shù)字128. 找幸運(yùn)數(shù)129. 找最大數(shù)130. 整數(shù)位數(shù)131. 重組字符串132. 子序列的和133. 子字符串替換134. 自然數(shù)立方的樂(lè)趣135. 字符串比較136. 字符串復(fù)制137. 字符串加密編碼138. 字符串逆序139. 字符串排序140. 字符串替換141.

6、 字符串左中右142. 組合數(shù)143. 最次方數(shù)144. 最大乘積145. 最大整數(shù)146. 最小整數(shù)147. 最長(zhǎng)回文子串148. 左上角149. 左下角1 . 1 “的傳奇#include <stdio.h>#include <stdlib.h>#include <math.h>int main()(int n,i,j,k=0,x=1,y,z,m,p,q,a,s=0;scanf("%d",&n);m=n;for(i=1;i<12;i+)(m=m/10;k+;if(m=0) break;q=n;k=k-1;for(a=1;

7、a<=k;a+)(x=x*10;)y=q%x;z=q/x;p=q-y;if(z>=2)s=s+x+z*k*(x/10);elses=s+z*k*(x/10);forG=p；j<=n;j+)(m=j;for(i=1;i<12;i+)(x=m%10;if(x=1)s+;m=m/10;if(m=O) break;printf("%d",s);return 0;2 A+B#include <stdio.h>int doubi(int n,int m)n=n+m;n=n%100;return n;int main()int t,i,a100,n,m

8、;scanf("%d",&t);for (i=0;i<=(t-1);i+)scanf("%d%d",&n,&m);ai=doubi(n,m);for (i=0;i<=(t-1);i+)printf("%dn",ai);return 0;3 . A+B n#include <stdio.h>int main()int A,B,sum;scanf("%d%d",&A,&B);sum=A+B;printf("%dn",sum);retur

9、n 0;4 AB#include <stdio.h>#include <stdlib.h>#include <string.h>int main()char s100,q100;double a,b,c;int n=0,i;scanf("%lf%lf",&a,&b);c=a*b;sprintf(s,"%.0lf",c);for(i=0;i<strlen(s);i+)n=n+si-48;while(n>=10)sprintf(q,"%d",n);n=0;for(i=0;i&

10、lt;strlen(q);i+) n=n+qi-48;printf("%d",n);return 0;5 ACKERMAN#include <stdio.h>#include <stdlib.h>#include <math.h>int ack(int x,int y)int n;if (x=0) n=y+1;return n;else if (y=0) n=ack(x-1,1);else n=ack(x-1,ack(x,y-1);return n;int main()int m,b;scanf("%d%d",&

11、;m,&b);m=ack(m,b);printf("%d",m);return 0;6 Arithmetic Progressions#include <stdio.h>#include <stdlib.h>#include <math.h>int g(int n)int i;if(n=1) return 0;if(n=2) return 1;if(n=3) return 1;for(i=2;i<=sqrt(n);i+) if(n%i=0) return 0;return 1;int f(int a,int b,int c)

12、int i=0,s=a-b;if(c=1&&g(a)=1) return a;if(b=0&&g(a)!=1) return -1;while(1)s=s+b;if(g(s) i+;if(i>=c) break; return s;int main()int a,b,c,d100,i=0,n;while(1)scanf("%d%d%d",&a,&b,&c);if(a=0&&b=0&&c=0) break;di=f(a,b,c);i+;n=i;for(i=0;i<n;i+)pr

13、intf("%dn",di);return 0;7 Bee#include <stdio.h>#include <stdlib.h> int main()int A100,i=0,j,k,female=0,male=1,x;for(;i+)scanf("%d",&Ai);if(Ai=-1)break;for(j=0;j<i;j+)female=0,male=1;for(k=1;k<Aj;k+)x=female;female=male;male=x+male+1;printf("%d %dn"

14、,male,female+male+1);return 0;8 Checksum algorithm#include <stdio.h>#include <stdlib.h>#include <string.h>int main()int i,n,t,j;char s100100;for(i=0;i+)gets(si);if(si0='#') break;n=i;for(i=0;i<n;i+)t=0;for(j=0;j<strlen(si);j+)if(sij=32) t=t;else t=t+(j+1)*(sij-64);pri

15、ntf("%dn",t);return 0;9 Coin Test#include <stdio.h>#include <stdlib.h>int main()char A100000;int n,i=0,a=0,b=0,j;double x;while(1)scanf("%c",&Ai);if(Ai='n')break;i+;for(j=0;j<i;j+)if(Aj='S')printf("WA");goto OH;if(Aj='U')a+;if(

16、Aj='D') b+;x=a*1.0/(a+b)*1.0;if(x-0.5>0.003|x-0.5<-0.003) printf("Fail");elseprintf("%d/%d",a,a+b);OH:return 0;10 Dexter need help#include <stdio.h>int fun(int a)if(a=1) return 1;else return fun(a/2)+1;int main()int a,b100,i=0,j;while(1)scanf("%d",&a

17、mp;a);if(a=0)break;bi=fun(a);i+;for(j=0;j<i;j+)printf("%dn",bj);return 0;11 Double#include <stdio.h>#include <stdlib.h>#include <math.h>int main()(int a100,b100,i,j,n,t=0;for(i=0;i+)scanf("%d”,&ai);if(ai=0) break;n=i;for(i=0;i<n;i+)bi=2*ai;for(i=0;i<n;i+

18、)for(j=0;j<n;j+)if(ai=bj) t+;printf("%d",t);return 0;12 . Easy problem#include <stdio.h>#include <stdlib.h> #include <math.h>int main()int N,i,n,j=0;scanf("%d",&N);for(i=2;i<N+1;i+)if(N+1)%i=0)j+;printf("%d",j/2);return 0;13 Favorite number#i

19、nclude <stdio.h>#include <string.h>#define MAXNUM 100000int prime_number = 0;int prime_listMAXNUM;bool is_primeMAXNUM;int ansMAXNUM + 2;int dpMAXNUM + 2;void set_prime() int i, j;memset(is_prime, 0, sizeof(is_prime);for (i = 2; i < MAXNUM; i+) if (is_primei = 0) prime_listprime_number

20、+ = i;if (i >= MAXNUM / i) continue;for (j = i * i; j < MAXNUM; j+=i) is_primej = 1;int main() int i, j, k,o=0,d100;memset(dp, -1, sizeof(dp);set_prime();ans0 = 0;for (i = 1; i <= MAXNUM; i+) ansi = ansi - 1 + dpi;if (dpi + 1 = -1 | dpi + 1 > dpi + 1) dpi + 1 = dpi + 1;for (j = 0; j <

21、 prime_number; j+) if (i > MAXNUM / prime_listj) break;k = i * prime_listj;if (dpk = -1 | dpk > dpi + 1) dpk = dpi + 1;while (scanf("%d%d", &i, &j) = 2 && (i | j) do=ansj - ansi - 1;o+;for(i=0;i<o;i+)printf("%dn",di);14 Graveyard#include <stdio.h>#i

22、nclude <stdlib.h>#include <math.h>int main()int a100,b100,n,i,j;double s,p,l,t;for(i=0;i+)scanf("%d%d",&ai,&bi);if(ai=0&&bi=0) break;n=i;for(i=0;i<n;i+)p=10000;if(bi%ai=0)printf("0.0000n");continue;t=10000/(double)ai);for(j=1;j<ai+bi;j+)l=10000/(

23、double)(ai+bi);l=t-j*l;l=fabs(l);if(l<p) p=l;s=(ai-1)*p;printf("%.4lfn",s);return 0;15 Hailstone#include <stdio.h>#include <stdlib.h>#include <string.h>int f(int n)int s=1;while(1)if(n=1) return s;else if(n%2=0) n=n/2,s+;else n=3*n+1,s+;int n,m,i,j=0,t;scanf("%d%d

24、",&m,&n);printf("%d %d",m,n);if(m>n) t=m,m=n,n=t;for(i=m;i<=n;i+)if(f(i)>j) j=f(i);printf(" %d",j);return 0;16 . Hanoi n#include <stdio.h>#include <stdlib.h>#define M 70int startM, targeM;long long f(int *p, int k, int fina)if(k=0) return 0;if(pk

25、=fina) return f(p,k-1,fina);return f(p,k-1,6-fina-pk)+(1LL<<(k-1);int main ()long long ans;int n;while(scanf("%d",&n),n)int i;for(i=1;i<=n;i+) scanf("%d",&starti);for(i=1;i<=n;i+) scanf("%d",&targei);int c=n;for(;c>=1&&startc=targec;c-

26、);if(c=0)printf("0n"); continue;int other=6-startc-targec;ans=f(start,c-1,other)+f(targe,c-1,other)+1;printf("%lldn",ans);return 0;17 Houseboat#include <stdio.h>#include <stdlib.h>#include <math.h>#define pi 3.1415926int f(float x,float y)int i;for(i=0;i+)if(50*

27、i>sqrt(x*x+y*y)*sqrt(x*x+y*y)*pi/2) break;return i;int main()int n,i,a100;float x,y;scanf("%d",&n);for(i=0;i<n;i+)scanf("%f%f",&x,&y);ai=f(x,y);for(i=0;i<n;i+)printf("%d %dn",i+1,ai);return 0;18 Music Composer19 Redistribute wealth#include <stdio

28、.h>#include <stdlib.h>#include <math.h>int main()int a1000,b1000,n,i,j,s,sum,t,m,mid,c100,k=0;while(1)scanf("%d",&n);if(n=0) break;s=0;for(i=1;i<=n;i+)scanf("%d”,&ai);s=s+ai;m=s/n;b1=a1-m;b0=0;for(i=2;i<n;+i)bi=bi-1+ai-m;for(i=0;i<n;i+)for(j=0;j<n-1-

29、i;j+)if(bj>bj+1)t=bj,bj=bj+1,bj+1=t;mid=bn/2;sum=0;for(i=0;i<=n-1;+i) sum=sum+fabs(mid-bi);ck=sum;k+; for(i=0;i<k;i+) printf("%dn",ci);return 0;20 Road trip#include <stdio.h>#include <stdlib.h>#include <math.h>int f(int n)int a100,b100,i,s;for(i=0;i<n;i+)scanf

30、("%d%d",&ai,&bi);s=a0*b0;for(i=1;i<n;i+)s=s+ai*(bi-bi-1);return s;int main()int n,c100,i=0;while(1)scanf("%d",&n);if(n=-1) break;ci=f(n);i+;n=i;for(i=0;i<n;i+)printf("%dn",ci);return 0;21 Scoring#include <stdio.h>#include <stdlib.h>#include

31、 <string.h> int main()int i,j,sum,min,c,count,n,a,b;char s150,s250;scanf("%d",&n);for(i=0;i<n;i+)count=sum=0;scanf("%s",s2);for(j=0;j<4;j+)scanf("%d%d",&a,&b);if(b!=0)sum+=(a-1)*20+b;count+;if(i=0)c=count,min=sum;strcpy(s1,s2);else if(count>c|

32、(count=c&&sum<min)min=sum;c=count;strcpy(s1,s2);printf("%s %d %dn",s1,c,min);return 0;22 Specialized Numbers#include <stdio.h>#include <stdlib.h> int main()int i,n,sum10,sum12,sum16;for(i=2992;i<3000;i+)n=i;sum10=0;while(n)sum10+=n%10;n/=10;n=i;sum12=0;while(n)sum

33、12+=n%12;n/=12;n=i;sum16=0;while(n)sum16+=n%16;n/=16;if(sum10=sum12&&sum12=sum16) printf("%dn",i);return 0;23 Sticks#include <stdio.h>#include <string.h>#include <stdlib.h>int len64, n, minlen, get;bool b64;int cmp(const void *a, const void *b)return *(int *)a <

34、; *(int *)b ? 1 : -1;bool dfs(int nowlen, int nowget, int cnt)if(cnt >= n) return false;if(get = nowget) return true;int i;bool f = false;if(nowlen = 0) f = true;for(i = cnt; i < n; i+)if(!bi)if(leni + nowlen = minlen)bi = true;if(dfs(0, nowget+1, nowget) return true;bi = false;return false;el

35、se if(leni + nowlen < minlen)bi = true;if(dfs(nowlen+leni, nowget, i+1)return true;bi = false;if(f) return false;while(i + 1 < n && leni = leni+1) i+;return false;int main()int i, tollen;while(scanf("%d", &n), n)tollen = 0;int j = 0, p;for(i = 0; i < n; i+)scanf("

36、%d", &p);if(p <= 50)lenj = p;tollen += lenj;j+;n = j;if(n = 0)printf("0n");continue;qsort(len, n, sizeof(int), cmp);for(minlen = len0; minlen+)if(tollen % minlen) continue;memset(b, 0, sizeof(b);get = tollen / minlen;if(dfs(0, 0, 0)printf("%dn", minlen);break;return 0

37、;24 Sum of Consecutive#include <stdio.h>#include <stdlib.h>#include <string.h>int len64,n,minlen,get;int b64;int cmp(const void *a,const void *b)return *(int *)a<*(int *)b?1:-1;int dfs(int nowlen,int nowget,int cnt)if(cnt>=n) return 0;if(get=nowget) return 1;int i,f=0;if(nowl

38、en=0) f=1;for(i=cnt;i<n;i+)if(leni+nowlen=minlen)bi=1;if(dfs(0,nowget+1,nowget) return 1;bi=0;return 0;else if(leni+nowlen<minlen)bi=1;if(dfs(nowlen+leni,nowget,i+1) return 1;bi=0;if(f) return 0;while(i+1<n&&leni=leni+1) i+;return 0;int main()int i,tollen,q=0,c100;while(scanf("

39、%d",&n),n)tollen=0;int j=0,p;for(i=0;i<n;i+)scanf("%d",&p);if(p<=50)lenj=p;tollen+=lenj;j+;n=j;if(n=0)printf("0n");continue;qsort(len,n,sizeof(int),cmp);for(minlen=len0;minlen+)if(tollen%minlen) continue;memset(b,0,sizeof(b);get=tollen/minlen;if(dfs(0,0,0)cq=mi

40、nlen;q+;break;for(i=0;i<q;i+)printf("%dn",ci);return 0;25 Symmetric Sort#include <stdio.h>#include <stdlib.h>#include <math.h>int main()double A100;int i=0,j=0,k=0,l=0,sum=0;while(1)scanf("%lf",&Ai);if(Ai=0)break;i+；)for(j=0;j<i;j+)(if(Aj=2)printf(&quo

41、t;1n");elseint B10000,m=1,number=0;double n;B0=2;for(k=3;k<=Aj;k+=2)n=(double)k;for(l=2;l<=sqrt(n);l+)if(k%l=0)goto ai;)Bm=k;m+;ai:;for(k=0;k<m;k+)sum=0;for(l=k;l<m;l+)sum+=Bl;if(sum=Aj)number+;break;printf("%dn",number);return 0;26 The Clock#include <stdio.h>#includ

42、e <stdlib.h>#include <string.h>int main()char s100100,a100;int i,j,n;scanf("%d",&n);for(i=0;i<n;i+) scanf("%s",si);for(i=0;i<n-1;i+)for(j=0;j<n-1-i;j+)if(strlen(si)>strlen(si+1)strcpy(a,si),strcpy(si,si+1),strcpy(si+1,a);if(n%2=0)for(i=0;i<n-1;i=i+2

43、) printf("%s ",si);printf("%s ",sn-1);for(i=i-3;i>0;i=i-2) printf("%s ",si);elsefor(i=0;i<n-1;i=i+2) printf("%s ",si);printf("%s ",sn-1);for(i=i-1;i>0;i=i-2) printf("%s ",si);return 0;27 The Ratio of gainers to losers#include<st

44、dio.h> int main()char s5;int i,sum=0;gets(s);for(i=0;si!='0'i+)switch(si)case'I': sum+=1;break;case'V': sum=5-sum;break;case'X':sum=10-sum;break;printf("%dn",sum);return 0;28 VOL 大學(xué)乒乓球比賽#include <stdio.h>#include <stdlib.h>int main()printf(&qu

45、ot;A=ZnB=XnC=Yn");return 0;29 畢業(yè)設(shè)計(jì)論文打印#include <stdio.h>#include <stdlib.h>int main()int a100,j=1,i,n,m;scanf("%d%d",&n,&m);for(i=0;i<n;i+)scanf("%d",&ai);for(i=0;i<n;i+)if(ai>am) j+;printf("%d",j+);return 0;30 .邊沿與內(nèi)芯的差#include <

46、stdio.h>#include <stdlib.h>int main()(int A100100,i,j,m,n,s=0,t=0;scanf("%d%d",&n,&m);for(i=1;i<=n;i+)(for(j=1;j<=m;j+)(scanf("%d",&A皿);)for(i=2;i<m;i+)s=s+A1i;for(i=2;i<m;i+)s=s+Ani;for(i=1 ;i<=n;i+)s=s+Ai1;for(i=1 ;i<=n;i+) s=s+Aim;for(i=2

47、;i<n;i+)(for(j=2;j<m;j+)(t=t+AiO；)s=s-t;printf("%d",s);return 0;)31 .不會(huì)吧，又是A+B#include <stdio.h>#include <stdlib.h>int main()int AH,AM,AS,BH,BM,BS;scanf("%d%d%d%d%d%d",&AH,&AM,&AS,&BH,&BM ,&BS);AH=AH+BH;AM=AM+BM;AS=AS+BS;if(AS>=60)AM=A

48、M+1;AS=AS-60;if(AM>=60)AH=AH+1;AM=AM-60;printf("%d %d %d",AH,AM,AS);return 0;#include <stdio.h>#include <stdlib.h>int main()int n,i,s=0;scanf("%d",&n);for(i=0;i+)s=s+10;if(s>=n) break;s=s-5;printf("%d",i+1);return 0;33 操場(chǎng)訓(xùn)練#include <stdio.h>#

49、include <stdlib.h>#include <math.h>void BubbleSort(double A,int s,int m)int i,j;double k;for(j=s;j<m+s-1;j+)for(i=s;i<m+s-1;i+)if(Ai>Ai+1)k=Ai;Ai=Ai+1;Ai+1=k;int main()int n,i;double X10000,Y10000,s1=0,s2=0,s=0;scanf("%d",&n);for(i=0;i<n;i+)scanf("%lf%lf&qu

50、ot;,&Xi,&Yi);s2+=Xi;BubbleSort(X,0,n);for(i=0;i<n;i+)s1+=Xi-i*1.0;s1=(int)(s1/n) + 0.5);s2=(int)(s2/n) + 0.5);for(i=0;i<n;i+)s=s+abs(Xi-i-s1)+abs(Yi-s2);printf("%.0lf",s);return 0;34 插入鏈表節(jié)點(diǎn)#include <stdio.h>#include <stdlib.h>typedef struct tagLNodeint data;struct

51、 tagLNode *next;LNode,*LinkList;void create(LinkList *l,int n)LinkList p,s;p=*l=(LinkList)malloc(sizeof(LNode);for(;n>0;n-)s=(LinkList)malloc(sizeof(LNode);scanf("%d",&s->data);p->next=s,p=s;p->next=NULL;void list(LinkList l)LinkList p=l->next;while(p!=NULL)printf("

52、%d ",p->data);p=p->next;void chazhao(LinkList l,int n)LinkList p=l->next,s,q;int i,j,k;for(i=0;i<100;i+)j=p->data;q=p->next;k=q->data;if(j<n&&k>n) break;p=p->next;s=(LinkList)malloc(sizeof(LNode);s->data=n;s->next=p->next,p->next=s;int main()Lin

53、kList q;int n,m;q=(LinkList)malloc(sizeof(LNode);scanf("%d",&n);create(&q,n);scanf("%d",&m);chazhao(q,m);list(q);return 0;35 插入排序#include <stdio.h>#include <stdlib.h>void charu(int a,int s,int m)int i,k,t;for(i=s+1;i<=s+m-1;i+)t=ai;k=i-1;while(t>ak)a

54、k+1=ak;k-;if(k=s-1)break;ak+1=t;int main()int a100,n,i,s,m;scanf("%d",&n);m=n;for(i=0;i<n;i+)scanf("%d",&ai);scanf("%d%d",&s,&m);charu(a,s,m);for(i=0;i<n;i+)printf("%d ",ai);return 0;36 插入字符#include <stdio.h>#include <stdlib.h>

55、;int main()char A80=0,*p,x;int i;p=A;gets(A);scanf("%c%d",&x,&i);for(;*p!='0'p+);for(;p>A+i;p-)*p=*(p-1);*(A+i)=x;puts(A);return 0;37 成績(jī)表計(jì)算#include <stdio.h>#include <stdlib.h>struct taglong int no;char name21;int age;double yy,sx,yw,zz,wl,hx,xx,s,jun;int mai

56、n()struct tag a10,t,q;int i,j;for(i=0;i<10;i+)scanf("%ld%s%d%lf%lf%lf%lf%lf%lf%lf",&ai.no,ai.n ame,&ai.age,&ai.yy,&ai.sx,&ai.yw,&ai.zz,&ai.w l,&ai.hx,&ai.xx);for(i=0;i<10;i+)ai.s=ai.yy+ai.sx+ai.yw+ai.zz+ai.wl+ai.hx+ai.xx;ai.jun=ai.s/7;t.s=a0.s;for(i=1;i<10;i+)if(ai.s>t.s) t.s=ai.s;j=i;q=aj;printf("%ld %s %d %.2lf %.2lf %.2lf %.2lf %.2lf %.2lf %.2lf",q.no,,q.age,q.yy,q.sx,q.yw,q.zz,q.wl,q.hx,q.xx );return 0;