辗转相除法....
unsigned zzxc( unsigned m,unsigned n )
{
unsigned temp;
if (m < n)
{
temp = m;
m = n;
n = temp;
}
if ( m % n == 0)
{
return n;
}
else
{
return zzxc( n,m % n) ;
}
}
//最简单的办法..
int zzxc(int x,int y){
if(x>y){
int temp = x;
x =y;
y = temp;
}
}
int main(int argc, const char * argv[]) {
unsigned m, n;
printf("请输入两个正整数:");
scanf("%u%u", &m, &n);
printf("%u与%u的最大公约数为:%u\n", m, n,zzxc (m, n));
printf("%u与%u的最小公倍数公约数为:%u\n", m, n,m*n/zzxc (m, n));
return 0;
}
加油...在成功时的坚持不懈,要比失败中的顽强不屈更重要,何况自己好没有成功...坚持,勤奋