汉诺塔问题（递归）

#include<iostream>
using namespace std;
void move(int n, char a, char b, char c)
{
if (n == 0)
return;
move(n - 1, a, c, b);
cout << a << "-->" << c << endl;
move(n - 1, b, a, c);
}
int main()
{
int n;
char a = 'A', b = 'B', c = 'C';
cin >> n;
move(n, a, b, c);
return 0;
}