# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1295 | yourID | 짝수 정렬 (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>
int a[10];
int an;
void sort_even(int N,int *A)
{
int i;
an=0;
if(N==5)return;
for(i=0;i<N;i++)if(A[i]%2==0)a[an++]=A[i];
std::sort(a,a+an);
for(i=0;i<an;i++)Report(a[i]);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |