| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 145858 | ps_penguin | 짝수 정렬 (tutorial3) | C++14 | 2 ms | 380 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 <iostream>
using namespace std;
void sort_even(int N, int *A) {
int i;
for(i=0;i<N-1;i++)
{
if(A[i]<A[i+1])
{
int tmp;
tmp=A[i];
A[i]=A[i+1];
A[i+1]=tmp;
}
}
for(i = 0; i < N; i++) {
if(A[i] % 2 == 0) Report(A[i]);
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
