| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 566 | gs13068 | 짝수 정렬 (tutorial3) | C++98 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
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]);
}