汉诺塔代码.doc

.#include int k=0; void mv(char x,char y) printf(%c-%cn,x,y); if(k%5=0) printf(n); k+; void hn(int n,char A,char B,char C) if(n=1) mv(A,C); else hn(n-1,A,C,B); mv(A,C); hn(n-1,B,A,C); int main() int M; printf(输入汉诺塔上面的圆盘数：); while (scanf(%d,&M)!=EOF) printf(移动的顺序依次为：n); hn(M,A,B,C); printf(%d块圆盘共移动的次数：%dn,M,k);