#1168979 (C++23) No.368 LCM of K-products

• 問題: No.368 LCM of K-products
• ユーザー: ooaiu
• 提出日時: 2026-06-13 14:24:13
• 言語: C++23 (gcc 15.2.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 96 ms / 2,000 ms
• コード長: 5,157 bytes
• コンパイル時間: 3,577 ms
• コンパイル使用メモリ: 352,328 KB
• 実行使用メモリ: 6,400 KB
• 最終ジャッジ日時: 2026-06-13 14:24:24
• 合計ジャッジ時間: 6,447 ms
• ジャッジサーバーID （参考情報）: judge1_1 / judge3_0

ファイルパターン	結果
other	AC * 35

ソースコード

#include <bits/stdc++.h>
using namespace std;


template <class F> class y_combinator {
    F f;

   public:
    y_combinator(F&& f) : f(std::forward<F>(f)) {}
    template <class... Args> auto operator()(Args&&... args) const { return f(*this, std::forward<Args>(args)...); }
};

constexpr int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};

using ll = long long;
using u32 = unsigned int;
using u64 = unsigned long long;

using vi = vector<int>;
using vl = vector<ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vc<T>>;
template <class T, class U = std::less<T>> using prique = priority_queue<T, vector<T>, U>;

#define overload(a, b, c, d, e, ...) e
#define len(x) (ll)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep1(n) for (ll _ = 0; _ < ll(n); _++)
#define rep2(i, n) for (ll i = 0; i < ll(n); i++)
#define rep3(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define rep4(i, a, b, c) for (ll i = ll(a); i < ll(b); i += ll(c))
#define rep(...) overload(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i, n) for (ll i = ll(n) - 1; i >= 0; i--)

template <class T> void dedup(vector<T>& a) { sort(all(a)), a.erase(unique(all(a)), a.end()); }
template <class T> bool chmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
template <class T> bool chmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }

namespace cppio {

template <typename T> struct is_tuple_like : false_type {};
template <typename... Ts> struct is_tuple_like<tuple<Ts...>> : true_type {};
template <typename T, typename U> struct is_tuple_like<pair<T, U>> : true_type {};

template <typename T, typename = void> struct is_container : false_type {};
template <typename T> struct is_container<T, void_t<decltype(begin(declval<T&>()))>> : bool_constant<!is_same_v<decay_t<T>, string> && !is_same_v<decay_t<T>, char*> && !is_same_v<decay_t<T>, const char*> && !is_array_v<remove_reference_t<T>>> {};

template <typename T> void _in(T& x) {
    if constexpr (is_tuple_like<T>::value) apply([](auto&... elems) { (_in(elems), ...); }, x);
    else if constexpr (is_container<T>::value) {
        for (auto& e : x) _in(e);
    } else cin >> x;
}

template <typename... Ts> void _in_all(Ts&... args) { (_in(args), ...); }

template <typename T> void _out(const T& x) {
    bool first = true;
    if constexpr (is_tuple_like<T>::value) {
        apply([&](const auto&... elems) { ((cout << (first ? "" : " "), _out(elems), first = false), ...); }, x);
    } else if constexpr (is_container<T>::value) {
        for (const auto& e : x) {
            if (!first) cout << ' ';
            _out(e), first = false;
        }
    } else cout << x;
}

template <typename... Ts> void _print(const Ts&... args) {
    bool first = true;
    ((cout << (first ? "" : " "), _out(args), first = false), ...);
}

template <typename... Ts> void _out_all(const Ts&... args) { _print(args...), cout << '\n'; }
template <typename... Ts> void _out_no_el(const Ts&... args) { _print(args...); }

}  // namespace cppio

#define IN(...) cppio::_in_all(__VA_ARGS__)
#define OUT(...) cppio::_out_all(__VA_ARGS__)
#define out(...) cppio::_out_no_el(__VA_ARGS__)

#define INT(...) int __VA_ARGS__; IN(__VA_ARGS__)
#define LL(...)  ll __VA_ARGS__; IN(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; IN(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; IN(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; IN(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); IN(name)
#define VV(type, name, h, w)  vector<vector<type>> name(h, vector<type>(w)); IN(name)
#define RETURN(...) do { __VA_ARGS__; return; } while (0)

bool Yes(bool b = true) { OUT(b ? "Yes" : "No"); return b; }
bool No(bool b = true) { Yes(!b); return b; }
bool YES(bool b = true) { OUT(b ? "YES" : "NO"); return b; }
bool NO(bool b = true) { YES(!b); return b; }

#ifdef ONLINE_JUDGE
#define debug(...) (void(0))
#endif

vector<pair<ll, int>> factor(ll x) {
    assert(x > 0);
    vector<pair<ll, int>> res;
    if (x % 2 == 0) {
        res.push_back({2, 0});
        do {
            res.back().second += 1;
            x /= 2;
        } while (x % 2 == 0);
    }
    for (ll d = 3; d <= x / d; d += 2) {
        if (x % d == 0) {
            res.push_back({d, 0});
            do {
                res.back().second += 1;
                x /= d;
            } while (x % d == 0);
        }
    }
    if (x != 1) res.push_back({x, 1});
    return res;
}

#include <atcoder/modint>
using mint = atcoder::modint1000000007;
void run_case() {
    INT(N, K);
    map<int, vector<int>> P;
    rep(i, N) {
        INT(A);
        for(auto[p,e]:factor(A)) P[p].push_back(e);
    }
    mint ans = 1;
    for(auto[p, vs]: P) {
        sort(rall(vs));
        int t = 0;
        rep(i, min<ll>(len(vs),K)) t += vs[i];
        ans *= mint::raw(p).pow(t);
    }
    OUT(ans.val());
}
int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::fixed(std::cout).precision(16);
    ll t = 1;
    while (t--) run_case();
}