# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
145858 |
2019-08-21T07:20:57 Z |
ps_penguin |
짝수 정렬 (tutorial3) |
C++14 |
|
2 ms |
380 KB |
#include "grader.h"
#include <iostream>
using namespace std;
void sort_even(int N, int *A) {
int i;
for(i=0;i<N-1;i++)
{
if(A[i]<A[i+1])
{
int tmp;
tmp=A[i];
A[i]=A[i+1];
A[i+1]=tmp;
}
}
for(i = 0; i < N; i++) {
if(A[i] % 2 == 0) Report(A[i]);
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
380 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |