汉诺塔问题怎么用递归方式解啊

hanoi(int n, int A, int B, int C)
{
if (n > 0)
{
hanoi(n-1, A, C, B);
printf("move top disk from tower "+A+" to top of tower "+B);
hanoi(n-1, C, B, A);
}
}

完整代码
int main()
{
void hanoi(int n,char one,char two,char three);
int m;
cout<<"输入盘子数:"<<endl;
cin>>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)
{
cout<<x<<"-->"<<y<<endl;
}