题解 | 汉诺塔

#include <bits/stdc++.h>
using namespace std;
void tower_hanio(int n,char start,char towards,char transport)
{
    if(n==0)return ;
    tower_hanio(n-1,start,transport,towards);
    printf("%c %c\n",start,towards);
    tower_hanio(n-1,transport,towards,start);
}
int main()
{
    int n;
    cin>>n;
    char a = 'A';
    char b = 'B';
    char c = 'C';
    tower_hanio(n,a,c,b);
    return 0;
}