# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
668 |
2013-03-01T02:23:38 Z |
jyuno426 |
짝수 정렬 (tutorial3) |
C++ |
|
0 ms |
916 KB |
#include <algorithm>
#include "grader.h"
void sort_even(int N, int *A) {
int m = 0, i;
for(i = 0; i < N; i++)
{
if(A[i] % 2 == 0)
A[m++] = A[i];
}
std::sort(A,A+m);
for(i = 0; i < m; i++) 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 |