1243: A003 经典的Hanoi(汉诺塔)问题

#include <iostream>
using namespace std;

void Hanoi(int n,char x,char y,char z)
{
    if(n == 0)return;
    void move(char a,char b);
    Hanoi(n - 1, x, z, y);
    move(x, z);
    Hanoi(n - 1, y, x, z);
}

void move(char x,char y)
{
    printf("%c-->%c\n",x,y);
}

int main()
{
    int n;
    while(cin >> n)
    {
        Hanoi(n,'A','B','C');
        cout << endl;
    }
    return 0;
}