Toggle navigation
Courses
Questions
Tags
Users
AC 20161019 作業 4
0
like
0
dislike
5.2k
views
請設計一程式,讓使用者輸入十個正整數,程式會將這十個數從小到大輸出。
Sample input:
5 3 1 6 4 8 9 7 2 2
Sample output:
1 2 2 3 4 5 6 7 8 9
[Exercise]
Coding (C)
-
asked
Oct 19, 2016
in
作業
by
Shun-Po
(
18k
points)
ID: 14288 -
Available when:
Unlimited
-
Due to:
Unlimited
|
5.2k
views
comment
0
0
Called for Help
0
0
Called for Help
Please
log in
or
register
to add a comment.
69
Answers
0
like
0
dislike
Hidden content!
#include ** * * * **
#include * * **********
int main(void)
{
int a[10];
int i,j,t;
for * * * **** *
**** *** * *** ** * *** * * * **** **** * *
for (j=0;j<9;j++)
* * ** * * ** * * * * ** * *** ** * *
* **** ** *** * ** ** * * ** * (a[j] < a[i])
** * *** * * * **** *** ***** * * *
*** ** *** * * * * * * * * ** ** * * *** *** ** * * ** * *
* * ******* ** * * * * * ** * *** * * ** **** ** *****
*** * *** ** * *** ****** *** * *** ** * * * *** * **** **** *** * ** *
** * ** *** * ** ****** **** * * * ** ** * *** *
for * * * * *
printf("%d ",a[i]);
return 0;
}
answered
Oct 19, 2016
by
410523007
(
-157
points)
ask related question
comment
Please
log in
or
register
to add a comment.
0
like
0
dislike
Hidden content!
#include<stdio.h>
#include<stdlib.h>
int main()
{
int i,j,num[10],tmp;
* *** * *** ** * *** = 0 ;i < 10 ;i++)
* ****** * ** ** *** * * * ** ******* ** * *** ** * **** ** * * *** *
***** *** * ** ***** * ** *********
******* ** * * * **** ** * * * ***** * * * ** * + 1 ;i < 10 ;i++)
** * * * * *** * **** * * * **** * ** *** * * * * **** ** **** ** * **** * *** * *
* * ** *** * * ** * * ** ** * *** * * ** * ** *** * *** * *
* * *** * * * * * ** ** *** * * *** ** * * ** * * * * * * *
**** ** ** * * * * **** * * **** * * * *** ** ** ** * * ***
** *** * ** ** * **** * *** * *** * * ** * *** * * ***** * *** **** * * * * ***
** * * *** *** ** * * **** ** ***** * * * ** *** * * *
for(i = 0 ;i < 10 ;i++)
* * ** ** **** * * * ** ** * *** * * ** ** * * ** ** ** * * ***** *
* **** * * ******** * ** * * * * **
* * * ** ** ** * *** *** 0;
}
answered
Oct 19, 2016
by
m8f2617
(
-103
points)
ask related question
comment
Please
log in
or
register
to add a comment.
0
like
0
dislike
Hidden content!
#include<stdio.h>
* ** * ******* *
int main()
{
** ** *** **** ** ** i, j, num[10], tmp;
** *** *** * *** * (i = 0;i < 10; i++)
*** * * ** ** ** **** ******** * * **** *** *** *** * * ***
** *** * * ** * * *** (j = 0;j < 9; j++)
** ** * ** *** * ** ** *** * * ** * (i = j+1;i < 10 ;i++)
* * * ** ****** * *** ** ** **** * *** *** ** (num[j] > num[i])
* **** * *** * **** * * * * ******* * ** * *****
* * * **** * ** * * * ** * * ** *** ***** * ** ** * **** * ** * * = num[j];
** ** * * ** **** ** **** * ** ** * ** ** * ** * * ** * ** = num[i];
*** *** *** *** *** ** *** ** * ** *** * ** * ** * * * = tmp;
*** *** * **** ** ** ***** * * **** *** * * *
** * * * *** ******* (i = 0;i < 10 ;i++)
** ***** * *** * ***** * * ****** ** ** * ** *** * * ", num[i]);
**** * *** ** * * * 0;
}
answered
Oct 19, 2016
by
Queenie0915
(
-124
points)
ask related question
comment
Please
log in
or
register
to add a comment.
0
like
0
dislike
Hidden content!
#include<stdio.h>
******* *
int main(){
int a[10]={0},i=0,b=0,c=0;
* ** **** * * * **
* * ** ** * *** **** ** * * ** *** *
** * ** ** a[0];
*** * * * * ********** **
** ** *** ***** * ** * * * ** * * *** * *
* * * * ** *** * ** * * **
* * *** * **** ** ** *** *
* * * ** ** * * * * * * *
*** * * * *** ** *** * **
** * **** ** * * **** **
** ***** *** **** ***
** * * *** * *** ***** * * ** ",a[i]);
return 0;
}
answered
Oct 19, 2016
by
SRFX
(
-140
points)
ask related question
comment
Please
log in
or
register
to add a comment.
0
like
0
dislike
Hidden content!
#include <stdio.h>
#include <stdlib.h>
int main()
{
int i, j, num[10], tmp;
* * *** (i = 0; i < 10; i++)
***** * ** * * * ***** * ** ** ** * ** &num[i]);
*** * * * *** *** (j = 0; j < 9; j++)
* * ** ** ** *** ** * **** * * **
* *** * * *** ** * * * * ** ** * *** ** ** * (i = j + 1; i < 10; i++)
* * *** * * * ****** ** *** * ** * * * * * ** *** **** **
* ** * ** *** * ** * * * **** * ** ** ** *** * ** * * * ** *
*** * **** * ***** * *** **** * * * ***** **** ** ** * * * ** ** *** * * * * ***** ** = num[j];
** ** * * ** * * * **** * * *** * ** * ** *** ** * **** *** * ** * * * * *** ** = num[i];
** ** ** * * * *** * * ** ** * *** *** * ***** * **** ** ** * ** * = tmp;
* ** ** ** * ** * *** **** * * ** ** * **** * *** **** * **** *
**** *** * *** * ** ******* **
***** *** * * * * * * (i = 0; i < 10; i++)
** * *** ** * *** ***** * **** * * ** **** * * * **
return 0;
}
answered
Oct 19, 2016
by
莊長穎
(
-42
points)
ask related question
comment
Please
log in
or
register
to add a comment.
0
like
0
dislike
Hidden content!
#include <stdio.h>
#include <stdlib.h>
int main()
{
** ***** * * * * i, j, t;
** * * * **** * * ** * * **** n[10]= {0};
* * ****** * *** * **** = 0; i < 10; i++)
***** * ** * * *** * * ** * * * *** * * * ** * * * *** &n[i]);
** * ***** * * * ** *** = 0; j<9; j++)
{
*** ***** * ** ** * * * ** ** * * * * * * = j+1; i < 10; i++)
* **** *** ****** ** * * * **** *** ***** * * * ** ** ** **** > n[i])
** ** * ** * * ** * ** * * * * ***** ** * ** * * *****
* * * ** ** ** * *** *** ** * * ** ****** ** * * * * ** * * ** ** * * * * * * **** = n[j];
** *** * ***** * **** *** * * *** * * * ****** * * * * * * *** ** *** ** ** * ******* * * ** * = n[i];
* * * * ** * * * *** * ** * ** * * * * * * ** ** * ** * ** *** **** * ** ** * * * = t;
**** ** * * ** * ** **** * * * * *** * * * * ** ***** * ** ** **
**** * * * * * ***
* * ** **** * ***** * = 0; i < 10; i++)
* ** * **** * * ** * * * *** ***** **** * ** ", n[i]);
**** ** ** * ** *** *** * 0;
}
answered
Oct 19, 2016
by
410211222
(
-186
points)
ask related question
comment
Please
log in
or
register
to add a comment.
0
like
0
dislike
Hidden content!
#include <stdio.h>
#include <stdlib.h>
int main()
{
** *** ** * * * * *** i, j, num[10], tmp;
* **** ** * *** * (i = 0; i < 10; i++)
** * * *** **** * ** *** * * ** * * * ** * ** &num[i]);
* ** * * ** ***** * (j = 0; j < 9; j++)
** * * ** * ** * * ** **** * * ** ** * * ** (i = j + 1; i < 10; i++)
* *** ******** * ** *** ** * ** * * ** ** ** ** (num[j] > num[i])
** * * ****** **** ****** ** ****** **** * ** ***** ****
* * **** ** ** * ** * *** ** * * ***** * * ** ** * ****** * ** * ** * *** ** *** *** = num[j];
* * * * * ** * ********** * **** ** * ** ** ** * *** ** ** * *** * * *** ** ** = num[i];
* * * * ** ** **** *** * * * ***** ** ** ***** * * * *** ** **** ** * ** * ** * * * * * * ** * ** * = tmp;
* **** * *** ** ** ** * * *** *** * ** ** *** ** * *** ** *
*** ** * *** ** * * (i = 0; i < 10; i++)
** ******** ** * * * * * ** ***** * **** ** *** * * * *** * * num[i]);
* * * * ** ** ** *** ** 0;
}
answered
Oct 19, 2016
by
quarter
(
-116
points)
ask related question
comment
Please
log in
or
register
to add a comment.
0
like
0
dislike
Hidden content!
#include<stdio.h>
* ** **** ****
int main()
{
*** * * **** **** ***** * i, j, num[10], tmp;
* ** * ** (i = 0;i < 10; i++)
* **** **** * * * * ******* * ****** * *** ***** ** ** * ** ** *
* * * * ** * * ** ** * (j = 0;j < 9; j++)
* ** *** ** *** * * * **** *** (i = j+1;i < 10 ;i++)
* ******* ** ** * * * *** * ** * **** * * * (num[j] > num[i])
** * ** ** * * ********** ***** * ***** * * ******* ** *
**** ** * * ** * * *** * * * ** ** * ** * * * * * * * *** = num[j];
*** * * * ***** **** **** * **** *** * ** * * *** * * = num[i];
* * ** * * * * * **** * ***** ** *** ** ** ** ** * ** = tmp;
**** *** * * * * ** ** * * ****** ** ***** * * *
* * * * *** * (i = 0;i < 10 ;i++)
*** * ** *** ** **** * ** ** *** *** *** ** **** * ** ** ***** * * ** num[i]);
** ** * ** ** * * * 0;
}
answered
Oct 19, 2016
by
Queenie0915
(
-124
points)
ask related question
comment
Please
log in
or
register
to add a comment.
0
like
0
dislike
Hidden content!
* ** * ** **** * *
** * * * ***
int main()
{
int * * * *
** * *** * ** ***
* ** * * ** *** * * * ** *
* ** * ** *
*** * *
if * * ******
* * * **** *
**** *** ***
* ** **
}
* **** * *** **
** *** * ",num[i]);
return 0;
}
answered
Oct 19, 2016
by
rickyliu
(
-50
points)
ask related question
comment
Please
log in
or
register
to add a comment.
0
like
0
dislike
Hidden content!
#include<stdio.h>
** *** * * *
int main()
{
* * ***** ** * * * i, j, num[10], tmp;
* * ** * ** * * ** (i = 0;i < 10; i++)
*** ***** ******* * ** * ** * * ** * * * ** * ** **
******** *** * * * * (j = 0;j < 9; j++)
**** **** * * * ** * * * ** ***** ** ** ** (i = j+1;i < 10 ;i++)
* **** * * ** * * * *** ** ******** ** *** ** (num[j] < num[i])
* ***** ** ** * * * * * * * ** *
* ** * * * ** * * ********* ** * * * * * * * *** *** * ** * * *** * = num[j];
* *** ** *** * * ** *** * *** ** *** * * * *** = num[i];
* ** **** * ** ** *** * ** *** * * ** ** * * *** ** ******* = tmp;
* * ** **** ** * *** ** * ** **** ** * * *** *
*** * ********* * **** ** **** (i = 0;i < 10 ;i++)
** **** *** * ***** *** *** ** **** **** * * **** ** * * ********* ** num[i]);
* ** * *** * *** * *** * * 0;
}
answered
Oct 19, 2016
by
Queenie0915
(
-124
points)
ask related question
comment
Please
log in
or
register
to add a comment.
Page:
« prev
1
...
3
4
5
6
7
next »
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English
中文
Tiếng Việt
IP:172.69.17.204
©2016-2025
Related questions
0
like
0
dislike
76
answers
AC 20161019 作業 2
[Exercise]
Coding (C)
-
asked
Oct 19, 2016
in
作業
by
Shun-Po
(
18k
points)
ID: 14120 -
Available when:
Unlimited
-
Due to:
Unlimited
|
5.8k
views
1
like
0
dislike
129
answers
AC 20161019 作業 1
[Exercise]
Coding (C)
-
asked
Oct 19, 2016
in
作業
by
Shun-Po
(
18k
points)
ID: 14119 -
Available when:
Unlimited
-
Due to:
Unlimited
|
8.7k
views
0
like
0
dislike
65
answers
AC 20161019 做業 3
[Exercise]
Coding (C)
-
asked
Oct 19, 2016
in
作業
by
Shun-Po
(
18k
points)
ID: 14272 -
Available when:
Unlimited
-
Due to:
Unlimited
|
5.1k
views
0
like
0
dislike
64
answers
AC 20161013 作業 4
[Exercise]
Coding (C)
-
asked
Oct 13, 2016
in
作業
by
Shun-Po
(
18k
points)
ID: 13763 -
Available when:
Unlimited
-
Due to:
Unlimited
|
4.5k
views
1
like
0
dislike
48
answers
AC 20161102 作業2
[Exercise]
Essay (Open question)
-
asked
Nov 2, 2016
in
作業
by
Shun-Po
(
18k
points)
ID: 16865 -
Available when:
Unlimited
-
Due to:
Unlimited
|
4.3k
views
12,783
questions
183,442
answers
172,219
comments
4,824
users