汉诺塔

#include <iostream.h>void hanluota(int n,char A,char B,char C){if (n==1){cout<<"将编号为"<<n<<"直接从"<<A<<"移动到柱子"<<C<<endl;}else{hanluota(n-1,A,C,B);cout<<"将编号为"<<n<<"直接从"<<A<<"移动到柱子"<<C<<endl;hanluota(n-1,B,A,C);}}void main(){char ch1='A';char ch2='B';char ch3='C';int n;                  cout<<"请输入需要移动的个数:";cin>>n;hanluota(n,'A','B','C');}

通过递归的方式来实现