c语言的三个小程序

1.汉诺塔（递归算法）

#include <iostream.h>
void move(char &x,int i,char &y)
{
cout<<"move plate "<<i<<" from "<<x<<" to "<<y<<";"<<endl;
};

void hanoi(int n,char &a,char &b,char &c)
{
if(n==1)
move(a,1,c);
else
{
hanoi(n-1,a,c,b);
move(a,n,c);
hanoi(n-1,b,a,c);
}
};
int main()
{ char A='A',B='B',C='C';

int x;
cout<<"input num:";
cin>>x;


hanoi(x,A,B,C);
return 0;
}

2.求俩数最大公约数

#include <iostream.h>
int divsor(int m,int n)
{int r=m%n;
while(r!=0)
{
m=n;
n=r;
r=m%n;
}
return(n);
};
int main()
{int x,y;
cout<<"input two numeric:";
cin>>x>>y;

cout<<"divsor is :"<<divsor(x,y)<<endl;

return 0;
}

3.求俩数的最小公倍数

#include <iostream.h>
int dimsor(int m,int n)
{int r=m*n;
while(m!=n)
{
if(m>n)
m=m-n;
else
n=n-m;
}

return (r/m);
};
int main()
{int x,y;
cout<<"input two numeric:";
cin>>x>>y;

cout<<"dimsor is :"<<dimsor(x,y)<<endl;

return 0;
}