oj.uz

Submission #19222

# Submission time Handle Problem Language Result Execution time Memory
19222 2016-02-21T11:18:27 Z LK149 짝수 정렬 (tutorial3) C++
100 / 100
 0 ms 1084 KB 
#include "grader.h"
#include <stdlib.h>

int compare(const void* n1, const void* n2){
	int a = *(int*)n1;
	int b = *(int*)n2;
	if (a>b) return 1;
	else if (a<b) return -1;
	else return 0;
}
void sort_even(int N, int *A) {
	int i;
	qsort(A, N, sizeof(int), compare);
	for (i = 0; i < N; i++) {
		if (A[i] % 2 == 0) Report(A[i]);
	}
}

Subtask #1
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1084 KB Output is correct
2 Correct 0 ms 1084 KB Output is correct
3 Correct 0 ms 1084 KB Output is correct
4 Correct 0 ms 1084 KB Output is correct
5 Correct 0 ms 1084 KB Output is correct
6 Correct 0 ms 1084 KB Output is correct

Subtask #2
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1084 KB Output is correct
2 Correct 0 ms 1084 KB Output is correct
3 Correct 0 ms 1084 KB Output is correct
4 Correct 0 ms 1084 KB Output is correct
5 Correct 0 ms 1084 KB Output is correct
6 Correct 0 ms 1084 KB Output is correct
7 Correct 0 ms 1084 KB Output is correct
8 Correct 0 ms 1084 KB Output is correct