递归写的汉诺塔,C预言。
#include<stdio.h>
main()
{
int n;
scanf("%d",&n);
hanoi(n,"A","B","C");
}
hanoi(int n,char a,char b,char c)
{
if(n>0)
{
hanoi(n-1,a,c,b);
printf("move dish %d from pile %d",n,a,b,c);
hanoi(n-1,c,b,a); }
}