#include <stdio.h>
#include <math.h>
int main()
{
int m, n, greatest_common_divisor = 1, Least_common_multiple = 0;
scanf("%d %d", &n, &m);
for (int i = 1; i <= m && i <= n; i++)
{
if ((m % i == 0) && (n % i == 0))
greatest_common_divisor = i;
}
Least_common_multiple = (m * n) /greatest_common_divisor;
printf("它们的最大公约数为:%d \n 它们的最小公倍数为:%d", greatest_common_divisor, Least_common_multiple);
return 0;
}
最大公约数 最小公倍数
最新推荐文章于 2024-07-10 16:47:58 发布