Hanoi递归算法

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

运行结果：