n阶Hanoi塔问题
int c=0;void move(char x,int n,char z){printf("%d. Move disk %d from %c to %c \n",++c,n,x,z);}void hanoi(int n,char x,char y,char z){if(n==1)move(x,1,z);//将编号1的圆盘从x移到zelse{hanoi(n-1,x,z,y);//将x上编号1--n-1的圆盘移到y,z做辅助move(x,n,z);//将编号为n的圆盘从x移到zhanoi(n-1,y,x,z);//将y上编号为1--n-1的圆盘移到z，x做辅助}}void main(){hanoi(3,'x','y','z');}