汉诺塔问题

#include <iostream>
using namespace std;

void Hano(int n, char src, char mid, char aim)//把n个盘子从src通过mid移动到aim中 
{
	if(n==1)
	{
		cout << src << "->" << aim << endl;
		return;
	}
	Hano(n-1,src,aim,mid);
	cout << src << "->" << aim <<endl;
	Hano(n-1,mid,src,aim);
	return; 
}

int main()
{
	int x;
	while(cin >> x)
	{
		Hano(x,'A','B','C');
	}
	return 0;
}