小学四年级河内塔问题!!!火急!!!火急!!!火急!!!答:汉诺塔问题的递归实现: #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); } } main() { ...