题目内容

请将代码补充完整。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 }