# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
18926 |
2016-02-16T12:51:07 Z |
dltldls95 |
짝수 정렬 (tutorial3) |
C++ |
|
0 ms |
1720 KB |
#include <iostream>
#include <vector>
#include <algorithm>
#include "grader.h"
using namespace std;
void sort_even(int n, int* a)
{
sort(a, a+n);
for(int i = 0; i < n; i++)
{
if(a[i] % 2 == 0)
Report(a[i]);
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1720 KB |
Output is correct |
2 |
Correct |
0 ms |
1720 KB |
Output is correct |
3 |
Correct |
0 ms |
1720 KB |
Output is correct |
4 |
Correct |
0 ms |
1720 KB |
Output is correct |
5 |
Correct |
0 ms |
1720 KB |
Output is correct |
6 |
Correct |
0 ms |
1720 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1720 KB |
Output is correct |
2 |
Correct |
0 ms |
1720 KB |
Output is correct |
3 |
Correct |
0 ms |
1720 KB |
Output is correct |
4 |
Correct |
0 ms |
1720 KB |
Output is correct |
5 |
Correct |
0 ms |
1720 KB |
Output is correct |
6 |
Correct |
0 ms |
1720 KB |
Output is correct |
7 |
Correct |
0 ms |
1720 KB |
Output is correct |
8 |
Correct |
0 ms |
1720 KB |
Output is correct |