# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
710 | CodingIsHard | 짝수 정렬 (tutorial3) | C++98 | 0 ms | 916 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "grader.h"
#include <algorithm>
void sort_even(int N, int *A) {
int last = 0;
for(int i = 0;i < N;i++)
if(A[i] & 1 == 0) A[last++] = A[i];
std::sort(A , A + last);
for(int i = 0;i < last;i++)
Report(A[i]);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |