| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 570 |
2013-02-28T13:56:42 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++)if(a[i]%2==0)Report(a[i]);
}
| # |
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 |
| # |
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 |
