Submission #145858

#TimeUsernameProblemLanguageResultExecution timeMemory
145858ps_penguin짝수 정렬 (tutorial3)C++14
0 / 100
2 ms380 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...