# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
14500 |
2015-05-18T10:23:32 Z |
ggoh |
짝수 정렬 (tutorial3) |
C++ |
|
0 ms |
1088 KB |
#include"grader.h"
#include<cstdio>
#include<algorithm>
void sort_even(int N,int *A)
{
int B[100]={},t=0,i;
for(i=0;i<N;i++)
{
if(A[i]%2==0)
{
B[t++]=A[i];
}
std::sort(B,B+t);
for(i=0;i<t;i++)Report(B[i]);
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
0 ms |
1088 KB |
gettid (syscall #186) was called by the program (disallowed syscall) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
0 ms |
1088 KB |
gettid (syscall #186) was called by the program (disallowed syscall) |
2 |
Halted |
0 ms |
0 KB |
- |