# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
568 |
2013-02-28T13:54:27 Z |
gs13068 |
짝수 정렬 (tutorial3) |
C++ |
|
0 ms |
912 KB |
#include"grader.h"
void sort_even(int n,int *a)
{
int i,j,t;
for(i=0;i<n;i++){if(a[i]%2)continue;for(j=i+1;j<n;j++){if(a[j]%2)continue;if(a[i]<a[j]){t=a[i];a[i]=a[j];a[j]=t;}}}
for(i=0;i<n;i++)Report(a[i]);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
912 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
3 |
Halted |
0 ms |
0 KB |
- |
4 |
Halted |
0 ms |
0 KB |
- |
5 |
Halted |
0 ms |
0 KB |
- |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
912 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
3 |
Halted |
0 ms |
0 KB |
- |
4 |
Halted |
0 ms |
0 KB |
- |
5 |
Halted |
0 ms |
0 KB |
- |
6 |
Halted |
0 ms |
0 KB |
- |
7 |
Halted |
0 ms |
0 KB |
- |
8 |
Halted |
0 ms |
0 KB |
- |