Pro.ID21321 TitleLeast Common Multiple Title链接http://10.20.2.8/oj/exercise/problem?problem_id=21321 AC35 Submit84 Ratio41.67% 时间&空间限制描述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 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. 输出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 1Sample Output 105
10296Source 样例输入2
3 5 7 15
6 4 10296 936 1287 792 1样例输出105
10296作者 |
|Archiver|手机版|小黑屋|同和创作矩阵
( 粤ICP备20019636号-1 )
GMT+8, 2025-2-2 23:51 , Processed in 0.029539 second(s), 14 queries .
Powered by Discuz! X3.4 Licensed
© 2001-2017 Comsenz Inc.
