Project Euler 005 Smallest multiple

题意：$lcm(1,2,3,...,20)$
分析：依旧考虑两种做法。
1. 直接$lcm(1, lcm(2, lcm(3, ...)))$。
2. 求出每个数的质因数分解，每个质数取个最高次幂即可。

#include <bits/stdc++.h>

#define ll long long

#define pii std::pair<int,int>
#define mp std::make_pair
#define fi first
#define se second

#define SZ(x) (int)(x).size()
#define pb push_back

template<class T>inline void chkmax(T &x, const T &y) {if(x < y) x = y;}
template<class T>inline void chkmin(T &x, const T &y) {if(x > y) x = y;}

template<class T>
inline void read(T &x) {
    char c;int f = 1;x = 0;
    while(((c=getchar()) < '0' || c > '9') && c != '-');
    if(c == '-') f = -1;else x = c-'0';
    while((c=getchar()) >= '0' && c <= '9') x = x*10+c-'0';
    x *= f;
}
static int outn;
static char out[(int)2e7];
template<class T>
inline void write(T x) {
    if(x < 0) out[outn++] = '-', x = -x;
    if(x) {
        static int tmpn;
        static char tmp[20];
        tmpn = 0;
        while(x) tmp[tmpn++] = x%10+'0', x /= 10;
        while(tmpn) out[outn++] = tmp[--tmpn];
    }
    else out[outn++] = '0';
}

const int p[] = {2, 3, 5, 7, 11, 13, 17, 19};

int cnt[8];

int main() {
    for(int i = 2; i <= 20; ++i) {
        int tmp = i;
        for(int j = 0; j < 8; ++j) {
            int cur = 0;
            while(tmp % p[j] == 0) tmp /= p[j], cur++;
            chkmax(cnt[j], cur);
        }
    }
    int ans = 1;
    for(int i = 0; i < 8; ++i)
        while(cnt[i]) ans *= p[i], cnt[i]--;
    printf("%d\n", ans);
    return 0;
}