hanoi.cpp

一个关于汉诺仪塔的算法

#include <iostream> 
using namespace std; 
int c=0;
void move(char getone,char putone) 
{ 
	cout<< getone <<"-->"<<putone<<endl; 
	c++;
} 
void hanoi(int n,char one,char two,char three) 
{ 
	
	void move(char getone,char putone); 
	if (n==1) move (one,three); 
	else 
	{ 
		hanoi (n-1,one,three,two); 
		move(one,three);
		hanoi(n-1,two,one,three);
		
	} 
} 

int main() 
{ 
	void hanoi(int n,char one,char two,char three); 
	int m; 
	cout<<"Enter the number of diskes:"; 
	cin>>m; 
	cout<<"the steps to moving "<<m<<" diskes:"<<endl; 
	hanoi(m,'A','B','C');
	cout<<c<<endl;
	return 0;
}