题目49:Least Common Multiple
2013-03-06 11:29
309 查看
http://ac.jobdu.com/problem.php?cid=1040&pid=48
题目描述:
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.
输出:
For each problem instance, output a single line containing the corresponding LCM. All results will lie in the range of a 32-bit integer.
样例输入:
样例输出:
类似于48,注意越界问题。
题目描述:
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.
输出:
For each problem instance, output a single line containing the corresponding LCM. All results will lie in the range of a 32-bit integer.
样例输入:
2 3 5 7 15 6 4 10296 936 1287 792 1
样例输出:
105 10296
类似于48,注意越界问题。
相关文章推荐
- 49-题目1439:Least Common Multiple
- 题目49:Least Common Multiple
- 九度OJ题目1439:Least Common Multiple
- 题目1439:Least Common Multiple
- 【九度OJ】题目1439:Least Common Multiple 解题报告
- 题目1439:Least Common Multiple(求m个正数的最小公倍数lcm)
- 题目1439:Least Common Multiple
- 题目1439:Least Common Multiple 九度OJ
- 题目1439:Least Common Multiple
- 【九度】题目1439:Least Common Multiple
- 题目1439:Least Common Multiple
- 九度 题目1439:Least Common Multiple
- 题目1439:Least Common Multiple
- ZOJ Problem Set - 1797 Least Common Multiple(最小公倍数)
- Least Common Multiple
- HDOJ——1019:Least Common Multiple(求n个数的最小公倍数)
- 九度1439:Least Common Multiple
- [HDOJ 4913] Least common multiple [动态规划+线段树]
- toj 1528 Least Common Multiple
- HDU 1019 Least Common Multiple