結果

問題 No.1529 Constant Lcm
ユーザー satashunsatashun
提出日時 2022-07-04 19:44:09
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 229 ms / 3,000 ms
コード長 7,522 bytes
コンパイル時間 2,349 ms
コンパイル使用メモリ 209,020 KB
実行使用メモリ 88,536 KB
最終ジャッジ日時 2024-12-14 12:02:21
合計ジャッジ時間 9,224 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 204 ms
87,636 KB
testcase_01 AC 210 ms
87,124 KB
testcase_02 AC 210 ms
87,504 KB
testcase_03 AC 208 ms
87,252 KB
testcase_04 AC 207 ms
88,404 KB
testcase_05 AC 210 ms
86,868 KB
testcase_06 AC 208 ms
86,868 KB
testcase_07 AC 209 ms
86,744 KB
testcase_08 AC 205 ms
87,896 KB
testcase_09 AC 204 ms
87,380 KB
testcase_10 AC 219 ms
86,744 KB
testcase_11 AC 210 ms
87,124 KB
testcase_12 AC 203 ms
87,384 KB
testcase_13 AC 218 ms
86,868 KB
testcase_14 AC 213 ms
88,272 KB
testcase_15 AC 212 ms
87,632 KB
testcase_16 AC 213 ms
87,896 KB
testcase_17 AC 212 ms
87,256 KB
testcase_18 AC 201 ms
86,868 KB
testcase_19 AC 213 ms
87,128 KB
testcase_20 AC 223 ms
87,252 KB
testcase_21 AC 224 ms
87,252 KB
testcase_22 AC 221 ms
88,536 KB
testcase_23 AC 228 ms
88,024 KB
testcase_24 AC 229 ms
86,868 KB
testcase_25 AC 229 ms
86,736 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma region satashun
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;

template <class T>
V<T> make_vec(size_t a) {
    return V<T>(a);
}

template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
    return V<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
#define SZ(x) ((int)(x).size())

constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }

template <class T, class U>
void chmin(T& t, const U& u) {
    if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
    if (t < u) t = u;
}

template <class T>
void mkuni(vector<T>& v) {
    sort(ALL(v));
    v.erase(unique(ALL(v)), end(v));
}

template <class T>
vector<int> sort_by(const vector<T>& v, bool increasing = true) {
    vector<int> res(v.size());
    iota(res.begin(), res.end(), 0);

    if (increasing) {
        stable_sort(res.begin(), res.end(),
                    [&](int i, int j) { return v[i] < v[j]; });
    } else {
        stable_sort(res.begin(), res.end(),
                    [&](int i, int j) { return v[i] > v[j]; });
    }
    return res;
}

template <class T, class U>
istream& operator>>(istream& is, pair<T, U>& p) {
    is >> p.first >> p.second;
    return is;
}

template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << "," << p.second << ")";
    return os;
}

template <class T>
istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) {
        is >> x;
    }
    return is;
}

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    rep(i, v.size()) {
        if (i) os << ",";
        os << v[i];
    }
    os << "}";
    return os;
}

#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << H;
    debug_out(T...);
}
#define debug(...) \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

template <class T>
void scan(vector<T>& v, T offset = T(0)) {
    for (auto& x : v) {
        cin >> x;
        x += offset;
    }
}

// suc : 1 = newline, 2 = space
template <class T>
void print(T x, int suc = 1) {
    cout << x;
    if (suc == 1)
        cout << "\n";
    else if (suc == 2)
        cout << " ";
}

template <class T>
void print(const vector<T>& v, int suc = 1) {
    for (int i = 0; i < v.size(); ++i)
        print(v[i], i == int(v.size()) - 1 ? suc : 2);
}

template <class T>
void show(T x) {
    print(x, 1);
}

template <typename Head, typename... Tail>
void show(Head H, Tail... T) {
    print(H, 2);
    show(T...);
}

struct prepare_io {
    prepare_io() {
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(10);
    }
} prep_io;
#pragma endregion satashun

// https://cp-algorithms.com/algebra/prime-sieve-linear.html
// mimic ksun48 implementation

const int X = 1e7;

bitset<X> is_prime;
vector<int> pr;

