Solution d un exercice

#include<stdio.h>
# define max 10
int pile[max];
int static sommet;
char empiler (char n)
{
 
    if (sommet >=max)
    printf("stack overflow");
    else
    sommet = sommet+1;
    pile[sommet]=n;
}
char depiler()
{
     if (sommet <=0)
     printf("stack underflow");
     else
     return pile[sommet];
     sommet = sommet -1;
}
int r;
char c[]={"0123456789ABCDEF"};
void conversion(int n, int b)
{
     int q;
     q=n/b;
     r=n%b;
     if(q!=0)
 
                empiler(c[r]);
                printf("%c",c[r]);    
                fflush(stdin);
     }
 
main()
{
      int n,b;
      printf("donner un nombre decimal:");
      scanf("%d",&n);
      printf("donner la base voulue:");
      scanf("%d",&b);
       for(r=0;r<=sommet;r++)
     {
            conversion(n,b);
            depiler();
      printf("\n");
     }
      getch();
}

#include<stdio.h>
void conversion(int n, int b)
{
     int r;
     char c[]={"0123456789ABCDEF"};
     int q;
     q=n/b;
     r=n%b;
     if(q!=0)
             conversion(q,b);
                printf("%c",c[r]);
}
main()
{
      int n,b;
      printf("donner un nombre decimal:");
      scanf("%d",&n);
      printf("donner la base voulue:");
      scanf("%d",&b);
      conversion(n,b);
      printf("\n");
      getch();
}