# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145821 | leewj1025 | 짝수 정렬 (tutorial3) | C++14 | 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 <stdio.h>
#include <assert.h>
#include <malloc.h>
static int N, *A;
void Report (int val){
assert(++result_n <= N);
printf("%d ", val);
}
void sort_even(int N, int *A) {
int i;
for (i = 0; i < N; i++) {
if (A[i] % 2 == 0) Report(A[i]);
}
}
int result_n;
int main(){
int i, tmp;
tmp = scanf("%d", &N);
assert(tmp == 1);
A = (int*) malloc( sizeof(int) * N );
for(i = 0; i < N; i++){
tmp = scanf("%d", &A[i]);
assert(tmp == 1);
}
sort_even(N, A);
return 0;
}