西工大noj答案完整版

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

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

3、單詞頻次46. 迭代求根47. 多項式的猜想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. 火車站64. 獲取指定二進(jìn)制位65. 積分計算66. 級數(shù)和67. 計算A+B68. 計算PI69. 計算70. 計算成績71. 計算完全數(shù)72. 檢測位圖長寬73. 檢查圖像文件格式74. 獎金發(fā)放75. 階乘合計76. 解不等式77. 精確冪乘78. 恐怖水母79. 快速排序80. 粒子裂變

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

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

6、左中右142. 組合數(shù)143. 最次方數(shù)144. 最大乘積145. 最大整數(shù)146. 最小整數(shù)147. 最長回文子串148. 左上角149. 左下角1 “1“的傳奇#include #include #include 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;i12;i+)m=m/10;k+;if(m=0)break;q=n;k=k-1;for(a=1;a=2)s=s+x+z*k*(x/10);elses=s+z*k*(x/10);for(j=p;j=n;j+) m=j; for(i=1;i12

7、;i+) x=m%10; if(x=1) s+;m=m/10; if(m=0) break; printf(%d,s);return 0;2 A+B#include int doubi(int n,int m) n=n+m; n=n%100; return n;int main() int t,i,a100,n,m; 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#include int main()i

8、nt A,B,sum;scanf(%d%d,&A,&B);sum=A+B; printf(%dn,sum); return 0;4 AB#include #include #include 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=10) sprintf(q,%d,n); n=0; for(i=0;istrlen(q);i+) n=n+qi-48; printf(%d,n); return 0;5 ACKERMAN#i

9、nclude #include #include 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,&m,&b); m=ack(m,b); printf(%d,m); return 0;6 Arithmetic Progressions#include #include #include int g(int n) int i; if(n=1) ret

10、urn 0; if(n=2) return 1; if(n=3) return 1; for(i=2;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;in;i+) printf(%dn,di); return 0;7 Bee#include #include int main() int A100,i=0,j,k,female=0,male=1,x; for(;i+

11、)scanf(%d,&Ai);if(Ai=-1)break;for(j=0;ji;j+)female=0,male=1;for(k=1;kAj;k+)x=female;female=male;male=x+male+1;printf(%d %dn,male,female+male+1);return 0;8 Checksum algorithm#include #include #include int main()int i,n,t,j; char s100100; for(i=0;i+)gets(si);if(si0=#) break; n=i;for(i=0;in;i+)t=0;for(

12、j=0;jstrlen(si);j+)if(sij=32) t=t;else t=t+(j+1)*(sij-64);printf(%dn,t); return 0;9 Coin Test#include #include 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;j0.003|x-0.5-0.003)printf(Fail);elseprintf(%d/%d,a,a+b);OH:return 0;10 Dexter need hel

13、p#include int fun(int a)if(a=1) return 1;elsereturn fun(a/2)+1;int main()int a,b100,i=0,j;while(1) scanf(%d,&a); if(a=0)break;bi=fun(a);i+;for(j=0;ji;j+) printf(%dn,bj);return 0;11 Double#include #include #include int main() int a100,b100,i,j,n,t=0; for(i=0;i+) scanf(%d,&ai); if(ai=0) break; n=i; fo

14、r(i=0;in;i+) bi=2*ai; for(i=0;in;i+) for(j=0;jn;j+) if(ai=bj) t+; printf(%d,t); return 0;12 Easy problem#include #include #include int main() int N,i,n,j=0; scanf(%d,&N); for(i=2;iN+1;i+) if(N+1)%i=0)j+; printf(%d,j/2); return 0;13 Favorite number#include #include #define MAXNUM 100000int prime_numb

15、er = 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) 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_pri

16、me(); ans0 = 0; dp1 = 0; for (i = 1; i dpi + 1) dpi + 1 = dpi + 1; for (j = 0; j 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;io;i+) printf(%dn,di);14 Graveyard#include #include #

17、include 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;in;i+) p=10000; if(bi%ai=0)printf(0.0000n);continue; t=10000/(double)ai); for(j=1;jai+bi;j+) l=10000/(double)(ai+bi); l=t-j*l; l=fabs(l); if(lp) p=l; s=(ai-1)*p; printf(%.4lfn,s

18、); return 0;15 Hailstone#include #include #include 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 main() int n,m,i,j=0,t; scanf(%d%d,&m,&n); printf(%d %d,m,n); if(mn) t=m,m=n,n=t; for(i=m;ij) j=f(i); printf( %d,j); return 0;16 Hanoi #include #include #

