#include <stdlib.h>
#include <stdio.h>
 
typedef struct Pile{
        int valeur;
        struct pile* precedent;
}Pile;
 
int push (Pile **p, int valeur){
        Pile *element = malloc (sizeof(Pile));
        if (!element) return ;
        element->valeur = valeur;
        element->precedent = (int)p;
        *p = element;
}
 
int pop (Pile **p, int nelems){
        int val;
        Pile *tmp;
        if (!tmp) return -1;
        tmp = (int)(*p)->precedent;
        val = (*p)->valeur;
        free(*p);
        *p = tmp;
        return val;
}
 
int clear (Pile **p){
        Pile *tmp;
        while (*p){
                tmp=(int)(*p)->precedent;
                free(*p);
                *p=tmp;
        }
}
 
int main (int argc, char **argv){
        Pile *ma_pile = NULL;
 
        return 0;
}