0 like 0 dislike
6.7k views
請設計一個程式,利用迴圈輸出文字金字塔。

p.s. 輸入皆為奇數,且不大於20

範例輸入1:

5

範例輸出1:

  *

 ***

*****

輸入範例2:

7

輸出範例2:

   *

  ***

 *****

*******
[Exercise] Coding (C) - asked in 作業 by (18k points)
ID: 13736 - Available when: Unlimited - Due to: Unlimited
1 flag | 6.7k views
0 0
Called for Help
0 0
Called for Help
0 0
Called for Help
0 0
Called for Help
0 0
Called for Help

61 Answers

0 like 0 dislike
Hidden content!
#include <stdio.h>

#include <stdlib.h>

int main()

{
* * * * * * ** ***** *** n,j,k;
**** *** **** ** * ** * ("%d",&n);
* ** * ** * ** ** * ** *** * (j = 1 ; j <= n / 2 + 1 ; j ++)
* * * * ** ** * ** * ** ** * * **
*** * ** * * *** * *** ** *** *** * ***** * * ** * ** * * *** (k = 0;k < n / 2 + 1 - j;k ++)
** * * * * * * * * * * *** * * **** * ** * * * *** * * ** * * ** * * * * * *** ");
* * **** *** * * *** * * * * ** * ** * ** * * *** ** ** * **** ** **** * * * (k = 0;k<(j - 1) * 2 + 1;k ++)
**** * ** ** * ***** **** * ** ** *** * ***** * * * ** ** * ** * * * ***** * * ** ** * ** *** * **
* * * **** *** * * * * ** ****** *** * * * *** * * **** **** ******* * * ** ***
* * *** ** ** * **** * **** * * * * **


* ** * *** ******** * * 0;

}
answered by (-320 points)
0 like 0 dislike
Hidden content!
* **** * *** **
** ** * * ** ** *

int main ()

{
** ** ***** ****** n,j,k;
** ** * *** * *** * ** * ****** *** * ** * **
* ** ****** * * *** ** * ** 1;j <= n / 2 + 1;j ++)
* * ** ** **
* * * ** *** ** * = 0;k < n / 2 + 1 - j;k ++)
* * * * *** ** * ***** * *** *
*** ** ** * * ** ** * = 0;k < ( j - 1)* 2 + 1;k ++)
* * ** * * * ** * * * * ** * *
* **** ***** * * * * * ** * ** * ******


* ** * * ****
* * * * * ** ****** ** 0;

}
answered by (-124 points)
0 like 0 dislike
Hidden content!
#include<stdio.h>

int main()

{
** * *** ******* **** n,j,k;
* *** * * * *** **** *** * * * * *
**** * * *** ** **** ** *** * *

    {
** * * ** * * ** * ** *** * ** ** ********* ** ***
* ** * **** *** * * * ** * * ****** * *** *** * * * **** *** **** ** * * ** * * ** ");
***** ** ***** * * * * * * ** ** *** ** **** * ** ** ** ** * * **
**** * * * ** * * * ****** * **** ** ** * ** ***** * * ******* *** ****** **
** * **** * * * * * * ** * **** * * * * * ******



    }




* *** ** ** ** * 0;





}
answered by (-116 points)
0 like 0 dislike
Hidden content!
#include **** ***



int main()

{
* * ** * * * **** * n, j, k;
** ** * * * ** ** * ** ** **
*** *** ** * ** = 1; j ***** n / 2 + 1; j ++)
* *** ** *
**** * * ** * ***** * * ** * * = 0; k < n / 2 + 1 - j; k ++)
***** *** * * * * ****** * * * * * * **** * ** * * *** * * *
* *** ***** **** * ** * (k = 0;k ***** (j - 1) * 2 + 1;k ++)
* * * *** * * * * * * ***** * * *** *** ** *
* **** ** * * * * * *** ***
** * **
* * * ** * * 0;

}
answered by (-74 points)
0 like 0 dislike
Hidden content!
#include * * * * *

#include ** * *** ** *



int main()

{
** *** * *** * n,j,k;
* * * * * **** * ** ** ******
********* * *** ** * = 1; j <= n / 2 + 1; j++)
** * **** *
** ****** ** * * ***** * * ***** * =0; k < n / 2 + 1 - j; k++)
** * * * * ** * ** * * **** *** * * ** * * ** ** ");
* * * ** **** * * * **** ****** *** ** = ***** * - 1)*2+1;k++ )
* * * * * ** * ******** * * ** ****** **** * * ** ** * **
* *** *** * ** * * ** ** * ** * *** ** ** *
* * * * *** *
** ** * *** 0;

}
answered by (-162 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>

int main()

{
*** *** ** ** * n,j,k;
* ** * * * * ***** ** *** **** *** *** *
** ** **** * ***** = 1; j <= n/2 +1 ;j++)
**** * * * *
* ** * * * * ** ** * * = 0; k< n/2 + 1 - j; k++)
* **** * ******* *** ** * * * * * **** *** * * ");
* **** * *** ** *** * ** * * ******* * **** * *
* *********** ** *** * ** * * ***** * * * * * *
** ** * * *** ** * **** ** * * * * * *** ** ** ** *
**** * * *
* **** **** ***** * * 0;



}
answered by (43 points)
0 like 0 dislike
Hidden content!
***** *** * *



