# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1612 |
2013-07-10T13:18:18 Z |
ho94949 |
짝수 정렬 (tutorial3) |
C++ |
|
0 ms |
940 KB |
#include"grader.h"
#include<algorithm>
#include<vector>
using namespace std;
void sort_even(int N, int* A){
vector<int> evens;
for(int i=0;i<N;i++){
if(A[i]%2==0) evens.push_back(A[i]);
}
sort(evens.begin(),evens.end());
for(int i=0;i<evens.size();i++){
Report(evens[i]);
}
return;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
940 KB |
Output is correct |
2 |
Correct |
0 ms |
940 KB |
Output is correct |
3 |
Correct |
0 ms |
940 KB |
Output is correct |
4 |
Correct |
0 ms |
940 KB |
Output is correct |
5 |
Correct |
0 ms |
940 KB |
Output is correct |
6 |
Correct |
0 ms |
940 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
940 KB |
Output is correct |
2 |
Correct |
0 ms |
940 KB |
Output is correct |
3 |
Correct |
0 ms |
940 KB |
Output is correct |
4 |
Correct |
0 ms |
940 KB |
Output is correct |
5 |
Correct |
0 ms |
940 KB |
Output is correct |
6 |
Correct |
0 ms |
940 KB |
Output is correct |
7 |
Correct |
0 ms |
940 KB |
Output is correct |
8 |
Correct |
0 ms |
940 KB |
Output is correct |