首先是两个数的,我们用辗转相除法来做
int gcd(int x, int y){
return y == 0 ? x : gcd(y, x%y);
}
int lcm(int x, int y){
return x*y/gcd(x, y);
}
多个数的话连续算就好了
//a[] 数组存放数,总共有n个数
int ngcd = gcd(a[1], a[2]);
for(int i = 3; i <= n; i++){
ngcd = gcd(t, a[i]);
}
int nlcm = lcm(a[1], a[2]);
for(int i = 3; i <= n; i++){
nlcm = lcm(nlcm, a[i]);
}
233