Least Common Multiple

📝 Solutions 🔵 仅限 C++

Problems 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

Sample Input 1

2 2 3 5 3 4 6 12

Sample Output 1

15 12

Submit Code

请先Login后Submit

🤖 AI 解题助手

OpenRouter

就绪

👋 你好！我是 AI 解题助手。
我已阅读了这problems题，可以帮你points析思路、提供Code示例。
🔓 完全Free · 无需消耗 Token