| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 145835 | wesley2003 | 짝수 정렬 (tutorial3) | C++14 | 3 ms | 376 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 <iostream>
#include <vector>
#include <algorithm>
#include "grader.h"
using namespace std;
void sort_even(int n, int *arr) {
int a[1200],cnt=0;
for (int i = 0; i < n; i++)
if (arr[i] % 2 == 0){
a[cnt]=arr[i];
cnt++;
}
sort(a, a+cnt);
for (int i=0;i<cnt;i++)
Report(a[i]);
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
