Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #include<math.h>
- const int MAX = 100;
- const int MAX2 = 200;
- void SapXep(int a[], int n){
- int i,j;
- for(i = 0; i<n; ++i){
- for(j = i + 1; j < n; j++){
- if(a[i]>a[j]){
- int tmp = a[i];
- a[i] = a[j];
- a[j] = tmp;
- }
- }
- }
- }
- int main(){
- int n,i,j=0,k=0;
- scanf("%d", &n);
- int a[MAX];
- int chan[MAX];
- int le[MAX];
- for (i = 0; i < n; i++){
- scanf("%d", &a[i]);
- }
- for (i = 0; i < n ; i++){
- if(a[i]%2==0){
- int m = a[i];
- chan[j] = m;
- j++;
- }
- if(a[i]%2==1){
- int n = a[i];
- le[k] = n;
- k++;
- }
- }
- SapXep(chan,j);
- SapXep(le, k);
- int ketqua[MAX2];
- for(i = 0; i<j; i++){
- int o = chan[i];
- ketqua[i] = o;
- }
- int m = 0;
- for(i = j; i <j+k; i++){
- int p = le[m];
- ketqua[i] = p;
- m++;
- }
- for(i = 0; i < j+k; i++){
- printf("%d", ketqua[i]);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement