#include<iostream.h>
void hanoi(int count,int needle1,int needle2,int needle3)
{
if(count>0)
{
hanoi(count-1,needle1,needle2,needle3);
cout<<"move my disk "<<count<<" from "<<needle1<<" to "<<needle3<<endl;
hanoi(count-1,needle2,needle3,needle1);
}
}
main()
{
int c,n1,n2,n3;
cout<<"please enter the countNumber!"<<endl;
cin>>c;
hanoi(c,1,2,3);
}

#include<iostream>
using namespace std;
void move(char getone,char putone)
{
cout<<getone<<"-->"<<putone<<endl;
}
void hanoi(int count,int needle1,int needle2,int needle3)
{ void move(char,char);
if(count==1)move(needle1,needle3);
else
{
hanoi(count-1,needle1,needle3,needle2);
move(needle1,needle3);
hanoi(count-1,needle2,needle1,needle3);
}
}
int main()
{ void hanoi(int,int,int,int);
int m;
cout<<"Enter the numbers of diskes:";
cin>>m;
cout<<"the steps to moving "<<m<<" diskes:"<<endl;
hanoi(m,'A','B','C');
return 0;
}

这可是我刚住的册，第一个回复的帖子哦

[此贴子已经被作者于2007-4-11 18:30:10编辑过]

#include<stdio.h>
void move(int n,char a,char c)
{
static int step=1;
printf("step%2d:Disk %d %c--->%c\n",step,n,a,c);
step++;
}
void Hanoi(int n,char a,char b,char c)
{
if(n>1)
{
Hanoi(n-1,a,c,b);
move(n,a,c);
Hanoi(n-1,b,a,c);
}
else move(n,a,c);
}
viod main()
{
Hanoi(3,'a','b','c');
}
用递归解决的，我没编译，你看看吧．