# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
14500 | ggoh | 짝수 정렬 (tutorial3) | C++98 | 0 ms | 1088 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<cstdio>
#include<algorithm>
void sort_even(int N,int *A)
{
int B[100]={},t=0,i;
for(i=0;i<N;i++)
{
if(A[i]%2==0)
{
B[t++]=A[i];
}
std::sort(B,B+t);
for(i=0;i<t;i++)Report(B[i]);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |