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

enum    suitType_e
{
    UNKNOW,
    CONSTANT,
    GEOMETRIC,
    ARITHMETIC
};

typedef enum suitType_e suitType_t;

int         get_numbers(char *pStrOperation, int *iTab)
{
    unsigned int    k = 0;
    char            *pch = NULL;

    pch = strtok(pStrOperation, ", -+");

    while(pch != NULL)
    {
        iTab[k++] = atoi(pch);

        pch = strtok(NULL, ", -+");
    }

    return k;
}

suitType_t  get_suit_type(int *iTab, size_t nNumbersInTab)
{
    int err = 0;
    int index;
    int tmp;


    tmp = iTab[0];
    for(index = 1; index < nNumbersInTab && err != 1; ++index) // On va vérifier si les nombres sont "CONSTANT"
    {
        if(tmp != iTab[index])
            err = 1;
    }

    if(!err) return CONSTANT; err = 0;

    tmp = iTab[1] - iTab[0];
    for(index = 2; index < nNumbersInTab && err != 1; ++index) // On va vérifier si les nombres sont "ARITHMETIC"
    {
        if(iTab[index] - iTab[index - 1] != tmp)
            err = 1;
    }

    if(!err) return ARITHMETIC; err = 0;

    tmp = iTab[1] / iTab[0];
    for(index = 2; index < nNumbersInTab && err != 1; ++index) // On va vérifier si les nombres sont "GEOMETRIC"
    {
        if(iTab[index] / iTab[index - 1] != tmp)
            err = 1;
    }

    if(!err) return GEOMETRIC; err = 0;

    return UNKNOW;
}

void    print_suit(int *iTab, size_t sizeTab)
{
    for(size_t i = 0; i < 10; ++i)
        printf("%d|", 10);
}

void        continue_suit(suitType_t suitType, int *iTab, size_t sizeTab)
{
    int factor;
    int index;
    int value;

    switch(suitType)
    {
    case ARITHMETIC:
        factor  = iTab[1] - iTab[0];
        value   = iTab[0];

        for(index = 1; index < sizeTab; ++index)
        {
            value += factor;
            iTab[index] = value;

            printf("%d|", value);
        }

        //print_suit(iTab, sizeTab);

        break;
    case GEOMETRIC:
        factor  = iTab[1] / iTab[0];
        value   = iTab[0];

        for(index = 1; index < sizeTab; ++index)
        {
            value *= factor;
            iTab[index] = value;
        }

        //print_suit(iTab, sizeTab);

        break;

    case UNKNOW:
        printf("Il n'y a aucune suite logique trouvee.\n");
        break;

    case CONSTANT:
        break;

    default:        // Ça ne devrait pas arriver, mais on sait jamais
        break;
    }
}

int main(int argc, char *argv[])
{
    size_t      sizeTab = atoi(argv[1]);
    int         *iTab = malloc(sizeTab * sizeof(*iTab));
    int         nNumbers;
    suitType_t  suitType;

    if(iTab == NULL)
    {
        fprintf(stderr, "Erreur: memoire allouee indisponible");
        return 1;
    }

    nNumbers = get_numbers(argv[2], iTab);

    memset(iTab, iTab[0], sizeTab);

    suitType = get_suit_type(iTab, nNumbers);

    continue_suit(suitType, iTab, sizeTab);

    free(iTab);

    return 0;
}