学步园

Least Common Multiple

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12188    Accepted Submission(s): 4467

Problem Description

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

 

Recommend

JGShining

#include <stdio.h>
#include <string.h>

int gcd(int n, int m)
{
    return m ? gcd(m, n % m ) : n;
}

int main( )
{
    int T, i, j, m, n,  N, t;
    
    scanf("%d", &T);
    while (T--) {
        scanf("%d", &N);
        n = m = 1;
        for( i = 0; i < N; i++) {
            scanf("%d", &t);
            m = t / gcd(t, m) * m;
            //printf("**%d %d\n", m, n);
        }
        printf("%d\n",m);
    }
    return 0;
}