codevs1459n个数的最小公倍数

自己动手算一下就会发现规律

#include <cstdio>
#include <cstring>
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
int h[233];
int lcm(int a,int b)
{
    int y;
    int x = a;
    int z = b;
    while(a%b != 0)
    {
        y = a%b;
        a = b;
        b = y;
    }
    int aa = x/b;
    int bb = z/b;
    int ans;
    ans = aa*bb*b;
    return ans;
}
int main()
{
    int n;
    scanf("%d",&n);
    for(int i = 1; i <= n; i ++)
    scanf("%d",&h[i]);
    sort(h+n,h+n+1);
    int ans ;
    for(int i = 2; i <= n; i ++)
    {
        ans = lcm(h[i-1],h[i]);
        h[i] = ans;
    }
    printf("%d",ans);
    return 0;
}