汉诺塔

#include <iostream> 
using namespace std; 
/*汉诺塔:
把n个盘子从A柱子上移到C柱子上:
把n-1个盘子从A柱子上移到B柱子上
把第n个盘子从A柱子上移到C柱子上
再把n-1个盘子从B柱子移到C柱子上
*/

void move(int n,char a,char b){
    cout<<"move  "<<n<<" from  "<<a<<"to  "<<b<<endl;
}
int hanoi(int n,char a,char b,char c ){
    if(n==1)
        move(1,a,c);
    else {
        hanoi(n-1,a,c,b);
        move(n,a,c);
        hanoi(n-1,b,a,c);
    }
    return 0;
}
int main(){
    int num;
    while(cin>>num){
        hanoi(num,'A','B','C');
    }
    
    return 0;
}
原文地址:https://www.cnblogs.com/wintersong/p/4898683.html