# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
511143 |
2022-01-15T08:57:13 Z |
Salama |
짝수 정렬 (tutorial3) |
C++14 |
|
1 ms |
300 KB |
#include <bits/stdc++.h>
#include <grader.h>
using namespace std;
int z[100000];
void sort_even(int x,int *q){ int d=0; for(int o=0;o<x;o++){ if(q[o]%2==0){z[d]=q[o]; d++;}} sort(z,z+d); for(int o=0;o<d;o++)Report (z[o]);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
300 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
300 KB |
Output is correct |
5 |
Correct |
0 ms |
296 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
292 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
7 |
Correct |
0 ms |
204 KB |
Output is correct |
8 |
Correct |
0 ms |
204 KB |
Output is correct |