《PTA程序设计答案.doc》由会员分享，可在线阅读，更多相关《PTA程序设计答案.doc（169页珍藏版）》请在金锄头文库上搜索。
1、PTA所有答案工业gc1601学习小组一、判断题二、选择题 三、函数题4-3 求m到n之和 (10分)答案：int sum(int m, int n) int s=0,i; for(i=m;i=n;i+) s+=i; return s;4-34 简单输出整数 (10分)答案：void PrintN ( int N ) int i; for(i=1;i=N;i+) printf(%dn,i);4-36 简单求和 (10分)答案：int Sum ( int List, int N ) int i,s=0; for(i=0;iN;i+) s+=Listi; return s;4-40 简单阶乘计算
2、(10分)答案：int Factorial( const int N )int i, s=1;if( N 0 )return 0;else if( N = 0)return 1;else for(i=1; i= b)max = a;elsemax = b;return max;4-44 数字金字塔 (15分)答案：void pyramid(int n)int i, j, space;for(i=1; i = n; i+)space = n - i;for(j=0; j space; j+)printf( );for(j=0; j i; j+)printf(%-2d, i); printf(n)
3、;4-45 判断奇偶性 (10分)答案：int even( int n )if( n%2=0 )return 1;elsereturn 0;4-46 使用函数求奇数和 (15分)答案：int even( int n )if( n%2=0 )return 1;elsereturn 0;int OddSum( int List, int N )int i;int oddsum = 0;for(i=0; iN; i+)if(even(Listi)=0)oddsum += Listi;return oddsum;4-47 使用函数计算两点间的距离 (10分)答案：double dist(double
4、x1, double y1, double x2, double y2)double d;d = sqrt(x1 - x2)*(x1 - x2) + (y1 - y2)*(y1 - y2);return d;4-48 使用函数求素数和 (20分)答案：int prime( int p )int i,j,count =0;for(j=2;j0&p!=1)return 1;elsereturn 0;int PrimeSum( int m, int n ) int i,sum=0; for(i=m;i 0) integer = integer / 10; count+; powerSum = 0;
5、integer = number; for (i = 0; i count; i+) digit = integer % 10; integer = integer / 10; power = 1; for (j = 0; j count; j+) power = power*digit; powerSum = powerSum + power; if (powerSum = number) flag = 1; else flag = 0; return flag;void PrintN(int m, int n) int i; for (i = m + 1; i e)count+;if(co
6、unt%2!=0) cj=1;for(j=1; j=i; j+) cj=cj*j;d=pow(x,i)/cj;sum=sum+d;i+=2; else cj=1;for(j=1; j= a&si = A&si = 0&si = 9)n3+;else n4+;printf(letter = %d, blank = %d, digit = %d, other = %d,n1,n2,n3,n4);4-7 使用函数求特殊a串数列和 (20分)答案：int fn( int a, int n )int x,p=0,i;for(i=0; in; i+)x= a * pow(10,i);p = p + x;r
7、eturn p;int SumA( int a, int n )int k;int sum=0;for(k=0; kn+1; k+)sum = sum + fn( a , k );return sum;4-22 使用函数输出指定范围内的完数 (20分)答案：int factorsum( int number ) int i,s=1; for(i=1; i1 & number%i = 0) s+=i; return s;void PrintPN( int m, int n )int k,t,found = 0;for(k=m; k=n; k+)if (factorsum( k ) = k)fou
8、nd = 1;printf(%d = 1,k); for(t=1; t1 & k%t = 0)printf( + %d, t);printf(n);if (found = 0)printf(No perfect number); 4-25 使用函数输出一个整数的逆序数 (20分)答案：int reverse( int number )int m=0;if(number 0)m = m*10 + number%10;number=number/10;return m;4-50 移动字母 (10分)答案：void Shift( char s )int i,n;char a3;n = strlen(s);for(i=0; i3)for(i=3; in; i+)si-3 = si;for(i=0; i3; i+)sn-3+i=ai;4-51 在数组中查找指定元素 (15分)答案：int search(int list, int n, int x) int i, result; for (i=0; in; i+) if (listi = x) result = i; break; if (i = n) result = -1; return result;4-52 数组循环右移 (20分)答案：int ArrayShift(int a, in
