汉诺塔问题

H（1） = 1

H（n） = 2 * H(n - 1) + 1

f = 2^n + 1

代码：

#include<stdio.h>void hanoi(int n,char A,char B,char C){if(n==1){printf("Move disk %d from %c to %c\n",n,A,C);}else{hanoi(n-1,A,C,B);printf("Move disk %d from %c to %c\n",n,A,C);hanoi(n-1,B,A,C);}}int main(){int n;printf("请输入数字n以解决n阶汉诺塔问题：\n");scanf("%d",&n);hanoi(n,'A','B','C');return 0;}