九度OJ题目1439:Least Common Multiple
来源:互联网 发布:js如何给radio赋值 编辑:程序博客网 时间:2024/06/08 10:07
时间限制:1 秒
内存限制:128 兆
特殊判题:否
- 题目描述:
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.
- 样例输入:
23 5 7 156 4 10296 936 1287 792 1
- 样例输出:
10510296
#include <stdio.h>int gcd(int a,int b){ //求最大公约数 if(b==0) return a; else return gcd(b,a%b);}int main(){ int n,m,a,b; while(scanf("%d",&n)!=EOF){ //输入n,表示案例个数 for(int i=0;i<n;i++){ scanf("%d %d",&m,&a);//输入m表示该案例包含的整数个数,第一个数记为a -- m;//m减1 while(m != 0){ scanf("%d",&b);//输入后面的一个整数记为b a = a/gcd(a,b)*b;//将a变成a,b的最小公倍数 --m;//m减1 } printf("%d\n",a);//输出结果 } } return 0;}/************************************************************** Problem: 1439 User: zpy Language: C++ Result: Accepted Time:0 ms Memory:1020 kb****************************************************************/
- 【九度OJ】题目1439:Least Common Multiple 解题报告
- 九度OJ题目1439:Least Common Multiple
- 题目1439:Least Common Multiple 九度OJ
- 九度题目1439Least Common Multiple
- 【九度】题目1439:Least Common Multiple
- 九度 题目1439:Least Common Multiple
- 九度1439:Least Common Multiple
- 题目1439:Least Common Multiple
- 题目1439:Least Common Multiple
- 题目1439:Least Common Multiple
- 题目1439:Least Common Multiple
- 题目1439:Least Common Multiple
- 九度OJ 1056--最大公约数 1439--Least Common Multiple 【辗转相除法】
- 九度OJ-1439:Least Common Multiple(相关文章尚未添加)
- 49-题目1439:Least Common Multiple
- 题目49:Least Common Multiple
- HDU oj Least Common Multiple 1019
- Hdu oj 1019 Least Common Multiple
- 表单元素 2017-4-6
- OkHttp3
- java 中的集合(十四) TreeMap源码分析
- 聊天室服务器基本代码
- Linux下socket编程,附带tcp例子
- 九度OJ题目1439:Least Common Multiple
- java练习--集合-List书店购物车
- ZOJ3207-80ers' Memory
- 粒子群算法
- spark的数据存储
- 浅谈路径规划算法之SPFA算法
- POJ
- 合并两个排序的链表
- Kaggle 上一个用户分类问题