| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 540 | a01077483940 | 짝수 정렬 (tutorial3) | C++98 | 0 ms | 0 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<algorithm>
using namespace std;
void sort_even (int N, int *A)
{
sort (A, A+N);
for (int i=0; i<N; i++)
if (A[i]%2 == 0) Report(A[i]);
}