# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
8566 |
2014-09-17T05:31:23 Z |
a555 |
짝수 정렬 (tutorial3) |
C++ |
|
0 ms |
1088 KB |
#include "grader.h"
void sort_even(int N, int *A) {
int i, j, b, a;
for (i = 0; i < N; i++) {
b = 20000;
for (j = i; j < N; j++) {
if (b > A[j]){
b = A[j];
a = j;
}
}
b = A[a];
A[a] = A[i];
A[i] = b;
}
for (i = 0; i < N; i++) {
if (!(A[i] & 1)) Report(A[i]);
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1088 KB |
Output is correct |
2 |
Correct |
0 ms |
1088 KB |
Output is correct |
3 |
Correct |
0 ms |
1088 KB |
Output is correct |
4 |
Correct |
0 ms |
1088 KB |
Output is correct |
5 |
Correct |
0 ms |
1088 KB |
Output is correct |
6 |
Correct |
0 ms |
1088 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1088 KB |
Output is correct |
2 |
Correct |
0 ms |
1088 KB |
Output is correct |
3 |
Correct |
0 ms |
1088 KB |
Output is correct |
4 |
Correct |
0 ms |
1088 KB |
Output is correct |
5 |
Correct |
0 ms |
1088 KB |
Output is correct |
6 |
Correct |
0 ms |
1088 KB |
Output is correct |
7 |
Correct |
0 ms |
1088 KB |
Output is correct |
8 |
Correct |
0 ms |
1088 KB |
Output is correct |