gta5火箭狂雷怎么飞:N阶Hanoi问题求解

晕，我给出了C++的程序。你不会不知道改成C语言吧？

算法描述
PROCEDURE Ahanoi(n,x,y,z)
IF n=1 THEN move(x,1,z)
ELSE
{Ahanoi(n-1,x,z,y)
move(x,n,z)
Ahanoi(n-1,y,x,z)
}
RETURN

程序代码
#include <iostream.h>
void move(char x,char y)
{cout<<x<<"-->"<<y<<"\n";}
void hanoi(int n,char one,char two,char three)
{ if(n==1) move(one,three);else{
hanoi(n-1,one,three,two);
move(one,three);
hanoi(n-1,two,one,three);}
}
main()
{
int m;
cout<<"Input the number of disks:"<<"\n";
cin>>m;
cout<<"The step to move"<<m<<"disks"<<"\n";
hanoi(m,'A','B','C');
return 0;
}

这个用递归做很简单,给你一个我做过的C++的程序
//Hanoi by yzz
#include<iostream.h>

void move(int,int,int,int);

int main()
{
int n,x=1,y=2,z=3;

cout<<"Enter the number of plates: ";
cin>>n;
move(n,x,y,z);

return 0;
}

void move(int n,int x,int y,int z)
{
if (n==1)
cout<<x<<">"<<z<<"\t";
else
{
move(n-1,x,z,y);
cout<<x<<">"<<z<<"\t";
move(n-1,y,x,z);
}
}