chara,charb,charc){if(1==n){printf("第%d次,%c塔--->%c塔 ",++count,a,c);}else{hanoi(n-1,a,c,b);//递归调用,a移到b,c做临时塔printf("第%d次,%c塔--->%c塔 ",++count,a,c);hanoi(n-1,b,a,c);}}intmain(void){inth;printf("输入汉诺塔圆盘的数量: ");scanf("%d...