# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
2662 | domece | 짝수 정렬 (tutorial3) | C11 | 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.
int c(int*a){return *a-*1[&a];}
void sort_even(int N, int *A){
qsort(A,N,4,c);
for(int i = 0; i < N; i++) {
if(A[i] % 2 == 0) Report(A[i]);
}
}