#include <stdio.h>
int gcd(int m, int n);
int lcm(int m, int n);
void main()
{
int m, n;
printf("最大公约数: %d\n", gcd
(m
, n
)); printf("最小公倍数: %d\n", lcm
(m
, n
)); }
int gcd(int m, int n)
{
int remainder;
while (n != 0)
{
remainder = m % n;
m = n;
n = remainder;
}
return m;
}
int lcm(int m, int n)
{
return m * n / gcd(m, n);
}
I2luY2x1ZGUgPHN0ZGlvLmg+CmludCBnY2QoaW50IG0sIGludCBuKTsKaW50IGxjbShpbnQgbSwgaW50IG4pOwp2b2lkIG1haW4oKSAKewogICAgaW50IG0sIG47CiAgICBwcmludGYoIuivt+i+k+WFpeesrOS4gOS4quato+aVtOaVsCBtOiAiKTsKICAgIHNjYW5mKCIlZCIsICZtKTsKICAgIHByaW50Zigi6K+36L6T5YWl56ys5LqM5Liq5q2j5pW05pWwIG46ICIpOwogICAgc2NhbmYoIiVkIiwgJm4pOwoKICAgIHByaW50Zigi5pyA5aSn5YWs57qm5pWwOiAlZFxuIiwgZ2NkKG0sIG4pKTsKICAgIHByaW50Zigi5pyA5bCP5YWs5YCN5pWwOiAlZFxuIiwgbGNtKG0sIG4pKTsKfQoKaW50IGdjZChpbnQgbSwgaW50IG4pIAp7CiAgICBpbnQgcmVtYWluZGVyOwogICAgd2hpbGUgKG4gIT0gMCkgCiAgICB7CiAgICAgICAgcmVtYWluZGVyID0gbSAlIG47CiAgICAgICAgbSA9IG47CiAgICAgICAgbiA9IHJlbWFpbmRlcjsKICAgIH0KICAgIHJldHVybiBtOwp9CgppbnQgbGNtKGludCBtLCBpbnQgbikgCnsKICAgIHJldHVybiBtICogbiAvIGdjZChtLCBuKTsKfQ==