1 like 0 dislike
16k views
請設計一程式,請使用者輸入五個正整數,然後程式會依照使用者輸入的順序將五個數印出。
Sample input:
1 2 3 4 5

Sample output:
1 2 3 4 5
[Exercise] Coding (C) - asked in 作業 by (18k points)
ID: 14119 - Available when: Unlimited - Due to: Unlimited

edited by | 16k views
0 0
Called for Help

129 Answers

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

int main()



{
* *** * * * * ****** *** * * * i=0;

    int l,j,q,k,x;

    int stu[5]={l,j,q,k,x};
* * ** ** ******* * * * * * **** ** ** ****
*** * ** * * * * *** * *** * ** * ** **** * **** *
**** *** * ** * * * * ** * ** **
** ** ** * *** * **** **** * *** * *** *** ** *
* ** * * ********* * * * * *


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





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



int **



{

int i * *

int c[5] = * ,5 };


* * * * **** ***


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




* ** * ** * 0;



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

#include * * *** * ** **



int main()

{
** * ** * * ** * *****  a , b, c ,d , e ,i;
** * * * * *** ** ** ***** ** ** **** ,&a);
*** ****** *** **** * **** ** ** ** * ** ,&b);
*** * ** ** * ** ** **** * * * * ** *
*** ** ** * * ** * * * * ** * * * *** *
*** ******** * * ***** * * ** * * *** ** *


* * * * ** *** *** ** * an[5] = {a , b , c,d,e};
* *** * * ** ** * * * i < 5; i++)
***** *** * **** *** ** * * ** * * * **


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




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



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

int main()

{
* ** * * *** * * a[5] = {0, 1, 2, 3, 4}, b = 0;


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


* * * ** * * *** *** = 0;b <= 4; b++)
** * * * ***** ** * **** * ",a[b]);


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

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

main()

{
**** * ** *** k[5], i, j, l[60];
* * * * *** ** ( i = 0 ; i ** ** 5 ; i++)
* **** * * ******** ****** * * * *** ** *** ** * *


*** ** * ** * * ** ** ** ( i = 0 ; i ** * 5 ; i++)
** *** * ***** ** * * * *** *** * ***** **** **

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

#include * **



int main()

{
** ** * * * ** * * i ;
** * *** **** * * * ** st[5] ;


** ** ***** * ****** * * ****** * ** &st[0]);
* * * * * * **** * ** ** ** **** * &st[1]);
******* * ** *** ***** *** ** * * * *
*** * * * ** * *** * *** ** * * * *** * &st[3]);
* ** ** ********* * * ** * * *** *** &st[4]);


* ** * *** ** * *** * = 0; i <= 4; i++ )
* * ** ** ** ** ** * ** * * * * * *** ** * ***** * * *** st[i]);


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

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

#include<stdlib.h>



int main()

{
* * *** ***** * * * * * *  i,num[4];
* ** * * ** ***** * * * * ** * * *

    {
* * * *** * *** *** * * ** * * * * * ***** ** * ** ** *** * ***** *
*** * * * *** * *** * ** ** * * * ***** * * * * *
** * ***** **** * * **
* * * ** ** **** ** ** ***** * ***** *
* * *** *** * ** * * **** *** ******* *** * ***** ** ***


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

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

#include **** * ** * *



int main()

{
* * * * * * ** * * ** i;
*** ** ** ** * **** * st[5];


* ***** *** **** * *** * *** ** ** ** * &st[0]);
* * ** **** * ** *** * * * **** * * ** * ** *** ***
* * *** *** * **** * * *** * * * * * * &st[2]);
*** * *** *** * *** * ** *** *** * **** **** &st[3]);
***** * ** * * ** * * * ** * *** * * **** &st[4]);


* * * ** * * ******* * * = 0; i<5; i++ )
* * **** ** *** ** ** *** ** * * * * ** * * * * * st[i]);


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

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

main()

{
*** * * ** ** ** ** k[5], i, j, l[60];
* * * *** * * *** ( i = 0 ; i < 5 ; i++)
* * * *** *** * ** * *** * * ** ***** * *** * * * * * *** ** *
* * * * **** ** *** ** ** * *
******* *** ** ** * ( i = 0 ; i < 5 ; i++)
*** * ***** * * ** ***** * ** ** * * * *** * **
* * * ** **** ** * ** * * ** ** * ** ****
* ****** ** ***** ( i = 0 ; i < 5 ; i++)
*** ***** * * ** * ** *** ** ** * * * ** **** * * * ***

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

#include *** ******** *



int main()

{
* * * **** **** ** **  a , b, c ,d , e ,i;
** ** * *** * * *** ** ** * * * * ,&a);
* **** ** ** ** * * * * * ** *** *** ,&b);
*** ** ** * * * ***** *** ** * **** * *** *
* * * * ***** ** * **** * * *** * *****
** * ** ** * *** ** *** * **** *** *


* * **** * *** * *** an[5] = {a , b , c,d,e};
*** ** *** * ** * ** * i < 5; i++)
** **** * * *** ** ***** * * * * *


* * * *** *** *




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



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

Related questions

0 like 0 dislike
69 answers
[Exercise] Coding (C) - asked Oct 19, 2016 in 作業 by Shun-Po (18k points)
ID: 14288 - Available when: Unlimited - Due to: Unlimited
| 9.8k views
0 like 0 dislike
76 answers
[Exercise] Coding (C) - asked Oct 19, 2016 in 作業 by Shun-Po (18k points)
ID: 14120 - Available when: Unlimited - Due to: Unlimited
| 11k views
0 like 0 dislike
65 answers
[Exercise] Coding (C) - asked Oct 19, 2016 in 作業 by Shun-Po (18k points)
ID: 14272 - Available when: Unlimited - Due to: Unlimited
| 9.8k views
2 like 0 dislike
44 answers
[Exercise] Coding (C) - asked Nov 2, 2016 in 作業 by Shun-Po (18k points)
ID: 16861 - Available when: Unlimited - Due to: Unlimited
| 7.4k 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
| 13.6k views
12,783 questions
183,442 answers
172,219 comments
4,824 users