汉诺塔I

题意：给你3根柱子，a，b，c，起始盘全在柱子a上，求当盘全在c柱子上时，盘移动的状况。（数据结构书上有详细描述）

#include <iostream>using namespace std;void hanoi(int n,char a,char b,char c){if(n>0){hanoi(n-1,a,c,b);printf("move %d from %c to %c\n",n,a,c);hanoi(n-1,b,a,c);}}int main (){int n;while(~scanf("%d",&n)){hanoi(n,'A','B','C');puts("");}return 0;}