# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
18475 |
2016-02-05T13:49:51 Z |
jjhstop |
짝수 정렬 (tutorial3) |
C++ |
|
0 ms |
1084 KB |
#include "grader.h"
void sort_even(int N, int *A) {
int minVal;
for (int i = 0; i < N - 1; i++) {
minVal = i;
for (int j = i + 1; j < N; j++) {
if (A[j] < minVal) minVal = j;
}
if (minVal != i) {
int temp;
temp = A[minVal];
A[minVal] = A[i];
A[i] = temp;
}
}
for (int i = 0; i < N; i++) {
if (A[i] % 2 == 0) Report(A[i]);
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
1084 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
1084 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |