杭电 acm 1019!WR!Problem DescriptionThe 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.InputInput will consist of
来源：学生作业帮助网 编辑：六六作业网 时间：2024/11/08 19:49:23
杭电 acm 1019!WR!Problem DescriptionThe 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.InputInput will consist of
杭电 acm 1019!WR!
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
void main()
{
\x05long int n,m,i,a[1000],max,s,j,x;
\x05while(scanf("%ld",&n)!=EOF)
\x05{
\x05\x05while(n--)
\x05\x05{
\x05\x05\x05scanf("%ld",&m);
\x05\x05\x05for(i=0;i
杭电 acm 1019!WR!Problem DescriptionThe 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.InputInput will consist of
#include
void main()
{
long int n,m,i,a[1000],max,s,j,x;
while(scanf("%ld",&n)!=EOF)
{
while(n--)
{
scanf("%ld",&m);
for(i=0;i