# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
14599 | DimiHDKunho0415 | 짝수 정렬 (tutorial3) | C++98 | 0 ms | 1084 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>
int S[110];
void sort_even(int N, int *A){
int i, cnt=0;
for(i=0; i<N; i++) if(A[i]%2==0) S[++cnt]=A[i];
std::sort(S+1, S+cnt+1);
for(i=1; i<=cnt; i++) Report(S[i]);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |