#1187518 (C++23) No.3717 GCD LCM GCD

• 問題: No.3717 GCD LCM GCD
• ユーザー: 👑 qand
• 提出日時: 2026-09-18 21:39:36
• 言語: C++23 (gcc 15.3.0 + boost 1.92.0 + ACL)
• 結果: AC
• 実行時間: 229 ms / 2,000 ms
• コード長: 4,222 bytes
• コンパイル時間: 4,317 ms
• コンパイル使用メモリ: 381,276 KB
• 実行使用メモリ: 62,272 KB
• 最終ジャッジ日時: 2026-09-18 21:39:45
• 合計ジャッジ時間: 8,337 ms
• ジャッジサーバーID （参考情報）: judge3_0 / judge1_0

ファイルパターン	結果
sample	AC * 4
other	AC * 8

ソースコード

#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using std::cerr, std::cin, std::cout;
#define vec vector
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using mint = atcoder::modint998244353;
std::istream &operator>>(std::istream &is, mint &a) {
	long long t;
	is >> t;
	a = t;
	return is;
}
std::ostream &operator<<(std::ostream &os, mint a) { return os << a.val(); }
// vec<mint> operator*(const vec<mint> &a, const vec<mint> &b) { return a.empty() || b.empty() ? vec<mint>() : atcoder::convolution(a, b); }
// vec<mint> &operator*=(vec<mint> &a, const vec<mint> &b) { return a = a * b; }
#endif
typedef long double ld;
#if LONG_MAX == 2147483647L
#undef long
#define long long long
#endif
#define uint unsigned int
#define ulong unsigned long
#define overload3(a, b, c, name, ...) name
#define rep3(i, a, b) for (int i = (a); i < (b); i++)
#define rep2(i, n) rep3(i, 0, n)
#define rep1(n) rep2(__i__, n)
#define rep(...) overload3(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)
#define per3(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define per2(i, n) per3(i, 0, n)
#define per1(n) per2(__i__, n)
#define per(...) overload3(__VA_ARGS__, per3, per2, per1)(__VA_ARGS__)
#define all(a) a.begin(), a.end()
#define UNIQUE(a) sort(all(a)), a.erase(unique(all(a)), a.end()), a.shrink_to_fit()
#define sz(a) static_cast<int>(a.size())
#ifndef DEBUG
#define cerr \
	if (false) cerr
// #undef assert
// #define assert(...) void(0)
#undef endl
#define endl '\n'
#endif
ostream &operator<<(ostream &os, __int128_t value) {
	ostream::sentry s(os);
	if (s) {
		__uint128_t tmp = value < 0 ? -value : value;
		char buffer[128];
		char *d = std::end(buffer);
		do {
			--d;
			*d = "0123456789"[tmp % 10];
			tmp /= 10;
		} while (tmp != 0);
		if (value < 0) --d, *d = '-';
		const int len = std::end(buffer) - d;
		if (os.rdbuf()->sputn(d, len) != len) os.setstate(std::ios_base::badbit);
	}
	return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, pair<T, S> a) {
	return os << a.first << ' ' << a.second;
};
template <typename T>
ostream &operator<<(ostream &os, vector<T> a) {
	const int n = a.size();
	rep(i, n) {
		os << a[i];
		if (i + 1 != n) os << " ";
	}
	return os;
}
template <typename T, typename S>
istream &operator>>(istream &is, pair<T, S> &a) {
	return is >> a.first >> a.second;
}
template <typename T, size_t n>
ostream &operator<<(ostream &os, array<T, n> a) {
	rep(i, n) {
		os << a[i];
		if (i + 1 != n) os << " ";
	}
	return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &a) {
	for (T &i : a) is >> i;
	return is;
}
template <typename T, typename S>
bool chmin(T &x, S y) {
	if ((T)y < x) {
		x = (T)y;
		return true;
	}
	return false;
}
template <typename T, typename S>
bool chmax(T &x, S y) {
	if (x < (T)y) {
		x = (T)y;
		return true;
	}
	return false;
}
template <typename T>
void operator++(vector<T> &a) {
	for (T &i : a) ++i;
}
template <typename T>
void operator--(vector<T> &a) {
	for (T &i : a) --i;
}
template <typename T>
void operator++(vector<T> &a, int) {
	for (T &i : a) i++;
}
template <typename T>
void operator--(vector<T> &a, int) {
	for (T &i : a) i--;
}
void init(), solve();
int main() {
	// srand((unsigned)time(NULL));
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cout << fixed << setprecision(20);
	cerr << fixed << setprecision(20);
	init();
	int t = 1;
	// cin >> t;
	while (t--) solve();
}
void init() {}
constexpr int INF = 1e6 + 2022;
void solve() {
	long n, k;
	cin >> n >> k;
	vec<vec<int>> yak(INF);
	vec<bool> is_prime(INF, true);
	rep(i, 2, INF) {
		if (!is_prime[i]) continue;
		for (int j = i; j < INF; j += i) {
			yak[j].push_back(i);
			is_prime[j] = false;
		}
	}
	unordered_map<int, vec<int>> mp;
	rep(i, n) {
		int x;
		cin >> x;
		int now = x;
		for (int p : yak[x]) {
			int cnt = 0;
			while (now % p == 0) {
				now /= p;
				cnt++;
			}
			mp[p].push_back(cnt);
		}
	}
	k--;
	mint ans = 1;
	for (auto &[p, a] : mp) {
		int ok = 21, ng = -1;
		while (ok - ng != 1) {
			const int vs = (ok + ng) / 2;
			long cnt = 0;
			for (int v : a) cnt += v > vs;
			(cnt <= k * (n - cnt + 1) ? ok : ng) = vs;
		}
		ans *= mint(p).pow(ok);
	}
	cout << ans << endl;
}