hdu1019 Least Common Multiple

Least Common Multiple

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

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

23 5 7 156 4 10296 936 1287 792 1

 

Sample Output

10510296

 

//============================================================================// Name        : Math_hdu1019.cpp// Author      : vit// Version     :// Copyright   : Your copyright notice// Description : Hello World in C++, Ansi-style//============================================================================#include <iostream>#include <stdio.h>using namespace std;long long i, j, ii, jj,t, sum, cu, ne;//开始交的时候忘记了大数问题了void cal(){if(cu > ne)swap(cu, ne);if(cu % ne == 0)return;sum = cu * ne;while(cu % ne != 0){cu = cu % ne;if(cu < ne)swap(cu, ne);}cu = sum / ne;}int main() {cin >> t;while(t--){cin >> ii;cin >> cu;for(i = 0; i < ii - 1; i++){cin >> ne;cal();}cout << cu << endl;}return 0;}