#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]);
}
# |
결과 |
실행 시간 |
메모리 |
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 |
# |
결과 |
실행 시간 |
메모리 |
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 |