Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 51165 Accepted Submission(s): 21198
Problem Description
求n个数的最小公倍数。
Input
输入包含多个测试实例，每个测试实例的开始是一个正整数n，然后是n个正整数。
Output
为每组测试数据输出它们的最小公倍数，每个测试实例的输出占一行。你可以假设最后的输出是一个32位的整数。
Sample Input
2 4 6 3 2 5 7
Sample Output
12 70
#include<iostream>#include<stdio.h>using namespace std;int main(){long n;long lcm(long x,long y);long gcd(long x,long y);while(cin>>n){long a[n];for(int i=0 ;i<n ;i++){cin>>a[i];}long temp = lcm(a[0],a[1]);for(int i=2;i<n;i++){temp = lcm(temp,a[i]);}printf("%ld\n",temp);}return 0;}long gcd(long x,long y){if(x>y){long temp = x;x = y;y = temp;}if(y%x==0){return x;}else{return gcd(y%x,x);} }int lcm(long x,long y){long ans = x/gcd(x,y)*y;return ans;}