最小公倍数

#include#includeusing namespace std;int lcm(int a, int b){    int t, t1 = a, t2 = b;    while (t2 != 0){        t = t2;        t2 = t1 % t2;        t1 = t;    }    return b / t1 * a;}int main(){    int n;    int a, b, c;    scanf("%d", &n);    while (n--){        scanf("%d", &a);        for (int i = 1; i <= 2; i++){            scanf("%d", &b);            a = lcm(a, b);        }        printf("%d\n", a);    }    return 0;}