汉罗塔问题递归实现

代码如下：

#include<stdio.h>long k=0;void move(char x,char y);void hn(int n,char a,char b,char c);int main(){int n;printf("请输入多少个盘子：");scanf("%d",&n);hn(n,'A','B','C');}void move(char x,char y){printf("%c--------->%c",x,y);k++;if(k%5==0){printf("\n");}}void hn(int n,char a,char b,char c){if(n==1){move(a,c);}else{hn(n-1,a,c,b);//把A上的n-1个盘子放到C上通过B move(a,c);//把第n个盘子放到从A放到C上 hn(n-1,b,a,c);//把B上的n-1个盘子借助A放到C }}