Question

输入2个整数,求最大公约数,最小公倍数.用C语言表示.

Answer 1

输入两个正整数m和n,求其最大公约数和最小公倍数.用辗转相除法求最大公约数 算法描述:m对n求余为a,若a不等于0 则 m 0)

{

m_cup = m;

n_cup = n;

res = m_cup % n_cup;

while (res != 0)

{

m_cup = n_cup;

n_cup = res;

res = m_cup % n_cup;

}

printf("Greatest common divisor:%dn",n_cup);

printf("Lease common multiple :%dn",m * n / n_cup);

}

else printf("Error!n");

return 0;

}