int main()

{
* * * * * * ** * n, j, k;


*** ** * * ***** * * ** * * , &n);
* ** * * ***** * = 1; j <= n / 2 + 1;j ++)
** * *** *** * *
* * ** ** ** * *** * * * ** * ** *** ** * * = 0;k < n / 2 + 1 - j;k ++)
* *** *** *** **** * * **** * * * * * ");
* * * **** * **** * **** *** * * ** * < (j-1) * 2 + 1;k ++)
* **** * ** * * *** * * *** *** ***** * * ** ********* ***
* * ****** * * ** ** ** * * *** * *** * * * *
* **** ****
**** * *** * ** 0;

}
answered by (-114 points)
0 like 0 dislike
Hidden content!
/*
***** **** ****** **
*** *** ** ** ** *
* ***** *
*** **** ***

*********

*/
** * ** * *



int main()

{
* * *** * * n,j,k;
**** * * * ** **** * * * * **
*** * *** *** = 1; j <= n / 2 + 1; j ++)
* * *** *
** ** *** *** *** *** * = 0;k < n / 2 + 1 - j;k ++)
* ** * ***** * ** ** * * *** ***** * * * * * ** * *
* *** * ** = 0;k < (j - 1) * 2 + 1;k ++)
* ** ** * * * * * * * ** * * * * *** * *** * **** *
** ***** * * ** * * * *** ** * * ***
*** *** *
** * *** ****** * 0;

}
answered by (18k points)
0 like 0 dislike
Hidden content!
#include <stdio.h>



int main() {

    
* * *** * * *** ***** ** i,j,a=0;
** **** **** ** **** * ** *** **** * * ** * *

    
*** * *** * ** * * * *** * ** * **
* * *** * *** * * * * * * * *
* ****** ** ** *** ** ** * ** * *** ** ** ** == 0){


* * * ******** * * ****** * * * * ** ** * ** * * ** ** **** * * ** ** *** * *
* * ** **** * * * *** ** * * * * * * *
* * * * ** * * *** *** * * * ** * ***
*** ** *** * ** * ** ** *** *** *** ** * *** * * * * ** * ** *** *
*** * * *** **** * * ******* ******** * * * * * *
** ** * **** * * * ** **** *** ** ** * *** ** *** * ** * *

    }
*** **** ***** **** * ** *** * ****

    
* * * ***** * *** *** 0;

}
answered by (-126 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>

#include <stdlib.h>



int main()

{
* * * * ** ** * ** num1= 0,i=1 ,j ;
** * ** *** *** ** * * *** ****
**** * 1== num1%2 && num1<=20)
* ** * ** * ***** *




*** * *** ** * ** *** ** * (i<=num1)
*** * * * *** *
** ** * *** * * ** * * ***** * **** ** ** * * ** *
*** * ** * * **** ** **** ***** *** *****
* ** ** ** * ** ***** ** **** ***** ** ** ** * ** * *** ** ** ** *
** * * * ** * ** * *** ** ** ***** **
* ********* ***** * **** * ** * * * * * ** **
* * ** ** * * * ** * * * ** *** **
* * **** * * * ****

   }
** ** ***** * ** * * 0 ;



}
answered by (-122 points)
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:172.69.130.71
©2016-2025

Related questions

0 like 0 dislike
64 answers
[Exercise] Coding (C) - asked Oct 13, 2016 in 作業 by Shun-Po (18k points)
ID: 13763 - Available when: Unlimited - Due to: Unlimited
| 6.4k views
0 like 0 dislike
91 answers
[Exercise] Coding (C) - asked Oct 13, 2016 in 作業 by Shun-Po (18k points)
ID: 13617 - Available when: Unlimited - Due to: Unlimited
| 9.6k views
0 like 0 dislike
117 answers
[Exercise] Coding (C) - asked Oct 13, 2016 in 作業 by Shun-Po (18k points)
ID: 13581 - Available when: Unlimited - Due to: Unlimited
| 10.6k views
0 like 0 dislike
152 answers
[Exercise] Coding (C) - asked Oct 5, 2016 in 作業 by Shun-Po (18k points)
ID: 12295 - Available when: Unlimited - Due to: Unlimited
| 13.7k views
1 like 0 dislike
48 answers
[Exercise] Essay (Open question) - asked Nov 2, 2016 in 作業 by Shun-Po (18k points)
ID: 16865 - Available when: Unlimited - Due to: Unlimited
| 6.2k views
12,783 questions
183,442 answers
172,219 comments
4,824 users