oj.uz

Submission #502

# Submission time Handle Problem Language Result Execution time Memory
502 2013-02-28T04:56:01 Z pl0892029 짝수 정렬 (tutorial3) C++
100 / 100
 0 ms 912 KB 
#include <grader.h>

void sort_even(int N,int *A)
{
  int S[100];
  int i,j,n=0;
  for(i=0;i<N;i++) if(A[i]%2==0) S[n++]=A[i];
  for(i=n-1;i>0;i--)
    for(j=0;j<i;j++)
      if(S[j]>S[j+1])
      {
        S[j+1]+=S[j];
        S[j]=S[j+1]-S[j];
        S[j+1]-=S[j];
      }
  for(i=0;i<n;i++) Report(S[i]);
}

Subtask #1
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 912 KB Output is correct
2 Correct 0 ms 912 KB Output is correct
3 Correct 0 ms 912 KB Output is correct
4 Correct 0 ms 912 KB Output is correct
5 Correct 0 ms 912 KB Output is correct
6 Correct 0 ms 912 KB Output is correct

Subtask #2
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 912 KB Output is correct
2 Correct 0 ms 912 KB Output is correct
3 Correct 0 ms 912 KB Output is correct
4 Correct 0 ms 912 KB Output is correct
5 Correct 0 ms 912 KB Output is correct
6 Correct 0 ms 912 KB Output is correct
7 Correct 0 ms 912 KB Output is correct
8 Correct 0 ms 912 KB Output is correct