西工大C語言POJ作業(yè)

1、精選優(yōu)質文檔-傾情為你奉上T081、階乘合計#include int fun(int n)int i,m=1,sum=0;for(i=1;in) break;if(sum-mn) return 0;elsereturn fun(n-m/i);int main()int n;scanf(%d,&n);if(fun(n)printf(YESn);elseprintf(NOn);return 0;T082、路癡#include int main()char fx5;int n,i,d,j;scanf(%s%d,fx,&n)!=EOF;switch(fx0)case S: d=0; break;cas

2、e E: d=1; break;case N: d=2; break;case W: d=3; break;for(i=0;i=0?d:d+4)case 0: printf(Southn); break;case 1: printf(Eastn); break;case 2: printf(Northn); break;case 3: printf(Westn); break;return 0;T083、三點順序#includeint main() int x1,y1,x2,y2,x3,y3; scanf(%d%d%d%d%d%d,&x1,&y1,&x2,&y2,&x3,&y3); if(x2

3、-x1)*(y3-y1)-(x3-x1)*(y2-y1)0) printf(0n); /逆時針 else printf(1n); /順時針 return 0;T084、The Ratio of gainers to losers#include #include int main()int a,b,p,q,p1,q1;scanf(%d%d,&a,&b);p=1,q=0;for(q1=1;q1=b;q1+)p1=(double)(q1*a)/(double)b+0.5;if(q*fabs(a*q1-b*p1)q1*fabs(a*q-b*p)q=q1;p=p1;printf(%d/%dn,p,q)

4、;if(a*q=b*p)break;return 0;T085、最長回文子串#include #include #include int main()char s5001,s15000;int pri5000,max=0,len,i,j,x,y,m=0;gets(s);len=strlen(s);for(i=0;ilen;+i)if(isalpha(si) /是否為字母prim = i; /保存實際位置s1m+ = toupper(si); /轉換為大寫字母for(i=0;i=0&i+jmax)max=2*j+1;x=prii-j;y=prii+j;for(j=0;i-j=0&i+jmax)m

5、ax=2*j+2;x=prii-j;y=prii+j+1;for(i=x;i=y;i+)printf(%c,si);printf(n);return 0;T086、Easy problem#include #include #include int main() int k; long long i, N; k = 0; scanf (%I64d,&N); for (i=1; (i+1)*(i+1)=N+1; i+) if (N+1)%(i+1) = 0) k+; printf (%dn,k); return 0;T087、Hailstone#include #define max(a,b)

6、ab?a:b#define min(a,b) ab?b:aint main()int a,b,m,n,max,count,k;scanf(%d%d,&a,&b);m=max(a,b);n=min(a,b);max=0;for(;nmax)max=count;printf(%d %d %dn,a,b,max);return 0;T088、公園噴水器#include #include int main()float a600,t,sum=0;int n,i,j;scanf(%d,&n);for(i=0;in;i+)scanf(%f,&ai);for(i=0;in;i+)for(j=i+1;jn;j

7、+)if(aiaj)t=ai;ai=aj;aj=t;i=0;/要使噴水裝置半徑和草坪寬度的一半組成的直角三角形的另一邊長度和大于等于20while(sum20)sum+=2*sqrt(ai*ai-1);i+;printf(%dn,i);return 0;T089、操場訓練#include #include int main()int i,j,t,a10000,b10000,n,x,sum=0;scanf(%d,&n);for(i=0;in;i+)scanf(%d%d,&ai,&bi);for(i=0;in;i+)for(j=i+1;jaj)t=aj;aj=ai;ai=t;for(i=0;in;i+)for(j=i+1;jbj)t=bj;bj=bi;bi=t;for(i=0;in;i+)ai-=i;for(i=0;in;i+)for(j=i+1;jaj)t=aj;aj=ai;ai=t;x=(n+1)/2-1;for(i=0;in;i+)sum+=(fabs(bx-bi)+fabs(ax-ai);printf(%dn,sum);return 0;T090、A*B#include int main()int k;lon