#823176 (C++17) No.2141 Enumeratest

提出ソース

結果

問題	No.2141 Enumeratest
ユーザー	a16784542
提出日時	2022-12-07 19:56:55
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	82 ms / 2,000 ms
コード長	5,971 bytes
コンパイル時間	4,477 ms
コンパイル使用メモリ	262,112 KB
実行使用メモリ	50,440 KB
最終ジャッジ日時	2024-10-14 00:29:31
合計ジャッジ時間	7,803 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	62 ms 50,288 KB
testcase_01	AC	63 ms 50,348 KB
testcase_02	AC	61 ms 50,316 KB
testcase_03	AC	68 ms 50,300 KB
testcase_04	AC	82 ms 50,304 KB
testcase_05	AC	80 ms 50,176 KB
testcase_06	AC	64 ms 50,304 KB
testcase_07	AC	59 ms 50,432 KB
testcase_08	AC	60 ms 50,304 KB
testcase_09	AC	59 ms 50,304 KB
testcase_10	AC	69 ms 50,304 KB
testcase_11	AC	63 ms 50,304 KB
testcase_12	AC	61 ms 50,176 KB
testcase_13	AC	58 ms 50,304 KB
testcase_14	AC	63 ms 50,304 KB
testcase_15	AC	60 ms 50,432 KB
testcase_16	AC	62 ms 50,304 KB
testcase_17	AC	73 ms 50,304 KB
testcase_18	AC	75 ms 50,304 KB
testcase_19	AC	82 ms 50,432 KB
testcase_20	AC	76 ms 50,420 KB
testcase_21	AC	72 ms 50,304 KB
testcase_22	AC	62 ms 50,304 KB
testcase_23	AC	64 ms 50,432 KB
testcase_24	AC	64 ms 50,176 KB
testcase_25	AC	58 ms 50,304 KB
testcase_26	AC	70 ms 50,304 KB
testcase_27	AC	78 ms 50,304 KB
testcase_28	AC	76 ms 50,304 KB
testcase_29	AC	73 ms 50,176 KB
testcase_30	AC	79 ms 50,304 KB
testcase_31	AC	75 ms 50,304 KB
testcase_32	AC	78 ms 50,440 KB
testcase_33	AC	66 ms 50,288 KB
testcase_34	AC	72 ms 50,176 KB
testcase_35	AC	62 ms 50,304 KB
testcase_36	AC	73 ms 50,304 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#if !__INCLUDE_LEVEL__

#include __FILE__


// const int MAX = 1e6+1;
long long fac[MAX], finv[MAX], inv[MAX];

const int MOD = 998244353;
// テーブルを作る前処理
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; 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(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

template<int MOD> struct Fp {
    long long val;
    constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
        if (val < 0) val += MOD;
    }
    constexpr int getmod() { return MOD; }
    constexpr Fp operator - () const noexcept {
        return val ? MOD - val : 0;
    }
    constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
    constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
    constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
    constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
    constexpr Fp& operator += (const Fp& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Fp& operator -= (const Fp& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Fp& operator *= (const Fp& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Fp& operator /= (const Fp& 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 Fp& r) const noexcept {
        return this->val == r.val;
    }
    constexpr bool operator != (const Fp& r) const noexcept {
        return this->val != r.val;
    }
    friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
        return os << x.val;
    }
    friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(a, n / 2);
        t = t * t;
        if (n & 1) t = t * a;
        return t;
    }
};
// const int MOD = 1000000007;
using mint = Fp<MOD>;


struct Solver {
void solve() {
  int n,m;cin>>n>>m;
  COMinit();
  int t=m%n;
  int now=m;
  mint ans=1;
  rep(i,n){
    int c=m/n;
    if(i<t)c++;
    ans*=COM(now,c);
    now-=c;
  }
  cout<<ans<<endl;
  return ;
}};

signed main() {
  int ts = 1;
  // scanf("%lld",&ts);
  rep(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}

#else

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;

using namespace std;

#define int ll

using ll=long long;
using ld = long double;
using uint = unsigned;
using ull = unsigned long long;
using P=pair<int,int>;
using TP=tuple<int,int,int>;
template <class T> using V = vector<T>;
template <class T> using max_heap = priority_queue<T>;
template <class T> using min_heap = priority_queue<T, vector<T>, greater<>>;

#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)
#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)
#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)
#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))
#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)
#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define rrep(...) overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)
#define fore(i,a) for(auto &i:a)

#define all(x) x.begin(),x.end() 
#define sz(x) ((int)(x).size())
#define bp(x) (__builtin_popcountll((long long)(x)))
#define elif else if
#define mpa make_pair
#define bit(n) (1LL<<(n))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vector<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.first>>v.second;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.first<<","<<v.second;}
template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(x>y){x=y;return true;}else return false;}
template<typename T1,typename T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<typename T>ll suma(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>ll suma(const V<V<T>>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;}
template<typename T>void uni(T& a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<typename T>void prepend(vector<T>&a,const T&x){a.insert(a.begin(),x);}

const int INF = 1001001001;
const ll INFL = 3e18;
const int MAX = 2e6+5;


#endif

yukicoder

結果

テストケース

ソースコード