Submission #17638835

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MAX = 350;
ll MOD = 998244353;
ll INV[MAX] = {}, FACTORIAL[MAX] = {}, FACTORIAL_INV[MAX] = {};
void calc_init() {
  INV[1] = 1;
  FACTORIAL[0] = FACTORIAL[1] = 1;
  FACTORIAL_INV[0] = FACTORIAL_INV[1] = 1;
  for (int i = 2; i < MAX; i++) {
    ll q = MOD / i, r = MOD % i;
    INV[i] = (-INV[r] * q) % MOD;
    INV[i] = (INV[i] + MOD) % MOD;
    FACTORIAL[i] = (i * FACTORIAL[i - 1]) % MOD;
    FACTORIAL_INV[i] = (INV[i] * FACTORIAL_INV[i - 1]) % MOD;
  }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const ll MAX = 350;
ll MOD = 998244353;
ll INV[MAX] = {}, FACTORIAL[MAX] = {}, FACTORIAL_INV[MAX] = {};

void calc_init() {
  INV[1] = 1;
  FACTORIAL[0] = FACTORIAL[1] = 1;
  FACTORIAL_INV[0] = FACTORIAL_INV[1] = 1;

  for (int i = 2; i < MAX; i++) {
    ll q = MOD / i, r = MOD % i;
    INV[i] = (-INV[r] * q) % MOD;
    INV[i] = (INV[i] + MOD) % MOD;
    FACTORIAL[i] = (i * FACTORIAL[i - 1]) % MOD;
    FACTORIAL_INV[i] = (INV[i] * FACTORIAL_INV[i - 1]) % MOD;
  }
}

vector<vector<ll>> memo(310, vector<ll>(310, -1));
ll nCk(ll n, ll k) {
  if (memo[n][k] != -1) return memo[n][k];
  ll ans = FACTORIAL[n];
  ans = (ans * FACTORIAL_INV[k]) % MOD;
  ans = (ans * FACTORIAL_INV[n - k]) % MOD;
  memo[n][k] = ans;
  return ans;
}


int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);

  ll N; cin >> N;
  ll K; cin >> K;
  vector<ll> A(N); for (ll i = 0; i < N; i++) cin >> A[i];

  calc_init();

  vector<vector<ll>> p(K + 1, vector<ll>(N, 1));
  for (ll i = 0; i < K; i++) {
    for (ll j = 0; j < N; j++) {
      p[i + 1][j] = (p[i][j] * A[j]) % MOD;
    }
  }
  vector<ll> s(K + 1, 0);
  for (ll i = 0; i < K + 1; i++) {
    for (ll j = 0; j < N; j++) {
      s[i] = (s[i] + p[i][j]) % MOD;
    }
  }

  for (ll i = 1; i <= K; i++) {
    ll sum = 0;
    for (ll j = 0; j <= i; j++) {
      ll temp;
      temp = (s[j] * s[i-j] - s[i] + MOD) % MOD;
      temp = temp * INV[2] % MOD;
      temp = temp * nCk(i, j) % MOD;
      sum = (sum + temp) % MOD;
    }
    cout << sum << '\n';
  }
  return 0;
}

Submission Info

Judge Result