用C语言解决（hanoi）汉诺塔问题——函数的递归调用

#include 
void main()
{
void hanoi(int n,char one,char two,char three);
int n;
printf("请输入需要移动的盘子数：\n");
scanf("%d",&n);
hanoi(n,'A','B','C');
}


void hanoi(int n,char one,char two,char three)
{
void move(char x,char y);
if(n==1)
{
printf("%c-->%c\n",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);
}