#1194606 (C++23) No.3776 Magic Square of Product

• 問題: No.3776 Magic Square of Product
• ユーザー: ooaiu
• 提出日時: 2026-10-23 21:45:17
• 言語: C++23 (gcc 15.3.0 + boost 1.92.0 + ACL)
• 結果: AC
• 実行時間: 31 ms / 2,500 ms
• コード長: 5,752 bytes
• コンパイル時間: 2,733 ms
• コンパイル使用メモリ: 342,124 KB
• 実行使用メモリ: 9,852 KB
• 最終ジャッジ日時: 2026-10-23 21:45:56
• 合計ジャッジ時間: 5,591 ms
• ジャッジサーバーID （参考情報）: judge1_0 / judge5_0

ファイルパターン	結果
sample	AC * 1
other	AC * 25

ソースコード

#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)...); }
};

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 = ll, class U> vector<T> cumsum(const vector<U>& a) { vector<T> res(a.size() + 1); rep(i, a.size()) res[i + 1] = res[i] + a[i]; return res; }
template <class T> void dedup(vector<T>& a) { sort(all(a)), a.erase(unique(all(a)), a.end()); }
template <class T, class S> bool chmax(T& a, const S& b) { return a < static_cast<T>(b) ? a = static_cast<T>(b), 1 : 0; }
template <class T, class S> bool chmin(T& a, const S& b) { return a > static_cast<T>(b) ? a = static_cast<T>(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_no_el(const Ts&... args) { _print(args...); }
template <typename... Ts> void _out_all(const Ts&... args) { _out_no_el(args...), cout << '\n'; }

}  // namespace cppio

#define IN(...) cppio::_in_all(__VA_ARGS__)
#define OUT(...) cppio::_out_all(__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) { return OUT(b ? "Yes" : "No"), b; }
bool No(bool b = true) { return Yes(!b), b; }
bool YES(bool b = true) { return OUT(b ? "YES" : "NO"), b; }
bool NO(bool b = true) { return YES(!b), b; }

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

struct PrimeSieve {
   private:
    int W;
    vector<int> lpf;

   public:
    PrimeSieve(int W) : W(W), lpf(W + 1) {
        for (int x = 2; x <= W; x++) {
            if (lpf[x] != 0) continue;
            lpf[x] = x;
            if (x > W / x) continue;
            for (int y = x * x; y <= W; y += x) {
                if (lpf[y] == 0) lpf[y] = x;
            }
        }
    }
    size_t size() const { return lpf.size(); }
    vector<pair<int, int>> factor(int x) const {
        assert(1 <= x && x <= W);
        vector<pair<int, int>> res;
        while (x > 1) {
            if (res.empty() || res.back().first != lpf[x]) {
                res.emplace_back(lpf[x], 1);
            } else {
                res.back().second += 1;
            }
            x /= lpf[x];
        }
        return res;
    }
    bool is_prime(int x) const {
        if (x <= 1) return false;
        assert(x <= W);
        return lpf[x] == x;
    }
    static vector<int> prime_table(int W) {
        auto sieve = PrimeSieve(W);
        vector<int> res;
        for (int i = 2; i <= W; i++) {
            if (sieve.is_prime(i)) res.push_back(i);
        }
        return res;
    }
};

#include <atcoder/modint>
using mint = atcoder::modint998244353;
PrimeSieve P(1 << 20);
const int Q[] = {6, 21, 55, 120, 231, 406, 666, 1035, 1540, 2211, 3081, 4186, 5565, 7260, 9316, 11781, 14706, 18145, 22155, 26796};
void run_case() {
    INT(K);
    mint ans = 1;
    for (auto [p, e] : P.factor(K)) {
        ans *= Q[e - 1];
    }
    OUT(ans.val());
}
int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::fixed(std::cout).precision(16);
    int t = 1;
    cin >> t;
    while (t--) run_case();
}