es collar, C (gcc)

es collar

#include <stdio.h>
#include <stdlib.h>

void poblar(int **, int *);
void mostrarVector(int *, int);
void ordenarVector(int *, int);
int esCollar(int *, int, int *);

int main() {
    while(1) {
        int *vector = NULL;
        int tam = 0;
        poblar(&vector, &tam);
        if(!tam) {
            break;
        }
        ordenarVector(vector, tam);
        int *vectorPerlas = (int *) malloc(sizeof(int) * tam);
        if(esCollar(vector, tam, vectorPerlas)) {
            mostrarVector(vectorPerlas, tam);
        } else {
            printf("NO\n");
        }
    }
}

void poblar(int **vector, int *tam) {
    while(1) {
        int num;
        scanf("%i", &num);
        if(!num) {
            break;
        }
        *vector = (int *) realloc(*vector, sizeof(int) * (*tam) + 1);
        (*vector)[*tam] = num;
        (*tam)++;
    }
}

void mostrarVector(int *vector, int largo) {
    int i;
    for(i = 0 ; i < largo ; i++){
        printf("%i ", vector[i]);
    }
    printf("\n");
}

void ordenarVector(int *vector, int tam) {
    int i, j;
    int aux;
    for(i = 0 ; i < tam - 1 ; i++){
        for(j = i+1 ; j < tam ; j++){
            if(vector[i] < vector[j]) {
                aux = vector[i];
                vector[i]=vector[j];
                vector[j]= aux;
            }
        }
    }
}

int esCollar(int *vector, int tam, int *vectorPerlas) {
    if(tam % 2 == 0) {
        return 0;
    }
    int mitad = tam / 2;
    int flag = 1;
    int i, j = 0;
    for(i = 0 ; i <= mitad ; i++) {
        if(flag) {
            vectorPerlas[mitad] = vector[j];
            j++;
            flag = 0;
        } else {
            if(vector[j] != vector[j+1]) {
                return 0;
            }
            vectorPerlas[mitad + i] = vector[j];
            vectorPerlas[mitad - i] = vector[j];
            j += 2;
        }
    }
    return 1;
}


run \| edit \| history \| help	0

λ

                                      .NET NoSQL database for rapid development