思路:
1.从大到小排序
2.前一个数c不断跟本身相加判断能否与后一个数整除 得到num;
3.再用num与后面的数重复步骤二
#include<iostream>
#include<algorithm>
#include<string>
#include<cctype>
using namespace std;
int rule(int a1,int a2)
{
return a1 > a2;
}
int main()
{
int n, i;
int a[100];
while (scanf("%d",&n)!=EOF)
{
for (i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n,rule);
int c,num;
c = num = a[0];
for (i = 1; i < n; i++)
{
while (num%a[i] != 0)
num = num + c;
c = num;
}
cout << num << endl;
}
}