# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
16418 |
2015-08-23T07:16:19 Z |
baji072 |
짝수 정렬 (tutorial3) |
C++ |
|
0 ms |
1084 KB |
#include "grader.h"
#include<algorithm>
using namespace std;
void sort_even(int N, int *A) {
int i;
int a[12],tail=0;
for(i = 0; i < N; i++) {
if(A[i] % 2 == 0){
a[tail] = A[i];
tail++;
}
}
sort(a,a+tail);
for(i = 0; i < tail; i++){
Report(a[i]);
}
return ;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1084 KB |
Output is correct |
2 |
Correct |
0 ms |
1084 KB |
Output is correct |
3 |
Correct |
0 ms |
1084 KB |
Output is correct |
4 |
Correct |
0 ms |
1084 KB |
Output is correct |
5 |
Correct |
0 ms |
1084 KB |
Output is correct |
6 |
Correct |
0 ms |
1084 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1084 KB |
Output is correct |
2 |
Correct |
0 ms |
1084 KB |
Output is correct |
3 |
Correct |
0 ms |
1084 KB |
Output is correct |
4 |
Correct |
0 ms |
1084 KB |
Output is correct |
5 |
Correct |
0 ms |
1084 KB |
Output is correct |
6 |
Correct |
0 ms |
1084 KB |
Output is correct |
7 |
Correct |
0 ms |
1084 KB |
Output is correct |
8 |
Correct |
0 ms |
1084 KB |
Output is correct |