HDU 1019 Least Common multiple-number theory (least common multiple)

Test instructions: least common multiple of n number

Analysis: Using method: LCM (A,b,c) =LCM (A,LCM (b,c)). Note that the first addition to the multiplier prevents integer overflow (tips)

Code:

#include <iostream>using namespace Std;int t,n,a;int gcd (int a,int b) {return b==0?a:gcd (b,a%b);} int main () {cin>>t;while (t--) {cin>>n;cin>>a;int tmp=a;for (int i=1;i<n;i++) {cin>>a;tmp= TMP/GCD (Tmp,a) *a;} Cout<<tmp<<endl;}}

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

HDU 1019 Least Common multiple-number theory (least common multiple)