汉诺塔

#include<iostream>
#include<stack>
#include<stdlib.h>

using namespace std;
int count = 0;
void move(int n,stack<int>&a,stack<int>&b,stack<int>&c){
    if(n==0){
        return;
    }
    move(n-1,a,c,b);
    c.push(a.top());
    a.pop();
    count++;
    move(n-1,b,a,c);

}

void print_stack(stack<int>a){
  while(!a.empty()){
    cout<<a.top()<<endl;
    a.pop();
  }
}



int main(int argc,char*argv[]){
    int n = 3;
    if(argc>1){
      n = atoi(argv[1]);
    }
    stack<int>a;
    stack<int>b;
    stack<int>c;
    for(int i=n;i>0;i--){
        a.push(i);
    }
    print_stack(a);
    move(n,a,b,c);
    print_stack(c);

    cout<<count<<endl;
}

def move(n,a,b,c):
    if n ==1:
        print(a,'-->' ,c)
    else: 
        move(n-1,a,c,b)
        move(1,a,b,c)
        move(n-1,b,a,c)
move(3,'a','b','c')