1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52
|
#include<stdio.h>
int recurse(int x,int y)
{
int a=0,b=0;
if(x==y)
{
return x;
}
else
{
if(x>y)
{
return recurse(x,y+1)+recurse(x-1,y);
}
else if(x<y)
{
return x*recurse(x+1,y)-y*recurse(x,y-1);
}
}
}
int main(void)
{
int n;
int i,j;
printf("Entrez n : ");
scanf("%d",&n);
i=0;
j=0;
printf("\n");
goto _boucle1;
_boucle1:
if(i>n) goto fin;
if(j!=n){j=0;goto _boucle2;}
_boucle2:
if(j>n) {i=i+1; goto _boucle1;}
printf("fonction(%d,%d)=%d\n",i,j,recurse(i,j));
j=j+1;
goto _boucle2;
fin:
return 0;
} |
Partager