結果

問題 No.2896 Monotonic Prime Factors
ユーザー shkiiii_
提出日時 2024-09-21 01:30:24
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 521 ms / 2,000 ms
コード長 2,684 bytes
コンパイル時間 2,019 ms
コンパイル使用メモリ 196,868 KB
最終ジャッジ日時 2025-02-24 10:52:26
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include<bits/stdc++.h>
// #include<atcoder/all>
// #include<boost/multiprecision/cpp_int.hpp>
using namespace std;
// using namespace atcoder;
// using bint = boost::multiprecision::cpp_int;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<ll,ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using ve = vector<vector<int>>;
using vb = vector<bool>;
using vvb = vector<vb>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define sz(c) ((ll)(c).size())
#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())
#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())
// #define MOD 1000000007
#define MOD 998244353
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.first<<" "<<p.second;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<typename T> inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;}
template<typename T> inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;}
ld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}
int prime_factorize(long long n){
  int res = 0;
  for(long long i = 2;i*i <= n;i++){
    if(n%i)continue;
    while(!(n%i)){
      res++;
      n /= i;
    }
  }
  if(n > 1)res++;
  return res;
}
class Comb{
  public:
  const int n;
  // const int mod = 1000000007;
  const int mod = 998244353;
  vector<long long> fac,refac;
  Comb(int N) : n(N),fac(N+1,1),refac(N+1,1) {
    for(int i = 0;i < n;i++)fac[i+1] = fac[i]*(i+1)%mod;
    refac[n] = modpow(fac[n],mod-2);
    for(int i = n;i > 0;i--)refac[i-1] = refac[i]*i%mod;
  }
  long long comb(long long n,long long r){
    if(n < r)return 0;
    long long res = fac[n]*refac[r]%mod;
    res = res*refac[n-r]%mod;
    return res;
  }
  long long modpow(long long n,long long r){
    long long res = 1;
    while(r){
      if(r & 1)res = res*n%mod;
      n = n*n%mod;
      r >>= 1;
    }
    return res;
  }
};
int main(){
  
  ios_base::sync_with_stdio(0), cin.tie(0);
  int Q;cin >> Q;
  vi a(Q),b(Q);
  rep(i,Q)cin >> a[i] >> b[i];
  Comb cb(5000000);
  ll k = 0;
  rep(i,Q){
    k += prime_factorize(a[i]);
    cout << cb.comb(k-1,b[i]-1) << "\n";
  }
  
  return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0