Submission #2208730

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

const int N = (int) 1e5;
const int mod = (int) 1e9 + 7;

int fast_pow(int x, int n) {
  if (n == 0) {
    return 1;
  }
  if (n % 2 == 0) {
    int y = fast_pow(x, n / 2);
    return y * 1LL * y % mod;
  }
  return fast_pow(x, n - 1) * 1LL * x % mod;
}

int f[N + 1];
int g[N + 1];

void init() {
  f[0] = 1;
  for (int i = 1; i <= N; i++) {
    f[i] = f[i - 1] * 1LL * i % mod;
//    cerr << f[i] << "\n";
  }
  g[0] = 1;
  for (int i = 1; i <= N; i++) {
    g[i] = g[i - 1] * 1LL * fast_pow(i, mod - 2) % mod;   
  }   
}

int C(int n, int k) {
  return f[n] * 1LL * g[k] % mod * g[n - k] % mod;
}

int a[N];

int main() {
  int n; cin >> n;
  int p = -1;
  int d = -1;
  for (int i = 0; i < n + 1; i++) {
    cin >> a[i];
    if (a[i] == 1) {
      if (p == -1) {
        p = i;
      } else {
        d = i - p + 1;
      }           
    }
  }
  // C(N + 1, K)
  // C(N + 1 - D, K - 1)  
  init();
  for (int k = 1; k <= n + 1; k++) {
//    cerr << C(n + 1, k) << "\n";
    cout << C(n + 1, k) - C(n + 1 - d, k - 1) << "\n";
  }                         
}

Submission Info

Judge Result