递归汉诺塔

#include <stdio.h>
#include <stdlib.h>
void move(char x, char y)
{
    printf("%c-->%c\n",x,y);
}
void hanoi(int n,char one,char two,char three)
{
    if(n==1)
        move(one, three);
    else
    {
        hanoi(n-1,one,three,two);   //n-1个盘子从one移动到two
        move(one,three);
        hanoi(n-1,two,three,one);   //n-1个盘子从two移动到three
    }

}
int main()
{
    int m;
    printf("请输入盘子的个数：");
    scanf("%d",&m);
    printf("移动%d个盘子的步骤:\n",m);
    hanoi(m,'A','B','C');
    return 0;
}