汉诺塔问题

汉诺塔问题的递归解法：

#include<stdio.h>void hanoi(int n,char a,char b,char c){if(n>=1){hanoi(n-1,a,c,b);printf("%c --> %c /n",a,c);hanoi(n-1,b,a,c);}}int main(void){int m;printf("input the number od diskes /t");scanf("%d",&m);hanoi(m,'A','B','C');return 0｝