函式_最小公倍數

int lcm(int a, int b);

int lcm(int a, int b) {
    for (int i = 1; i <= b; i++) {
        for (int j = 1; j <= a; j++) {
            if (a * i == b * j) {
                return a * i;
            }
        }
    }
}

#include <stdio.h>

int main() {
    int m, n;
    scanf("%d %d", &m, &n);
    int result = lcm(m, n);
    printf("%d", result);
    return 0;
}