19、define M 70int startM, targeM;long long f(int *p, int k, int fina) if(k=0) return 0; if(pk=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=1&startc=targec;c-); if(c=0) printf(0

20、n); 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 #include #include #define pi 3.1415926int f(float x,float y) int i; for(i=0;i+) if(50*isqrt(x*x+y*y)*sqrt(x*x+y*y)*pi/2) break; return i;int main() int n,i,a100; flo

21、at x,y; scanf(%d,&n); for(i=0;in;i+) scanf(%f%f,&x,&y); ai=f(x,y); for(i=0;in;i+) printf(%d %dn,i+1,ai); return 0;18 Music Composer19 Redistribute wealth#include #include #include 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+) scan

22、f(%d,&ai); s=s+ai; m=s/n; b1=a1-m; b0=0; for(i=2;in;+i) bi=bi-1+ai-m; for(i=0;in;i+) for(j=0;jbj+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;ik;i+) printf(%dn,ci); return 0;20 Road trip#include #include #include int f(int n) int a100,b100,i,s;

23、for(i=0;in;i+) scanf(%d%d,&ai,&bi); s=a0*b0; for(i=1;in;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;in;i+) printf(%dn,ci); return 0;21 Scoring#include #include #include int main() int i,j,sum,min,c,count,n,a,b; char s150,

24、s250; scanf(%d,&n); for(i=0;in;i+) count=sum=0; scanf(%s,s2); for(j=0;jc|(count=c&summin) min=sum; c=count; strcpy(s1,s2); printf(%s %d %dn,s1,c,min); return 0;22 Specialized Numbers#include #include int main() int i,n,sum10,sum12,sum16; for(i=2992;i3000;i+) n=i; sum10=0; while(n) sum10+=n%10; n/=10

25、; n=i; sum12=0; while(n) sum12+=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 #include #include int len64, n, minlen, get;bool b64;int cmp(const void *a, const void *b) return *(int *)a = n) return false; if(get = nowget

26、) 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; else if(leni + nowlen minlen) bi = true; if(dfs(nowlen+leni, nowget, i+1) return true; bi = false; if(

27、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(%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

28、= 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;24 Sum of Consecutive#include #include #include int len64,n,minlen,get;int b64;int cmp(const void *a,const void *b) return *(int *)a=n) return 0; if(ge

29、t=nowget) return 1; int i,f=0; if(nowlen=0) f=1; for(i=cnt;in;i+) if(leni+nowlen=minlen) bi=1; if(dfs(0,nowget+1,nowget) return 1; bi=0; return 0; else if(leni+nowlenminlen) bi=1; if(dfs(nowlen+leni,nowget,i+1) return 1; bi=0; if(f) return 0; while(i+1n&leni=leni+1) i+; return 0;int main() int i,tol

30、len,q=0,c100; while(scanf(%d,&n),n) tollen=0; int j=0,p; for(i=0;in;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=minl

31、en; q+; break; for(i=0;iq;i+) printf(%dn,ci); return 0;25 Symmetric Sort#include #include #include 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;ji;j+)if(Aj=2)printf(1n);elseint B10000,m=1,number=0;double n;B0=2;for(k=3;k=Aj;k+=2)n=(double)k;for(

32、l=2;l=sqrt(n);l+)if(k%l=0)goto ai;Bm=k;m+;ai:;for(k=0;km;k+)sum=0;for(l=k;lm;l+)sum+=Bl;if(sum=Aj)number+;break;printf(%dn,number);return 0;26 The Clock#include #include #include int main() char s100100,a100; int i,j,n; scanf(%d,&n); for(i=0;in;i+) scanf(%s,si); for(i=0;in-1;i+) for(j=0;jstrlen(si+1

33、) strcpy(a,si),strcpy(si,si+1),strcpy(si+1,a); if(n%2=0) for(i=0;i0;i=i-2) printf(%s ,si); else for(i=0;i0;i=i-2) printf(%s ,si); return 0;27 The Ratio of gainers to losers#include int main() char s5; int i,sum=0; gets(s); for(i=0;si!=0;i+) switch(si) caseI: sum+=1;break; caseV: sum=5-sum;break; caseX:sum=10-sum;break; printf(%dn,sum); return 0; 28 VOL大學(xué)乒乓球比賽#include #include int main() printf(A=ZnB=XnC=Yn); return 0;29 畢業(yè)設(shè)計論文打印#include #include int main() int