10月8日 c语言 递归法 解hanoi

#include<stdio.h>
int main()
{
void hanoi(int n,char one,char two,char three);
int m ;
printf("please input the numer of diskes:");
scanf("%d",&m);
printf("the step to move %d dicskes:\n",m);
hanoi(m,'A','B','C');
}
 void hanoi(int n,char one,char two,char three)
 {
void move(char x,char y);
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);
  }