toj 1528 Least Common Multiple

Least Common Multiple
Time Limit: 1.0 Seconds Memory Limit: 65536K
Total Runs: 3659 Accepted Runs: 1542

The least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbers in the set. For example, the LCM of 5, 7 and 15 is 105.

Input

Input will consist of multiple problem instances. The first line of the input will contain a single integer indicating the number of problem instances. Each instance will consist of a single line of the form m n1 n2 n3 … nm where m is the number of integers in the set and n1 … nm are the integers. All integers will be positive and lie within the range of a 32-bit integer.

Output

For each problem instance, output a single line containing the corresponding LCM. All results will lie in the range of a 32-bit integer.

Sample Input
2
3 5 7 15
6 4 10296 936 1287 792 1

Sample Output
105
10296

Source: East Central North America 2003 Practice

求多个数最小公倍数

#include<iostream>using namespace std;int gcd(int x,int y){    int tem;    if(x < y)    {        tem = x;        x = y;        y = tem;    }    while(x % y != 0)    {        tem = x;        x = y;        y = tem % x;    }    return y;}int lcm(int x,int y){    return (x / gcd(x,y)) * y;}int main(){    int n,m,x,y;    cin >> n;    while(n--)    {        cin >> m;        cin >> x;        for(int i = 1; i < m; i++)        {            cin >> y;            x = lcm(x,y);        }        cout << x << endl;    }    return 0;}