//[2-5] 하노이탑 알고리즘(재귀호출) 2015.5.13 박승빈

[박승빈]

//[2-5] 하노이탑 알고리즘(재귀호출) 2015.5.13 박승빈

#include<cstdio>

int cnt;

void move(int from,int to){

printf ("\nMove from %d to %d",from,to);

cnt++;

}

void hanoi(int n,int from,int by,int to){

if(n==1){move(from,to);}

else{

hanoi(n-1,from,to,by);

move(from,to);

hanoi(n-1,by,from,to);}

}

void main(int){

int pan=0;//지역변수

getchar();

while(1){

cnt=0;

printf ("\n원판수 : ");

scanf ("%d",&pan);

if(pan<=0)break;

hanoi(pan,1,2,3);

printf ("\n%d번\n\n",cnt);

}

}