結果

問題 No.2141 Enumeratest
ユーザー mikammikam
提出日時 2022-12-10 14:20:45
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 32 ms / 2,000 ms
コード長 3,876 bytes
コンパイル時間 4,880 ms
コンパイル使用メモリ 260,392 KB
実行使用メモリ 26,752 KB
最終ジャッジ日時 2024-04-22 23:49:11
合計ジャッジ時間 6,266 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 23 ms
18,932 KB
testcase_01 AC 23 ms
18,816 KB
testcase_02 AC 24 ms
19,072 KB
testcase_03 AC 24 ms
18,804 KB
testcase_04 AC 31 ms
26,752 KB
testcase_05 AC 32 ms
26,624 KB
testcase_06 AC 25 ms
18,816 KB
testcase_07 AC 25 ms
18,816 KB
testcase_08 AC 23 ms
18,944 KB
testcase_09 AC 23 ms
18,816 KB
testcase_10 AC 23 ms
18,816 KB
testcase_11 AC 22 ms
18,944 KB
testcase_12 AC 22 ms
18,828 KB
testcase_13 AC 22 ms
18,688 KB
testcase_14 AC 24 ms
18,908 KB
testcase_15 AC 26 ms
18,944 KB
testcase_16 AC 24 ms
18,944 KB
testcase_17 AC 29 ms
23,872 KB
testcase_18 AC 31 ms
25,196 KB
testcase_19 AC 32 ms
25,728 KB
testcase_20 AC 30 ms
24,548 KB
testcase_21 AC 30 ms
24,960 KB
testcase_22 AC 28 ms
23,296 KB
testcase_23 AC 25 ms
20,944 KB
testcase_24 AC 25 ms
20,376 KB
testcase_25 AC 23 ms
18,908 KB
testcase_26 AC 29 ms
25,984 KB
testcase_27 AC 30 ms
24,824 KB
testcase_28 AC 31 ms
26,240 KB
testcase_29 AC 28 ms
22,976 KB
testcase_30 AC 29 ms
25,856 KB
testcase_31 AC 28 ms
23,648 KB
testcase_32 AC 30 ms
24,320 KB
testcase_33 AC 29 ms
23,424 KB
testcase_34 AC 30 ms
23,264 KB
testcase_35 AC 24 ms
19,352 KB
testcase_36 AC 30 ms
26,112 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <atcoder/all>
using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
// #include <boost/multiprecision/cpp_int.hpp>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i,a,b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(),v.end()
#define inc(x,l,r) ((l)<=(x)&&(x)<(r)) 
#define Unique(x) sort(all(x)), x.erase(unique(all(x)), x.end())
typedef long long ll;
#define int ll
using ld = long double;
using vi = vector<int>;
using vs = vector<string>;
using P = pair<int,int>;
using vp = vector<P>;
// using Bint = boost::multiprecision::cpp_int;
template<typename T> using priority_queue_greater = priority_queue<T, vector<T>, greater<T>>;
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){rep(i,v.size())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<class... T> void _IN(T&... a){(cin>> ... >> a);}
template<class T> void _OUT(T& a){cout <<a<< '\n';}
template<class T,class... Ts> void _OUT(const T&a, const Ts&... b){cout<< a;(cout<<...<<(cout<<' ',b));cout<<'\n';}
#define INT(...) int __VA_ARGS__; _IN(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; _IN(__VA_ARGS__)
#define pcnt __builtin_popcountll
int sign(int x){return (x>0)-(x<0);}
int ceil(int x,int y){assert(y!=0);if(sign(x)==sign(y))return (x+y-1)/y;return -((-x/y));}
int floor(int x,int y){assert(y!=0);if(sign(x)==sign(y))return x/y;if(y<0)x*=-1,y*=-1;return x/y-(x%y<0);}
int abs(int x,int y){return abs(x-y);}
bool ins(string s,string t){return s.find(t)!=string::npos;}
P operator+ (const P &p, const P &q){ return P{p.first+q.first,p.second+q.second};}
P operator- (const P &p, const P &q){ return P{p.first-q.first,p.second-q.second};}
template<typename T1,typename T2> ostream &operator<< (ostream &os, const pair<T1,T2> &p){os << p.first <<" "<<p.second;return os;}
ostream &operator<< (ostream &os, const modint1000000007 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint1000000007 &m){ll in;is>>in;m=in;return is;}
ostream &operator<< (ostream &os, const modint998244353 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint998244353 &m){ll in;is>>in;m=in;return is;}
template<typename T1,typename T2> bool chmax(T1 &a, const T2 b) {if (a < b) {a = b; return true;} else return false; }
template<typename T1,typename T2> bool chmin(T1 &a, const T2 b) {if (a > b) {a = b; return true;} else return false; }
void yesno(bool ok,string y="Yes",string n="No"){ cout<<(ok?y:n)<<endl;}
int di[]={-1,0,1,0,-1,-1,1,1};
int dj[]={0,1,0,-1,-1,1,-1,1};
const int INF = 8e18;
//using mint = modint1000000007;
using mint = modint998244353;
class comb{
private:
    int MAX_N;
    vector<mint> _fac,_ifac;
    void init(){
        for(int i=2;i<=MAX_N;i++)_fac[i]=_fac[i-1]*i;
        _ifac[MAX_N]=1/_fac[MAX_N];
        for(int i=MAX_N-1;i>=1;i--)_ifac[i]=_ifac[i+1]*(i+1);
    }
public:
    comb(int n=2000200):MAX_N(n),_fac(n+1,1),_ifac(n+1,1){init();}
    mint fac(int k){
        assert(k<=MAX_N);
        return _fac[k];
    }
    mint ifac(int k){
        assert(k<=MAX_N);
        return _ifac[k];
    }
    mint nPr(int n,int r){if(r<0||n<r)return 0;return fac(n)*ifac(n-r);}
    mint nCr(int n,int r){if(r<0||n<r)return 0;return nPr(n,r)*ifac(r);}
    mint nHr(int n,int r,int low=0){r-=n*low;if(n==0&&r==0)return 1;if(n<=0||r<0)return 0;return nCr(n+r-1,r);}
} com;
signed main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    INT(n,m);
    vi a(n);
    rep(i,n)a[i]=m/n;
    rep(i,m%n)a[i]++;
    mint ans = 1;
    int s = m;
    rep(i,n){
        ans *= com.nCr(s,a[i]);
        s-=a[i];
    }
    cout << ans << endl;
    return 0;
}
0