汉诺塔A->B
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;
void hanoi(int n,char A,char B,char C)
{
if(n==1)cout<<n<<" "<<A<<" "<<B<<endl;
else
{
hanoi(n-1,A,C,B);
cout<<n<<" "<<A<<" "<<B<<endl;
hanoi(n-1,C,B,A);
}
}
int main()
{
int n;
cin>>n;char a='A',b='B',c='C';
hanoi(n,a,b,c);
}