超星 - 第5章函数 - 查题吧

填空题

请将代码补充完整。01 #include 0203 int str2int(char str); //字符串转化为int数值04 char getString(char str); //输入字符串05 int isNum(int);0607 int main()08 {09 char str[21];10 int i;11 getString(str);12 i = str2int(str);13 printf("%d\n", i);14 printf("%d", ii);15 return 0;16 }1718 int str2int(char str)19 {20 int rs = 0;21 while (str)22 {23 if (isNum(str))24 rs = rs 10 + str - '0';25 ++str;26 }27 return rs;28 }2930 int isNum(int n)31 {32 return n >= '0'&&;33 }3435 char getString(char str)36 {37 //assert(str); //可自行扩充，对str进行一些合法性检查，或退出程序，或弹窗，或输出错误信息38 char buffer = str;39 while (1)40 {41 char temp = getchar();42 if (temp == '\n')43 ;44 buffer = temp;45 ++buffer;46 }47 buffer = 0;48 ;49 }

填空题

请将代码补充完整。01 #include 0203 void _strcpy(char target, char src); //拷贝字符串的函数04 char getString(char str); //输入字符串0506 int main()07 {08 char a[256], b[256];09 getString(a);10 _strcpy(b,a);11 printf("%s\n",b);12 return 0;13 }1415 void _strcpy(char target, char src)16 {17 int i = 0;18 char c = 0;19 while((c=(src+i)) != 0)20 {21 (target + i) = c;22 ++i;23 }24 (target+i)=0;25 }2627 char getString(char str)28 {29 //assert(str); //可自行扩充，对str进行一些合法性检查，或退出程序，或弹窗，或输出错误信息30 char buffer = str;31 while (1)32 {33 char temp = getchar();34 if (temp == '\n')35 {36 ;37 }38 buffer = temp;39 ++buffer;40 }41 buffer = 0;42 ;43 }

填空题

请将代码补充完整。01 #include 02 #include 03 #include 0405 char getFileExtName(char );0607 int main()08 {09 char fname[255], extname;10 scanf("%s", fname);11 extname = getFileExtName(fname);12 printf(extname);13 free(extname);14 return 0;15 }1617 char getFileExtName(char filename)18 {19 int len = strlen(filename);20 int i = len - 1, size = 0, j = 0;21 char p = NULL;22 while(i >= 0)23 {24 if((filename+i) == '.');25 --i;26 }27 if(i < 0) return NULL;28 size = len-i;29 p = (char )malloc(sizesizeof());30 for(j = 0; j < size; j++)31 {32 (p+j)=filename[i+j+1];33 }34 *(p+j)=0;35 ;36 }

填空题

请将代码补充完整。01 #include 0203 int _strcmp(char , char );0405 int main()06 {07 char str[2][255];08 for(int i=0;i<2;++i)09 {10 scanf("%s",);11 }12 switch(_strcmp(str[0],str[1]))13 {14 case -1: printf("str1 < str2\n"); break;15 case 0: printf("str1 = str2\n"); break;16 case: printf("str1 > str2\n");17 }18 return 0;19 }2021 int _strcmp(char str1, char str2)22 {23 int rs = 0, i = 0;24 while(((str1+i) == (str2+i)) && (str1+i)!=0 && (str2+i)!=0)25 {26 ;27 }28 if((str1+i) > (str2+i)) rs = 1;29 else if((str1+i) < (str2+i)) rs = -1;30 ;31 }

填空题

请将代码补充完整。01 #include 0203 void draw(int );0405 int main()06 {07 int level;08 scanf("%d", &level);09 draw(level);10 return 0;11 }1213 void draw(int level)14 {15 int i = 0, j = 0;16 for(i = 0; i <; ++i)17 {18 for(j=0; j <; ++j)19 printf(" ");20 for(j=0; j < 2*i+1; ++j)21 ;22 printf("\n");23 }24 }

填空题

请将代码补充完整。01 #include 0203 int prime(int ,int ,int []);0405 int main()06 {07 int nums[999], c, i,num1,num2;08 scanf("%d%d", &num1, &num2);09 c = prime(num1,num2,nums);10 if (c == 0)11 {12 printf("no number!");13 return 0;14 }15 for (i = 0; i

查看答案

填空题

请将代码补充完整。01 #include 02 #include 0304 double H(int,double);0506 int main()07 {08 double s,x;09 int n;1011 scanf("%d",&n);12 scanf("%lf",&x);13 s=H(n,x);14 printf("s = %.2f\n",s);15 return 0;16 }1718 double H(int n, double x)19 {20 double s;21 switch()22 {23 case 0: s=1; break;24 case 1: s=; break;25 default: s=2xH(n-1,x)-2(n-1)H(n-2,x);26 }27 return;28 }

填空题

请将代码补充完整。01 #include 0203 int a[45];0405 int fibon(int);0607 int main()08 {09 int n;10 scanf("%d",);11 printf("%d\n", fibon(n));12 return 0;13 }1415 int fibon(int n)16 {17 if (a[n])18 return a[n];19 int p;20 switch ( )21 {22 case 0: p = 0; break;23 case 1: p = 1; break;24 default: p =;25 }26 return a[n] = p;27 }

填空题

请将代码补充完整。01 #include 0203 int narcis(int [], int); // 获得自幂数的个数04 int getSum(int, int);// 获得n的每位的M次方的和05 int getPower(int, int); // 获得整数 x 的 y 次幂的值0607 int main()08 {09 int a[999];10 // 输入11 int m = 0; // 自幂数的次数 m12 scanf("%d", &m);13 // 调用函数14 int n = narcis(a, m);1516 // 输出17 printf("%d\n", n);18 for(int i = 0; i < n; i++)19 printf("%d ", a[i]);2021 return 0;22 }23 int narcis(int a[], int m)24 {25 int count = 0;26 for (int n = getPower(); n < getPower(10,m); n++)27 {28 if (n == getSum())29 {30 a[count++] = n;31 }32 }33 return count;34 }3536 int getSum(int num, int m)37 {38 int ans = 0;39 while(num)40 {41 int temp =;42 num /= 10;43 ans += getPower(temp, m);44 }45 return ans;46 }4748 int getPower(int x, int y)49 {50 int ans = 1;51 for(int i = 0; i < y; i++)52 ans *=;53 return ans;54 }

填空题

请将代码补充完整。01 #include 0203 int decompose(int, int []);0405 int main()06 {07 int q[255],n,m,i;08 scanf("%d",&n);09 m=decompose(n,q);10 printf("%d=",n);11 for(i=0;i

查看答案

1