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

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

31 Answers

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

#include <stdlib.h>

#include <math.h>

int main(void) {
* * * * ** *** * * * i=0,a[5];
** * ** **** * ** * ** *****
* ** * * * ** ** *
** * ***** ** ***** * * **** ** *** **** * * *** **** * * ******* *** * *** *
* ** ** ** * * * * * * *
** ***** * ** * ** * *** * * *
* * ** ** * **
* **** * ***** * ** *** * * * ******** ** **** **** *** ***
** *** **** **** * ********* * * * ** * *** **** * * * ** ");
***** ** *** * ** * *
* * **** ** *** * * * EXIT_SUCCESS;

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

#include <stdlib.h>

#include <math.h>

int main(void) {
***** * ***** * ***** ** ** i=0,a[5];
*** ** ****** * * ****** * * ******* * *
* *** ***** * * * **
* *** * ** **** ***** * ** ** **** * * *** ** * * * * *** * **** * **
** * *** * ** **
* ** ** * * ** ** ***** * * * *
** * * * * * **** ** * *
* * * * * *** * ** * ** * ** * * * ** *** *** * ** *****
* *** * * ** * * ****
* * *** ** ** * EXIT_SUCCESS;

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

#include * * ***



int main()

{
*** ***** * ** * ***** a[5];
* * * *** * * ** ** i;
* ** * * ** ** * * * = 0; i < 5; i++)
***** ** *** *** * ***** * * * * * *** * * * ** ** ** * *** ** * *
**** ** ** * ** = 4; i >= 0; i--)
* **** ***** *** *** * ** ** *** *** ** * * ** ** ****** **** * a[i]);
****** ** ** ** * * 0;

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

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

int main()

{
* * ** *** * *** i,stud[5]={0};
* ** ** ** * *** ** * *
* ** * * *** ** * = 0; i < 5; i++)
*** ******* ***** * ** ** * ** * * ** * ***** *** * ** &stud[i]);
* ** * * * ** ******
*** * * ** * * * * = 4; i >= 0;i--)

***** * * ***** * **** * *** * *** ** ** ", stud[i]); * * * ** ** * ****
***** * * *** ** ***
* *** ** * * ****** * * ** ** ****** ** **
* * * **** *** * *** ** * 0;

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

#include *** *



int main()

{
*** ******* *** * i, ** * *
* * * ***** ** * ** = 0;i < 5;i ++)
* ***** * * ** ********* ** * * ***** **** **** ** * ** **
* *** ** * ** * * = 4;i >= 0;i --)
* * ** ***** *** * ** * * * * ** * ** * * * num[i]);
* * ***** * *** * * * * * ** * *
* ** *** *** * 0;

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

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

int main()

{
* * *** ** **** * i,stud[5]={0};
* *** *** * ** ****
** * * * ** ******* * * = 0; i < 5; i++)
*** *** * *** * ** ** * *** * ** * * *** * * ** &stud[i]);
* **** *** ** ** * **
**** ***** ******* ** * = 4; i >= 0;i--)

* * * * * ** ***** ** *** * ****** ** * * ** ** * * stud[i]); *** * * * * ** ***
**** * *
** * * *** *** * * ***** *** * * ** ** **
* * * * ** * *** ** *** 0;

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

#include * * *** * **

int main()

{
*** * * *** ** ** **** * i,stud[5]={0};
** ** * * * * * * *
* ****** *** * * * *** * = 0; i < 5; i++)
**** * * **** * ****** * *** * * * * * * ** ** **** &stud[i]);
*** * *** * ** * ***
** * ** * ** ** **** ** = 4; i >= 0;i--)

* * ** * * * **** *** * * * * * * * * * * stud[i]); * * * * **** * *** * *
* ** * * *** *
** **** * ** ** *** ** * *** ** * * ** * **
** * ** * * ** *** * * *** * 0;

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



int main()

{
** * * * * * * * * i, j, tmp, * *


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



for (j=0; j ** * 4; j++)
*** * * * ******** * (i = j+1; i *** * 5; i++)

if (num[j] ** * num[i])

{
** * * ** * ** * ** * = num[j];
* * * ** * * * * * ** * = num[i];
* *** **** * ** ** * = tmp;

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




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

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

#include * ** ** **



int main()

{
* * * ** **** ** i;
* *** * * * num[5];
**** * *** * ** ** = 0;i *** 4;i ++)
* * *** * ** * ***** ** ** ** * * ** * ** **** ** * * *
** * * *** *** = 4;i * * * ;i --)
* ** ** * *** * **** * ** ****** ** *** **** ** ** num[i]);


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

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

int main()

{
* *** ** * * ***** * * num[5]={0};
* ******** * * ** ** * ** *** i;
*** ***** * ** * i<5;i++)
* **** *** ** *****
* * ** *** * * **** * * ** * **** * *** *** &num[i]);
**** * * * ***********
** * **** **** * * * *** i>=0;i--)
*** * ** ****** * * *
****** ** * *** * * * * **** **** *** * * * * * * ",num[i]);
* ***** * * * * * * *
*** * * * ********* * * * * ** *** ** ** * * *
* *** ******* * * * ** 0;

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

Related questions

0 like 0 dislike
54 answers
[Exercise] Coding (C) - asked Oct 20, 2016 in 作業 by Shun-Po (18k points)
ID: 14583 - Available when: Unlimited - Due to: Unlimited
| 3.7k views
0 like 0 dislike
37 answers
[Exercise] Coding (C) - asked Oct 20, 2016 in 作業 by Shun-Po (18k points)
ID: 14579 - Available when: Unlimited - Due to: Unlimited
| 2.5k views
0 like 0 dislike
37 answers
[Exercise] Coding (C) - asked Oct 20, 2016 in 作業 by Shun-Po (18k points)
ID: 14581 - Available when: Unlimited - Due to: Unlimited
| 2.8k views
0 like 0 dislike
31 answers
[Exercise] Essay (Open question) - asked Nov 3, 2016 in 作業 by Shun-Po (18k points)
ID: 16958 - Available when: Unlimited - Due to: Unlimited
| 2.4k views
0 like 0 dislike
159 answers
[Exercise] Coding (C) - asked Sep 29, 2016 in 作業 by Shun-Po (18k points)
ID: 11639 - Available when: Unlimited - Due to: Unlimited
| 9.6k views
12,783 questions
183,442 answers
172,219 comments
4,824 users