LCM

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

---

#include<iostream>
using namespace std;
int gcd(int a,int b) { 
   int temp; 
   if(b>a){ temp=a; a=b; b=temp;    }
   while (b!=0) 
   { 
       temp=a%b; 
       a=b; 
       b=temp; 
    } 
    return(a);
} 
int main(){
    int i,n,m,lcm,a;
    cin>>n;
    while(n--){
        cin>>m;
        cin>>a;
        lcm=a; m--;
        while(m--){
            cin>>a;
            lcm=lcm/gcd(lcm,a)*a;
        }
        cout<<lcm<<endl;
    }
    return 0;
} 

又一次溢出(>_<)
lcm=lcm/gcd(lcm,a)*a; 写成 lcm=lcm*a/gcd(lcm,a);
最小公倍数与最大公约数有关
最小公倍数等于两个数的乘积除最大公约数

---

欧几里德算法

int gcd(int da,int xiao) 
{ int temp; 
   while (xiao!=0) 
   { 
       temp=da%xiao; 
       da=xiao; 
       xiao=temp; 
    } 
    return(da);
}