hdu1019(快排&&欧几里得)
来源:互联网 发布:ecshop大京东2.5源码 编辑:程序博客网 时间:2024/05/01 13:57
Least Common Multiple
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 43104 Accepted Submission(s): 16191
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
//hdu1019(快速排序&&欧几里得求N个数的最小公倍数)// 首先,sort排好序,求出a[n-1]和a[n-2]的最小公倍数lcm。然后从i=n-3开始,//依次判断lcm能被a[i]整除,如果可以则跳过判断下一个。否则求出lcm和a[i]的最小公倍数。//依次最后结果就是n个数的最小公倍数。 #include<cstdio>#include<cstring>#include<cstdlib>#include<algorithm>using namespace std; int gcd(int a,int b) //欧几里得算法 {if(b==0) return a;else{gcd(b,a%b);}}__int64 a[100010];int main(){int i,j,k,t,n,lcm;scanf("%d",&t);while(t--){scanf("%d",&n);for(i=0;i<n;i++) scanf("%d",&a[i]); if(n==1) //n==1时情况。 { printf("%d\n",a[0]); continue; }sort(a,a+n);k=gcd(a[n-1],a[n-2]); lcm=(a[n-1]/k)*(a[n-2]/k)*k; //求出a[n-1]和a[n-2]的lcm; for(i=n-3;i>=0;){if(lcm%a[i]==0) //lcm可以整除a[i],则跳过。 {i--;}else{k=gcd(lcm,a[i]);lcm=(lcm/k)*(a[i]/k)*k; //否则,求lcm和a[i]的lcm i--;}}printf("%d\n",lcm);}return 0;}
0 0
- hdu1019(快排&&欧几里得)
- 数论之欧几里得算法hdu1019
- 快排
- 快排
- 快排
- 快排
- 快排
- 快排
- 快排
- 快排
- 快排
- 快排
- 快排
- 快排
- 快排
- 快排
- 快排
- 快排
- 准备1千万个随机数字,保存到文件并顺序读取
- 数组溢出与指针问题
- 从两段代码中理解JavaScript的单线程和异步
- Java中数字格式化问题
- Android Studio 报:AndroidManifest.xml (系统找不到指定的路径。) 错误
- hdu1019(快排&&欧几里得)
- 第30讲-求两个整数的最大公约数(辗转相除法)
- Android学习笔记day10
- uva10714 - Ants
- [BZOJ1060] [ZJOI2007]时态同步
- IOS 图片点击放大不失真
- 2015年终总结
- 九度OJ 1396(DP) 1397(尺取法) 1398(最值) 1399(背包,DP) 1401(未完成)
- Android Studio下ActionBar示例