标签:des style blog http color java os io
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 30285 Accepted Submission(s): 11455
求所给的数字的最小公倍数
1 #include<cstdio> 2 #include<cstring> 3 #include<stdlib.h> 4 #include<algorithm> 5 using namespace std; 6 int gcd(int a,int b) 7 { 8 return b?gcd(b,a%b):a; 9 } 10 int lcm(int a,int b) 11 { 12 return a/gcd(a,b)*b; 13 } 14 int main() 15 { 16 //freopen("in.txt","r",stdin); 17 int kase,m; 18 scanf("%d",&kase); 19 while(kase--) 20 { 21 int ans,num; 22 scanf("%d",&m); 23 for(int i=0;i<m;i++) 24 { 25 int A; 26 scanf("%d",&A); 27 if(i==0){ans=A;continue;} 28 num=A; 29 ans=lcm(ans,num); 30 } 31 printf("%d\n",ans); 32 } 33 return 0; 34 }
HDU 1019 Least Common Multiple (最小公倍数),布布扣,bubuko.com
HDU 1019 Least Common Multiple (最小公倍数)
标签:des style blog http color java os io
原文地址:http://www.cnblogs.com/clliff/p/3923065.html