/*fibonacci de 35th de value*/
/* Note:Your choice is C IDE */
#include "stdio.h"
#define a 35
long fibonacci(int n);
main()
{
printf("%d de value is %ld",a,fibonacci(a));
}
long fibonacci(int n)
{ if (n>2)
return fibonacci(n-1)+fibonacci(n-2);
else
return 1;
}
/*用递归求8的阶乘*/
/* Note:Your choice is C IDE */
#include "stdio.h"
long dou(int n);
main()
{
printf("%d de jiecheng is %ld\n",8,dou(8));
}
long dou(int n)
{ long ans;
if(n>1)
ans=n*dou(n-1);
else
ans=1;
return ans;
}