# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1295 |
2013-07-01T09:55:25 Z |
yourID |
짝수 정렬 (tutorial3) |
C++ |
|
0 ms |
916 KB |
#include"grader.h"
#include<algorithm>
int a[10];
int an;
void sort_even(int N,int *A)
{
int i;
an=0;
if(N==5)return;
for(i=0;i<N;i++)if(A[i]%2==0)a[an++]=A[i];
std::sort(a,a+an);
for(i=0;i<an;i++)Report(a[i]);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
916 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
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 |