《西工大poj终极版答案》由会员分享，可在线阅读，更多相关《西工大poj终极版答案（232页珍藏版）》请在金锄头文库上搜索。
1、西北工业大学 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 trip21.Scoring22
2、.Specialized Numbers23.Sticks24.Sum of Consecutive25.Symmetric Sort26.The Clock27.The Ratio of gainers to losers28.VOL 大学乒乓球比赛29.毕业设计论文打印30.边沿与内芯的差31.不会吧，又是 A+B32.不屈的小蜗33.操场训练34.插入链表节点35.插入排序36.插入字符37.成绩表计算38.成绩转换39.出租车费40.除法41.创建与遍历职工链表42.大数乘法43.大数除法44.大数加法45.单词频次46.迭代求根47.多项式的猜想48.二分查找49.二分求根50.发工
3、资的日子51.方差52.分离单词53.分数拆分54.分数化小数55.分数加减法56.复数57.高低交换58.公园喷水器59.韩信点兵60.行程编码压缩算法61.合并字符串62.猴子分桃63.火车站64.获取指定二进制位65.积分计算66.级数和67.计算 A+B68.计算 PI69.计算 70.计算成绩71.计算完全数72.检测位图长宽73.检查图像文件格式74.奖金发放75.阶乘合计76.解不等式77.精确幂乘78.恐怖水母79.快速排序80.粒子裂变81.链表动态增长或缩短82.链表节点删除83.两个整数之间所有的素数84.路痴85.冒泡排序86.你会存钱吗87.逆序整数88.排列89.排
4、列分析90.平均值函数91.奇特的分数数列92.求建筑高度93.区间内素数94.三点顺序95.山迪的麻烦96.删除字符97.是该年的第几天98.是该年的第几天？99.数据加密100.搜索字符101.所有素数102.探索合数世纪103.特殊要求的字符串104.特殊整数105.完全数106.王的对抗107.危险的组合108.文件比较109.文章统计110.五猴分桃111.小型数据库112.幸运儿113.幸运数字”7“114.选择排序115.寻找规律116.循环移位117.延伸的卡片118.羊羊聚会119.一维数组”赋值“120.一维数组”加法“121.勇闯天涯122.右上角123.右下角124.圆
5、及圆球等的相关计算125.圆及圆球等相关计算126.程序员添加行号127.找出数字128.找幸运数129.找最大数130.整数位数131.重组字符串132.子序列的和133.子字符串替换134.自然数立方的乐趣135.字符串比较136.字符串复制137.字符串加密编码138.字符串逆序139.字符串排序140.字符串替换141.字符串左中右142.组合数143.最次方数144.最大乘积145.最大整数146.最小整数147.最长回文子串148.左上角149.左下角1“1“的传奇#include #include #include int main()int n,i,j,k=0,x=1,y,z,
6、m,p,q,a,s=0;scanf(%d,m=n;for(i=1;i=2)s=s+x+z*k*(x/10);elses=s+z*k*(x/10);for(j=p;jint doubi(int n,int m)n=n+m;n=n%100;return n;int main()int t,i,a100,n,m;scanf(%d,for (i=0;iint main()int A,B,sum;scanf(%d%d,sum=A+B;printf(%dn,sum);return 0;4AB#include #include #include int main()char s100,q100;double
7、 a,b,c;int n=0,i;scanf(%lf%lf,c=a*b;sprintf(s,%.0lf,c);for(i=0;i=10)sprintf(q,%d,n);n=0;for(i=0;i#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=ack(m,b);printf(%d,m);return 0;6Arithmetic
8、 Progressions#include #include #include 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=c) break;return s;int main()int a,b,c,d100,i=0,n;while(1)scanf(%d%d%d,if(a=0di=f(a,b,c);i+;n=i;for(i=0;i#include int main()int A100,i=0,j,k,female=0,male=1,x;for(;i+)scanf(%d,if(Ai=
9、-1)break;for(j=0;j#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;i#include int main()char A100000;int n,i=0,a=0,b=0,j;double x;while(1)scanf(%c,if(Ai=n)break;i+;for(j=0;j0.003|x-0.5int fun(int a)if(a=1) return 1;elsereturn fun(a/2)+1;int main()in
10、t a,b100,i=0,j;while(1)scanf(%d,if(a=0)break;bi=fun(a);i+;for(j=0;j#include #include int main()int a100,b100,i,j,n,t=0;for(i=0;i+)scanf(%d,if(ai=0) break;n=i;for(i=0;i#include #include int main()int N,i,n,j=0;scanf(%d,for(i=2;i#include #define MAXNUM 100000int prime_number = 0;int prime_listMAXNUM;b
11、ool 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 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 +
12、 1;while (scanf(%d%d, &i, &j) = 2 & (i | j) do=ansj - ansi - 1;o+;for(i=0;i#include #include int main()int a100,b100,n,i,j;double s,p,l,t;for(i=0;i+)scanf(%d%d,if(ai=0n=i;for(i=0;i#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
13、,i,j=0,t;scanf(%d%d,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;16Hanoi #include #include #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=1if(c=0)printf(0n); continu
14、e;int other=6-startc-targec;ans=f(start,c-1,other)+f(targe,c-1,other)+1;printf(%lldn,ans);return 0;17Houseboat#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;float x,y;scanf(%d,for(i=
15、0;i#include #include int main()int a1000,b1000,n,i,j,s,sum,t,m,mid,c100,k=0;while(1)scanf(%d,if(n=0) break; s=0;for(i=1;ibj+1) t=bj,bj=bj+1,bj+1=t;mid=bn/2;sum=0;for(i=0;i#include #include int f(int n)int a100,b100,i,s;for(i=0;i#include #include int main()int i,j,sum,min,c,count,n,a,b;char s150,s250;scanf(%d,for(i=0;ic|(count=c&sum#include int main()int i,n,sum10,sum12,sum16;for(i
