1.用递归方法求n!。
#include<stdio.h>
int main()
{
int fac(int n);
int n, y;
printf("input an integer numbers:");
scanf_s("%d", &n);
y = fac(n);
printf("%d!=%d\n", n, y);
return 0;
}
int fac(int n)
{
int f;
if (n < 0)
printf("n<0,data error!");
else if (n == 0 || n == 1)
f = 1;
else
f = fac(n - 1)*n;
return(f);
}
运行结果:
2.hanoi塔问题,输出移动盘子的步骤
#include<stdio.h>
int main()
{
void hanoi(int n, char one, char two, char three);
int m;
printf("input the number of diskes:");
scanf_