PTA函数答案

三、程序填空题3-32程序阅读：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 ){int i;for(i=1; i<=N; i++)printf("%d\n", i);}4-36 简单求和 (10分)int Sum ( int List[], int N ){int k;int sum=0;for(k=0; k<N; k++)sum += List[k];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;elsefor(i=1; i<=N; i++)s*=i;return s;}—4-41 统计个位数字 (15分)int Count_Digit(const int N, const int D){int x;int count=0;int temp=0;x=N;if(x<0)x=-x;do{temp=x%10;if(temp==D)count++;x=x/10;}while(x>0);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; j++)printf("%-2d", i);putchar('\n');}}4-45 判断奇偶性 (10分)int even( int n ){if( n<0 )n = -n;if( n%2==0 )return 1;elsereturn 0;}—4-46 使用函数求奇数和 (15分)int even( int n ){if( n<0 )n = -n;if( n%2==0 )return 1;elsereturn 0;}int OddSum( int List[], int N ){int k;int oddsum = 0;for(k=0; k<N; k++)if(even(List[k])==0)oddsum += List[k];return oddsum;}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;j<p;j++){if(p%j==0){count++;}}if(count==0&&p>0&&p!=1){return 1;} else{return 0;}}int PrimeSum( int m, int n ){int i,sum=0;for(i=m;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(x<0)x=-x;do{temp=x%10;if(temp==digit)count++;x=x/10;}while(x>0);return count;}—4-20 使用函数输出水仙花数 (20分)int narcissistic(int number){int i, j, digit, power, powerSum, integer, count, flag;count = 0;integer = number;while (integer > 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;elseflag = 0;return flag;}void PrintN(int m, int n){int i;for (i = m + 1; i < n; i++){if (narcissistic(i) == 1)printf("%d\n", i);}}—4-21 使用函数求余弦函数的近似值 (15分)double funcos( double e, double x ){double sum=0,d=100;int i=0,j;double cj;int count=0;while(d>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(x<0){x=-x;*p='-';p++;}q=x%16;if(q<10)q=('0'+q);elseq=('A'+q-10);x=x/16;j++;i=j;if(x>0)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; i<n; 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; k<n+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);for(t=1; t<= k/2; t++)if(t>1 && 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){number = -number;printf("-");}else if(number==0)m=0;while(number>0){m = m*10 + number%10;number=number/10;}return m;}—4-50 移动字母 (10分)void Shift( char s[] ){int i;int n;char a[3];n = strlen(s);for(i=0; i<3; i++)a[i] = s[i];if( n>3 )for(i=3; i<n; i++){s[i-3] = s[i];}for(i=0; i<3; i++)s[n-3+i]=a[i];return s;}—4-51 在数组中查找指定元素 (15分)int search(int list[], int n, int x){int i, result;for (i=0; i<n; i++){if (list[i] == x){result = i;break;}}if (i == n)result = -1;return result;}—4-52 数组循环右移 (20分)int ArrayShift(int a[], int n, int m){int i=0;int s[10];if(m>=n)m=m%n;if(m!=0){for(i=n-m; i<n; i++)s[i-(n-m)] = a[i];for(i=n-m-1; i>=0; i--)a[i+m]=a[i];for(i=0; i<m; i++)a[i]=s[i];}return 0;}注：最后一个样例（2分），段错误没通过，暂时还没找到原因4-54 删除字符 (20分)void delchar( char *str, char c ){int i, j;for (j=i=0;str[i]!='\0';i++)if (str[i]!=c){str[j]=str[i];j++;}str[j]='\0';}—4-55 分类统计各类字符个数 (15分)void StringCount( char *s ){int i,bletter=0,sletter=0,blank=0,digit=0,other=0;for(i=0;s[i]!='\0';i++){if(s[i]>='A' && s[i]<='Z')bletter++;else if(s[i]>='a' && s[i]<='z')sletter++;else if(s[i]==' ')blank++;else if(s[i]>='0' && s[i]<='9')digit++;elseother++;}printf("%d %d %d %d %d",bletter,sletter,blank,digit,other);}4-26 使用递归函数计算1到n之和 (10分)int sum( int n ){int i;int Sum=0;if(n<=0)return 0;elsefor(i=1; i<=n; i++)Sum += i;return Sum;}4-28 递归求阶乘和 (15分)double fact( int n ){int i;double m=1;if(n==0)return m;elsefor(i=1; i<=n; i++)m = m*i;return m;}double factsum( int n ){int j;double sum;sum = 0;if(n>0){for(j=1; j<=n; j++)sum += fact(j);}return sum;}4-29 递归实现指数函数 (15分)double calc_pow( double x, int n ){int i;double m=1;for(i=1; i<=n; i++)m = m*x;return m;}4-32 递归求Fabonacci数列 (10分)int f( int n ){int d;if(n==0)d=0;else if(n==1)d=1;else d=f(n-2)+f(n-1);return d;}4-33 十进制转换二进制 (15分)void dectobin( int n ){int t;if(n==0||n==1)printf("%d",n%2);else{t=n;dectobin(n=n/2);printf("%d",t%2);}}—4-8 递归实现顺序输出整数 (15分)void printdigits( int n ){int N=1;int i;int shang;int yushu;int m;m=n;while(m>9){N++;m=m/10;}for(i=N-1; i>=0; i--){shang = n * pow(10,-i);yushu = n - shang * pow(10 , i);n = yushu;printf("%d\n", shang);}}—4-9 统计各位数字之和是5的数 (20分)int is( int number ){int s=0;int yushu = number;while(number > 0){yushu = number % 10;s = yushu + s;number = number / 10;}if(s == 5)return 1;elsereturn 0;}void count_sum( int a, int b ){int i;int count=0;int count_Sum=0;for(i=a; i<=b; i++)if( is(i) ){count++;count_Sum = count_Sum + i;}printf("count = %d, sum = %d", count, count_Sum);}—4-10 简单实现x的n次方 (10分)double mypow( double x, int n ){int i;double s=1;for(i=0; i<n; i++)s = s*x;return s;}4-13 使用函数求1到10的阶乘和 (10分)double fact( int n ){int k;int s=1;for(k=1;k<=n; k++)s = s * k;return s;}4-14 使用函数求最大公约数 (10分)int gcd( int x, int y ){int i,t;if(x<y){t=y;y=x;x=t;}for(i=y;i>=1;i--)if(x%i==0 && y%i==0)break;return i;}—4-15 使用函数的选择法排序 (25分)void sort( int a[], int n ){int temp,k,min,i;for(k=0;k<n-1;k++){min=k;for(i=k+1;i<n;i++)if(a[i]<a[min])min=i;temp=a[min];a[min]=a[k];a[k]=temp;}}4-16 函数实现字符串逆序 (15分)void f(char *p){char temp;char *end = p +my_strlen(p) - 1;while (end > p){temp = *p;*p = *end;*end = temp;--end;++p;}}int my_strlen(char *p){char *q = p;while(*p != '\0')p++;return p-q;}—4-17 递归计算P函数 (15分)double P( int n, double x ){double z;if(n == 0)z = 1;else if(n == 1)z=x;else if(n > 1)z = ((2*n-1)*P(n-1,x) - (n-1)*P(n-2,x))/n;return z;}4-1 计算存款利息-genlib (10分)int main(void){int money, year;double interest, rate;scanf("%d", &money);scanf("%d", &year);scanf("%lf", &rate);interest = money * pow(1+rate,year) - money;printf("interest = %.2f\n", interest);return 0;}—4-2 弹球距离 (15分)double dist( double h, double p ){double d=h;while(p!=0){h=p*h;if(h<TOL)break;d=d+2*h;}return (d);。