HDU -1019 Least Common Multiple（LCM）

Least Common Multiple

Time Limit: 2000/1000 MS (Java/Others)	Memory Limit: 65536/32768 K (Java/Others)

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

题意：求n个数的最大公因数

公式：a*b=gcd(a,b)*lcm(a,b)
两个数求lcm，用这个lcm和下一个数求lcm，直到最后

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
typedef long long ll;

int gcd(int a, int b)//最大公约数
{
    return b==0 ? a:gcd(b, a%b);
}

ll s[1000];

int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
	    int n;
	    scanf("%d", &n);
	    for(int i=0; i<n; i++)
            scanf("%d", &s[i]);
        ll a=s[0], b;
        for(int i=1; i<n; i++)
        {
            b=s[i];
            a=a*b/gcd(a,b);
        }
        printf("%lld\n", a);
	}
	return 0;
}