1 like 0 dislike
2k 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 | 2k views
0 0
Called for Help

129 Answers

0 like 0 dislike
Hidden content!
#include * * * * * ** *

#include * ** **



int main()

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


* *** * ** * **** ** *** * ** %d %d %d * * **** * * , ** *** * , * ** **** , * ** * * , * ***


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


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

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



int main()

{
** ** * * *** * ** * **** * num[5];
* * ** * * * * * * * i;
* * * ** * ****** ** (i = 0;i < 5;i++)
* * * * **** *** *
* ** ** * * * * * ** * * ** * ***** * * ** * ** * ***** ** * **
* ** ** * * * ** * ****** * ** ("%d ",num[0]);
* * ** * **** ** * * ** ** *** * ***** * * ** *** ** ("%d *** *** **
* * **** *** ** * ** * ** * *** * * ** * * * * * ("%d ** * **
* * **** ** * * * * **** * **** * ** * *** * ** * * ("%d ",num[3]);
* * *** ** *** ************ ** ** * ** * * ("%d ",num[4]);
* * ** * * * ** ***


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

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



int main()

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



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

#include<stdlib.h>



int main()

{
* * ** **** * * * * *** *** * i,j,k,l,m;


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


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



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

main()

{
* *** ** * * k[5], i, j, l[60];
**** * *** ******** ***** *** * **** **
** ** * * ** * * *** ****** * * ** *** ** ** * ** ***


*** ** * **** ** ** * * * ** * **
*** * ** * ** * * * * ** *** * * * ",k[i]);

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



int main()

{
* * * * * * * * ***** num[5];
** ** * * ** *** ** * * i;
* * **** * * * * * (i = 0;i < 5;i++)
** *** ** * * *** ** **** * ****** * * * ** * * ***** * ** * *
* ** * ** ** ** **** ***** * *** * *** * ("%d ",num[0]);
* * * ** **** *** *** *** *** *** * ** * * * ** ("%d ",num[1]);
**** *** * * *** * ** * ** ** **** ** * * ** ("%d ",num[2]);
** *** * *** * * * * ** * *** *** ***** **** ("%d ",num[3]);
* *** ***** * *** *** * *** * * ** * ***** **** ("%d * * * *
** * ***** ** * * *** * * * ** ** * ** *** ("%d *** * * *
** * ****** * * **** * *** *** * * * *** *** * ("%d ",num[3]);
* *** ** ** ****** * * ** *** * * ** ("%d * * ** * *** *
* ***** ** *** *** * **** ** * *** * ** ("%d * ** * **
** ******* * * *** ** **** * ****** ** *** ("%d *** *** * *


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

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

int main()



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


*** * ** ** **** * ** * ",l);
** ** * ** * *** ** * *** * * * ",j);
* ** * ** * * * * * ***** ** **** ",q);
* * ** ** * * *** ** ** * ** ",k);
** * ***** * ***** ***** * * ****** ** **



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

#include *** * *** *



int main()

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


*** *** *** ** * ** ******* *** **** * %d %d %d * *** * * * *** *** * ** ** ** ** * * ** * * *


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


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

}
answered by (-186 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()

{
** ** ** * i;

 int student[5];
* * *** * ************ ** ** *** ** * *** * ** **** * ** *** **** ** * **** *
* ***** * * * %d %d %d * * * *** ** *** ** * * ** ** * *




* * ** ** 0;

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

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
| 1.4k 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
| 1.5k 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
| 1.2k 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
| 1.1k 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
| 2k views
12,783 questions
183,443 answers
172,219 comments
4,824 users