# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
5294 |
2014-03-19T06:57:07 Z |
baneling100 |
짝수 정렬 (tutorial3) |
C++ |
|
0 ms |
1088 KB |
#include "grader.h"
#include <algorithm>
using namespace std;
int s[11], top;
void sort_even(int N, int *A)
{
int i;
for(i=0 ; i<N ; i++)
if(A[i]%2==0)
s[++top]=A[i];
sort(s+1,s+top+1);
for(i=1 ; i<=top ; i++)
Report(s[i]);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1088 KB |
Output is correct |
2 |
Correct |
0 ms |
1088 KB |
Output is correct |
3 |
Correct |
0 ms |
1088 KB |
Output is correct |
4 |
Correct |
0 ms |
1088 KB |
Output is correct |
5 |
Correct |
0 ms |
1088 KB |
Output is correct |
6 |
Correct |
0 ms |
1088 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1088 KB |
Output is correct |
2 |
Correct |
0 ms |
1088 KB |
Output is correct |
3 |
Correct |
0 ms |
1088 KB |
Output is correct |
4 |
Correct |
0 ms |
1088 KB |
Output is correct |
5 |
Correct |
0 ms |
1088 KB |
Output is correct |
6 |
Correct |
0 ms |
1088 KB |
Output is correct |
7 |
Correct |
0 ms |
1088 KB |
Output is correct |
8 |
Correct |
0 ms |
1088 KB |
Output is correct |