《PTA函数答案84594》由会员分享，可在线阅读，更多相关《PTA函数答案84594（28页珍藏版）》请在金锄头文库上搜索。
1、.三、程序填空题3-32程序阅读：下列程序将输出(5分)。# include int s;int f(int m) static int k=0; for(; k=m; k+) s+; return s;int main(void ) int s=1; s=f(2)+f(2); printf(%d#%d#, s, f(20); return 0;四、函数4-3求m到n之和(10分)int sum(int m, int n)int i;int s=0;for(i=m; i=n; i+)s= s + i;return (s);4-34简单输出整数(10分)void PrintN ( int N )
2、int i;for(i=1; i=N; i+)printf(%dn, i);4-36简单求和(10分)int Sum ( int List, int N )int k;int sum=0;for(k=0; kN; k+)sum += Listk;return sum;4-40简单阶乘计算(10分)int Factorial( const int N )int i;int s=1;if( N 0 )return 0;else if( N = 0)return 1;else for(i=1; i=N; i+)s*=i;return s;4-41统计个位数字(15分)int Count_Digit(
3、const int N, const int D) int x; int count=0; int temp=0; x=N; if(x0); return count; 4-43找两个数中最大者(10分)int max( int a, int b )int max;if(a = 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+)putchar( );for(j=0; j i;
4、 j+)printf(%-2d, i); putchar(n);4-45判断奇偶性(10分)int even( int n )if( n0 )n = -n;if( n%2=0 )return 1;elsereturn 0;4-46使用函数求奇数和(15分)int even( int n )if( n0 )n = -n;if( n%2=0 )return 1;elsereturn 0;int OddSum( int List, int N )int k;int oddsum = 0;for(k=0; kN; k+)if(even(Listk)=0)oddsum += Listk;return o
5、ddsum;4-47使用函数计算两点间的距离(10分)double dist( double x1, double y1, double x2, double y2 )double Dist;Dist = sqrt(x1-x2)*(x1-x2) + (y1-y2)*(y1-y2) );return Dist;4-48使用函数求素数和(20分)int prime( int p )int i,j;int 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;
6、i=n;i+)if(prime(i)=1)sum=sum+i;return sum;4-19使用函数统计指定数字的个数(15分)int CountDigit( int number, int digit ) int count,temp,x; x=number; if(x0); return count; 4-20使用函数输出水仙花数(20分)int narcissistic(int number) int i, j, digit, power, powerSum, integer, count, flag; count = 0; integer = number; while (intege
7、r 0) integer = integer / 10; count+; powerSum = 0; 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(in
8、t m, int n) int i; for (i = m + 1; i e)count+;if(count%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=i; j+)cj=cj*j;d=pow(x,i)/cj;sum=sum-d;i+=2;return sum;4-49分类统计字符个数(15分)void f( long int x, char *p ) char q; static int i=0,j=0; if(x0) x=-x; *p=-; p+; q=x%1
9、6; if(q0) f(x, p); *(p+(i-j)=q; j-; 4-7使用函数求特殊a串数列和(20分)int fn( int a, int n )int x;int p=0;int i;for(i=0; in; i+)x= a * pow(10,i);p = p + x;return 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分)void PrintPN( int m, int n )int k;int t;int found = 0;for(k=m; k=n; k+)if (factorsum( k ) = k)found = 1;printf(%d = 1,k);
