# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1675 |
2013-07-12T07:27:28 Z |
gs13105 |
짝수 정렬 (tutorial3) |
C++ |
|
0 ms |
916 KB |
#include "grader.h"
#include <algorithm>
void sort_even(int N,int* A)
{
int i;
std::sort(A,A+N);
for(i=0;i<N;i++)
if(A[i]%2==0)
Report(A[i]);
return;
}
# |
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 |