# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
4600 |
2013-11-10T02:14:57 Z |
Namnamseo |
짝수 정렬 (tutorial3) |
C++ |
|
0 ms |
1200 KB |
#include "grader.h"
#include <algorithm>
void sort_even(int n,int *a){
int sorted[n];
int i,j=0;
for(i=0;i<n;i++)
{
if(!(a[i]%2))
{
sorted[j++]=a[i];
}
}
std::sort(sorted,sorted+j);
for(i=0;i<j;i++)
{
Report(sorted[i]);
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1200 KB |
Output is correct |
2 |
Correct |
0 ms |
1200 KB |
Output is correct |
3 |
Correct |
0 ms |
1200 KB |
Output is correct |
4 |
Correct |
0 ms |
1200 KB |
Output is correct |
5 |
Correct |
0 ms |
1200 KB |
Output is correct |
6 |
Correct |
0 ms |
1200 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1200 KB |
Output is correct |
2 |
Correct |
0 ms |
1200 KB |
Output is correct |
3 |
Correct |
0 ms |
1200 KB |
Output is correct |
4 |
Correct |
0 ms |
1200 KB |
Output is correct |
5 |
Correct |
0 ms |
1200 KB |
Output is correct |
6 |
Correct |
0 ms |
1200 KB |
Output is correct |
7 |
Correct |
0 ms |
1200 KB |
Output is correct |
8 |
Correct |
0 ms |
1200 KB |
Output is correct |