HDU 1019 Least Common Multiple(求最小公倍数)
来源:互联网 发布:360.cn 域名价格 编辑:程序博客网 时间:2024/05/01 05:14
Least Common Multiple
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 44106 Accepted Submission(s): 16553
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
题解:求最小公倍数。。。。
两数的最小公倍数=两数相乘 再除以两数的最大公约数
AC代码:
#include<cstdio>#include<iostream>using namespace std;int gcd(int a,int b){if(!b)return a;return gcd(b,a%b);}int main(){int T,n,b,c;scanf("%d",&T);while(T--){scanf("%d%d",&n,&b);for(int i=1;i<n;i++){scanf("%d",&c);b=b/gcd(b,c)*c; //两数的最小公倍数=两数相乘再除以两数的最大公约数 }printf("%d\n",b);}return 0;}
1 0
- HDU 1019 Least Common Multiple(求最小公倍数)
- hdu 1019Least Common Multiple(最小公倍数)
- Least Common Multiple hdu 1019 求多个数最小公倍数
- hdu 1019 Least Common Multiple(数论:求最小公倍数)
- hdu 1019 Least Common Multiple(最小公倍数)
- HDU 1019 Least Common Multiple 最小公倍数 水题
- hdu 1019 Least Common Multiple 最小公倍数
- HDU 1019 Least Common Multiple-数论(最小公倍数)
- HDU 1019 Least Common Multiple (最小公倍数_水题)
- HDU.1019Least Common Multiple【深搜求最小公倍数】(3.13)
- Least Common Multiple(最小公倍数)
- 最小公倍数(Least Common Multiple)
- Least Common Multiple(最小公倍数)
- HDOJ1019 Least Common Multiple(求多个数的最小公倍数)
- HDU1019 Least Common Multiple 就是求最小公倍数
- hdu 1019 Least Common Multiple(几个数的最小公倍数)
- HDU 1019 Least Common Multiple(最小公倍数&最大公约数熟悉)
- HDU-1019-Least Common Multiple( 最大公约数 && 最小公倍数 && GCD )
- Android HashMap源码详解
- MyBatis学习记录(4):MyBatis配置文件的优化
- 杭电2132
- 数据结构
- ActivePerl从源码安装模块
- HDU 1019 Least Common Multiple(求最小公倍数)
- 巩固C语言(五)----获取CMD输出的字符串 & 字符串的拷贝、查找、长度 & 实例之调戏QQ
- 杭电5660
- codeforces
- Apache 的动态静态编译 &工作模式MPM
- Git命令总结
- 生成器模式
- Spring笔记整理
- 【Leetcode】2.Add Two Numbers 解题