Exercices pour débutants en C

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

// declaration de mes fonctions
void affiche (int **tab,int ligne,int colonne);
void fonction (int **tab,int ligne,int colonne);
void concateneTab(int **tabA,int **tabB,int **tabResultat,int ligne,int colonneA,int colonneB);

//corps principal du programme
int main(int argc, char *argv[])
{
   int **tab1 = NULL;
   int **tab2 = NULL;
   int **tab3 = NULL;
   size_t i;

   int L =10;
   int C1 = 5;
   int C2 = 5;

    // allocation dynamique des tableaux
   tab1=malloc(L*sizeof(*tab1));
   tab2=malloc(L*sizeof(*tab2));
   tab3=malloc(L*sizeof(*tab3));
   for (i=0;i<L;i++)
   {
       tab1[i]=malloc(C1 * sizeof (**tab1));
       tab2[i]=malloc(C2 * sizeof (**tab2));
       tab3[i]=malloc((C1+C2) * sizeof (**tab3));
   }

   if ( (tab1 == NULL) || (tab2 == NULL) || (tab3 == NULL) )
   {
       printf("\n Erreur d'allocation de mémoire pour les tableaux \n");
       exit(0);
   }

   // on remplie les tableaux et on les affiche
   fonction(tab1,L,C1);
   affiche(tab1,L,C1);

   fonction(tab2,L,C2);
   affiche(tab2,L,C2);

   // on concatene les deux tableaux et on l'affiche
   concateneTab(tab1,tab2,tab3,L,C1,C2);
   affiche(tab3,L,C1+C2);





   // fin du programme on detruit les donnees en liberant la mémoire
   for (i=0;i<L;i++)
   {
    free(tab1[i]);
    free(tab2[i]);
    free(tab3[i]);
   }
   free(tab1);
   free(tab2);
   free(tab3);



    return 0;
}

// definition de mes fonctions
void affiche (int **tab,int ligne,int colonne)
{
    int i,j;
    for (i=0;i<ligne;i++)
    {
        for (j=0;j<colonne;j++)
        {
            printf("%3d",tab[i][j]);
        }
        printf("\n");
    }
    printf("\n\n");
}


void fonction (int **tab,int ligne,int colonne)
{
    int i,j,compteur;
    compteur = 0;
    for (i=0;i<ligne;i++)
    {
        for (j=0;j<colonne;j++)
        {
            tab[i][j]=compteur;
            compteur ++ ;
        }

    }
}

void concateneTab(int **tabA,int **tabB,int **tabResultat,int ligne,int colonneA,int colonneB)
{
    int i,j;

    for(i=0;i<ligne;i++)
    {
        for(j=0;j<colonneA;j++)
        {
            tabResultat[i][j]=tabA[i][j];
        }

        for(j=0;j<colonneB;j++)
        {
            tabResultat[i][j+colonneB]=tabB[i][j];
        }
    }
}

#include <stdio.h>
#include <stdlib.h> /* for atof() - in K&R, math.h is referenced - this is an anachronism */

#define MAXOP 100 /* max size of operand or operator */
#define NUMBER '0' /* signal that a number was found */

int getop(char []);
void push(double);
double pop(void);

/* reverse Polish calculator */

int main(void)
{
  int type;
  double op2;
  char s[MAXOP];

  while((type = getop(s)) != EOF)
  {
    switch(type)
    {
      case NUMBER:
        push(atof(s));
        break;
      case '+':
        push(pop() + pop());
        break;
      case '*':
        push(pop() * pop());
        break;
      case '-':
        op2 = pop();
        push(pop() - op2);
        break;
      case '/':
        op2 = pop();
        if(op2 != 0.0)
          push(pop() / op2);
        else
          printf("error: zero divisor\n");
        break;
      case '\n':
        printf("\t%.8g\n", pop());
        break;
      default:
        printf("error: unknown command %s\n", s);
        break;
    }
  }

  return 0;
}

#define MAXVAL  100 /* maximum depth of val stack */

int sp = 0; /* next free stack position */
double val[MAXVAL]; /* value stack */

/* push: push f onto value stack */
void push(double f)
{
  if(sp < MAXVAL)
    val[sp++] = f;
  else
    printf("error: stack full, can't push %g\n", f);
}

/* pop: pop and return top value from stack */
double pop(void)
{
  if(sp > 0)
    return val[--sp];
  else
  {
    printf("error: stack empty\n");
    return 0.0;
  }
}

#include <ctype.h>

int getch(void);
void ungetch(int);

/* getop: get next operator or numeric operand */
int getop(char s[])
{
  int i, c;

  while((s[0] = c = getch()) == ' ' || c == '\t')
    ;

  s[1] = '\0';
  if(!isdigit(c) && c != '.')
    return c; /* not a number */
  i = 0;
  if(isdigit(c)) /* collect integer part */
    while(isdigit(s[++i] = c = getch()))
      ;
  if(c == '.')
    while(isdigit(s[++i] = c = getch()))
      ;
  s[i] = '\0';
  if(c != EOF)
    ungetch(c);
  return NUMBER;
}

#define BUFSIZE 100

char buf[BUFSIZE]; /* buffer for ungetch */
int bufp = 0; /* next free position in buf */

int getch(void) /* get a (possibly pushed back) character */
{
  return (bufp > 0) ? buf[--bufp] : getchar();
}

void ungetch(int c) /* push character back on input */
{
  if(bufp >= BUFSIZE)
    printf("ungetch: too many characters\n");
  else
    buf[bufp++] = c;
}