HDU 1019 least common multiple (least common)

Least common multiple

Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)
Total submission (s): 30285 accepted submission (s): 11455

Problem descriptionthe 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.

 

 

Inputinput will consist of multiple problem instances. the first line of the input will contain in 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.

 

Outputfor each problem instance, output a single line containing the corresponding LCM. All results will lie in the range of a 32-bit integer.

 

Sample input23 5 7 156 4 10296 936 1287 1

 

Sample output10510296

 

Sourceeast central North America 2003, practice

 

Recommendjgshining

Returns the minimum public multiple of the given number.

 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 }

View code