Submission #1397482

---

Source Code Expand

#include <iostream>
#define REP(i, a, n) for(int i = ((int) a); i < ((int) n); i++)
#define MOD 1000000007
using namespace std;
typedef long long ll;

int N, A[100010];
ll fact[1000010];

ll pow_mod(ll a, ll b) {
  ll x = 1, y = a;
  while(b > 0) {
    if(b % 2) x = (x * y) % MOD;
    y = (y * y) % MOD;
    b /= 2;
  }
  return x % MOD;
}

ll mod_inv(ll n) {
  return pow_mod(n, MOD - 2);
}

ll comb_mod(ll n, ll k) {
  return (fact[n] * mod_inv(fact[k]) % MOD) * mod_inv(fact[n - k]) % MOD;
}

int main(void) {
  cin >> N;
  REP(i, 0, N + 1) cin >> A[i];

  int s;
  int pos[100010];
  REP(i, 0, N + 1) pos[i] = -1;
  REP(i, 0, N + 1) {
    if(pos[A[i]] == -1) pos[A[i]] = i;
    else s = pos[A[i]] + (N - i);
  }

  fact[0] = 1;
  REP(i, 1, 100010) fact[i] = (fact[i - 1] * i) % MOD;

  cout << N << endl;
  REP(i, 2, N + 2) cout << (comb_mod(N + 1, i) - (i - 1 <= s ? comb_mod(s, i - 1) : 0) + MOD) % MOD << endl;

  return 0;
}

Submission Info

Judge Result