結果

問題 No.2896 Monotonic Prime Factors
ユーザー shinchanshinchan
提出日時 2024-09-20 22:03:49
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 333 ms / 2,000 ms
コード長 4,179 bytes
コンパイル時間 1,981 ms
コンパイル使用メモリ 206,796 KB
実行使用メモリ 90,880 KB
最終ジャッジ日時 2024-09-20 22:03:59
合計ジャッジ時間 8,037 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 128 ms
90,644 KB
testcase_01 AC 129 ms
90,708 KB
testcase_02 AC 122 ms
90,680 KB
testcase_03 AC 123 ms
90,720 KB
testcase_04 AC 269 ms
90,752 KB
testcase_05 AC 329 ms
90,744 KB
testcase_06 AC 288 ms
90,792 KB
testcase_07 AC 262 ms
90,664 KB
testcase_08 AC 283 ms
90,732 KB
testcase_09 AC 333 ms
90,608 KB
testcase_10 AC 203 ms
90,712 KB
testcase_11 AC 149 ms
90,696 KB
testcase_12 AC 147 ms
90,704 KB
testcase_13 AC 216 ms
90,700 KB
testcase_14 AC 236 ms
90,640 KB
testcase_15 AC 154 ms
90,880 KB
testcase_16 AC 158 ms
90,692 KB
testcase_17 AC 138 ms
90,748 KB
testcase_18 AC 269 ms
90,676 KB
testcase_19 AC 136 ms
90,728 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(),(v).end()
#define pb(a) push_back(a)
#define rep(i, n) for(int i=0;i<n;i++)
#define foa(e, v) for(auto& e : v)
using ll = long long;
const ll MOD7 = 1000000007, MOD998 = 998244353, INF = (1LL << 60);
#define dout(a) cout<<fixed<<setprecision(10)<<a<<endl;

template<int MOD> struct Modint {
    long long val;
    constexpr Modint(long long v = 0) noexcept : val(v % MOD) { if (val < 0) val += MOD; }
    constexpr int mod() const { return MOD; }
    constexpr long long value() const { return val; }
    constexpr Modint operator - () const noexcept { return val ? MOD - val : 0; }
    constexpr Modint operator + (const Modint& r) const noexcept { return Modint(*this) += r; }
    constexpr Modint operator - (const Modint& r) const noexcept { return Modint(*this) -= r; }
    constexpr Modint operator * (const Modint& r) const noexcept { return Modint(*this) *= r; }
    constexpr Modint operator / (const Modint& r) const noexcept { return Modint(*this) /= r; }
    constexpr Modint& operator += (const Modint& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Modint& operator -= (const Modint& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Modint& operator *= (const Modint& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Modint& operator /= (const Modint& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b, swap(a, b);
            u -= t * v, swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr bool operator == (const Modint& r) const noexcept { return this->val == r.val; }
    constexpr bool operator != (const Modint& r) const noexcept { return this->val != r.val; }
    friend constexpr istream& operator >> (istream& is, Modint<MOD>& x) noexcept {
        is >> x.val;
        x.val %= MOD;
        if (x.val < 0) x.val += MOD;
        return is;
    }
    friend constexpr ostream& operator << (ostream& os, const Modint<MOD>& x) noexcept {
        return os << x.val;
    }
    constexpr Modint<MOD> pow(long long n) noexcept {
        if (n == 0) return 1;
        if (n < 0) return this->pow(-n).inv();
        Modint<MOD> ret = pow(n >> 1);
        ret *= ret;
        if (n & 1) ret *= *this;
        return ret;
    }
    constexpr Modint<MOD> inv() const noexcept {
        long long a = this->val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b, swap(a, b);
            u -= t * v, swap(u, v);
        }
        return Modint<MOD>(u);
    }
};

const int MOD = MOD998;
using mint = Modint<MOD>;

struct Combination {
    long long C_MOD;
    vector<long long> fac, finv, inv;
    Combination(long long n, long long mod) noexcept : C_MOD(mod) {
        n = max(n, 2LL);
        fac.resize(n, 0);
        finv.resize(n, 0);
        inv.resize(n, 0);
        fac[0] = fac[1] = finv[0] = finv[1] = inv[1] = 1;
        for(int i = 2; i < n; i ++) {
            fac[i] = fac[i - 1] * i % mod;
            inv[i] = mod - inv[mod % i] * (mod / i) % mod;
            finv[i] = finv[i - 1] * inv[i] % mod;
        }
    }
    long long com(long long n, long long k) {
        if(n < k || n < 0 || k < 0) return 0;
        return fac[n] * (finv[k] * finv[n - k] % C_MOD) % C_MOD;
    }
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    Combination comb(3000000, MOD998);
    ll q;
    cin >> q;
    vector<ll> pri(200000, -1);
    for(ll i = 2; i < 200000; i ++) {
        if(pri[i] != -1) continue;
        for(ll j = i; j < 200000; j += i) {
            if(pri[j] == -1) pri[j] = i;
        }
    }
    ll len = 0;
    vector<ll> cnt(2000000, 0LL);
    rep(i, q) {
        ll a, b;
        cin >> a >> b;
        while(a > 1) {
            cnt[pri[a]] ++;
            len ++;
            a /= pri[a];
        }
        cout << comb.com(len - 1, b - 1) << endl;
    }
    return 0;
}
0