汉诺塔

#include <stdio.h>
void hanoi(int n,char one,char two,char three);
void move(char x,char y);
void main()
{ int m;
printf(“Input m:”);
scanf("%d",&m);
printf(“The step to moving %d diskes:\n”,m);
hanoi(m,‘A’,‘B’,‘C’);
}
void hanoi(int n,char one,char two,char three)
{

if(n==1) move(one,three);
else
{
	hanoi(n-1,one,three,two);
	move(one,three);
	hanoi(n-1,two,one,three);
}

}
void move(char x,char y)
{
printf("%c–>%c\n",x,y);
}
/*用递归方式计算汉诺塔 */