Submission #69671307

---

Source Code Expand

  //#include "atcoder/modint"
  #pragma GCC optimize("Ofast")
  #include "atcoder/all"
  #include <bits/stdc++.h>
  #include  <string>
  using namespace std;
  using namespace atcoder;
  #define int long long
    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; }
  //const int MOD =1e9+7;
  //constexpr int MOD =10;
  constexpr int MOD =998244353;
  const long long M1=167772161,M2=469762049,M3=1224736769;
  //const int MOD =31607;
  //using mint = static_modint<MOD>;
  //using mint = double;
  using mint = modint;
  ostream& operator << (ostream& ost, const mint& m){ost << m.val();return ost;}
  istream& operator >> (istream& ost,  mint& m){int a;ost >> a;m=a;return ost;}
  double time_limit = 100.0,start_temp=0.01,end_temp=0.0;
  std::mt19937 rng(std::random_device{}()); 
mint dp[5001][5001];
  signed main(){
    //ios_base::sync_with_stdio(false);
    //cin.tie(NULL);
    int t,m;
    cin>>t>>m;
    mint::set_mod(m);
    
    dp[0][0]=1;
    for(int i=1;i<=5000;i++){
      for(int j=0;j<=i;j++){
        dp[i][j]=dp[i-1][j];
        if(j>0) dp[i][j]+=dp[i-1][j-1];
    
      }
    }

      for(int i=0;i<t;i++){
        int n;
        cin>>n;
        int c,s=0;
        mint ans=1;
        for(int j=0;j<n;j++){
          cin>>c;
          s+=c;
          ans*=dp[s][c];
        }
        cout<<ans<<endl;
      }



  
 
   

  }

Submission Info

Judge Result