int mu[X];  // moebius
int pf[X];  // pf[i] := smallest prime p s.t. p | i

void sieve() {
    is_prime.flip();
    is_prime[0] = is_prime[1] = false;
    mu[1] = 1;

    for (int i = 2; i < X; i++) {
        if (is_prime[i]) {
            pr.push_back(i);
            pf[i] = i;
            mu[i] = -1;
        }

        for (int p : pr) {
            if (ll(i) * p >= X) break;
            is_prime[i * p] = false;
            mu[i * p] = -mu[i];
            pf[i * p] = p;
            if (i % p == 0) {
                mu[i * p] = 0;
                break;
            }
        }
    }
}

struct PrimePrepare {
    PrimePrepare() { sieve(); }
} prep_prime;

vector<pii> factorize(int x) {
    vector<pii> vec;
    while (pf[x] > 1) {
        int d = pf[x];
        int c = 0;
        while (x % d == 0) {
            x /= d;
            c++;
        }
        vec.emplace_back(d, c);
    }
    if (x != 1) {
        vec.emplace_back(x, 1);
    }
    return vec;
}

template <unsigned int MOD>
struct ModInt {
    using uint = unsigned int;
    using ull = unsigned long long;
    using M = ModInt;

    uint v;

    ModInt(ll _v = 0) { set_norm(_v % MOD + MOD); }
    M& set_norm(uint _v) {  //[0, MOD * 2)->[0, MOD)
        v = (_v < MOD) ? _v : _v - MOD;
        return *this;
    }

    explicit operator bool() const { return v != 0; }
    explicit operator int() const { return v; }
    M operator+(const M& a) const { return M().set_norm(v + a.v); }
    M operator-(const M& a) const { return M().set_norm(v + MOD - a.v); }
    M operator*(const M& a) const { return M().set_norm(ull(v) * a.v % MOD); }
    M operator/(const M& a) const { return *this * a.inv(); }
    M& operator+=(const M& a) { return *this = *this + a; }
    M& operator-=(const M& a) { return *this = *this - a; }
    M& operator*=(const M& a) { return *this = *this * a; }
    M& operator/=(const M& a) { return *this = *this / a; }
    M operator-() const { return M() - *this; }
    M& operator++(int) { return *this = *this + 1; }
    M& operator--(int) { return *this = *this - 1; }

    M pow(ll n) const {
        if (n < 0) return inv().pow(-n);
        M x = *this, res = 1;
        while (n) {
            if (n & 1) res *= x;
            x *= x;
            n >>= 1;
        }
        return res;
    }

    M inv() const {
        ll a = v, b = MOD, p = 1, q = 0, t;
        while (b != 0) {
            t = a / b;
            swap(a -= t * b, b);
            swap(p -= t * q, q);
        }
        return M(p);
    }

    friend ostream& operator<<(ostream& os, const M& a) { return os << a.v; }
    friend istream& operator>>(istream& in, M& x) {
        ll v_;
        in >> v_;
        x = M(v_);
        return in;
    }

    bool operator<(const M& r) const { return v < r.v; }
    bool operator>(const M& r) const { return v < *this; }
    bool operator<=(const M& r) const { return !(r < *this); }
    bool operator>=(const M& r) const { return !(*this < r); }
    bool operator==(const M& a) const { return v == a.v; }
    bool operator!=(const M& a) const { return v != a.v; }

    static uint get_mod() { return MOD; }
};

// using Mint = ModInt<1000000007>;
using Mint = ModInt<998244353>;

void slv() {
    int N;
    cin >> N;
    Mint ans = 1;
    for (int p : pr) {
        if (p > N) break;
        int x = N;
        {
            ll t = 1;
            while (x % p == 0) {
                x /= p;
                t *= p;
            }
            int b = 0;
            if (x == 1) {
                t /= p;
            }
            t *= t;
            ans *= t;
        }

        if (x != 1 && x % p) {
            while (x) {
                x /= p;
                ans *= p;
            }
            ans /= p;
        }
    }
    show(ans);
}

int main() {
    int cases = 1;
    // cin >> cases;
    rep(i, cases) slv();

    return 0;
}
0