# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
946 |
2013-05-31T14:17:54 Z |
testtest |
짝수 정렬 (tutorial3) |
C++ |
|
0 ms |
916 KB |
#include "grader.h"
#include <algorithm>
void sort_even(int N, int *A) {
/*int last = 0;
for(int i = 0;i < N;i++)
if(A[i] & 1 == 0) A[last++] = A[i];*/
std::sort(A , A + N);
for(int i = 0;i < N;i++)
if(A[i] % 2 == 0) Report(A[i]);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
916 KB |
Output is correct |
2 |
Correct |
0 ms |
916 KB |
Output is correct |
3 |
Correct |
0 ms |
916 KB |
Output is correct |
4 |
Correct |
0 ms |
916 KB |
Output is correct |
5 |
Correct |
0 ms |
916 KB |
Output is correct |
6 |
Correct |
0 ms |
916 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
916 KB |
Output is correct |
2 |
Correct |
0 ms |
916 KB |
Output is correct |
3 |
Correct |
0 ms |
916 KB |
Output is correct |
4 |
Correct |
0 ms |
916 KB |
Output is correct |
5 |
Correct |
0 ms |
916 KB |
Output is correct |
6 |
Correct |
0 ms |
916 KB |
Output is correct |
7 |
Correct |
0 ms |
916 KB |
Output is correct |
8 |
Correct |
0 ms |
916 KB |
Output is correct |