HDU1019 Least Common Multiple 解题报告
来源:互联网 发布:查经济数据的网站 编辑:程序博客网 时间:2024/06/11 01:08
Least Common Multiple
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23605 Accepted Submission(s): 8824
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
Source
East Central North America 2003, Practice
Recommend
JGShining
#include<iostream>using namespace std;__int64 cmp(__int64 a,__int64 b){__int64 t;if(a>b) {t=a;a=b;b=t;}__int64 i;for(i=a;i>=1;i--){ if(a%i==0&&b%i==0) break;}return a*b/i;//两数相乘除以最大公约数位最小公倍数}int main(){__int64 r;//这题全部是64位scanf("%I64d",&r);while(r--){__int64 n;__int64 i;__int64 a[1001];scanf("%I64d",&n);for(i=0;i<n;i++){scanf ("%I64d",&a[i]);}for(i=0;i<n-1;i++){a[i+1]=cmp(a[i],a[i+1]);//很多数的最小公倍数求法}printf("%I64d\n",a[n-1]);}return 0;}
- HDU1019 Least Common Multiple 解题报告
- HDU1019 Least Common Multiple
- HDU1019 ( Least Common Multiple )
- hdu1019 Least Common Multiple
- HDU1019 Least Common Multiple
- hdu1019 Least Common Multiple
- HDU1019:Least Common Multiple
- HDU1019 Least Common Multiple
- HDU1019 Least Common Multiple
- hdu1019 Least Common Multiple
- HDU1019 The Least Common Multiple
- HDU1019 Least Common Multiple 就是求最小公倍数
- hdu1019——Least Common Multiple
- HDU 4913 Least common multiple 解题报告(线段树)
- 【九度OJ】题目1439:Least Common Multiple 解题报告
- ACM-简单题之Least Common Multiple——hdu1019
- HDU1019 Least Common Multiple(求多个数的最小公倍数)
- HDU1019 - Least Common Multiple (LCM的简单应用)
- Some hyperlinks
- C#的配置文件App.config使用总结
- 快速幂或者矩阵快速幂
- IO调度器原理介绍
- 泛型编程,让hibernate用起来开发效率更高
- HDU1019 Least Common Multiple 解题报告
- 存储容量和IOPS的关系
- XE4控件开发源码 最简单的例子
- Android 对话框(Dialog)大全 建立你自己的对话框
- NEFU704(AC自动机+状态压缩)
- 使用tftp下载程序到arm开发板时需要进行的设置
- 即使自动更新比定时脚本更好的方法
- ThinkPHP 中M方法和D方法的具体区别
- 黑马程序员-IO流(File类、Properties 类)