Submission #3390906

---

Source Code Expand

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

template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}

const ll MOD = 1000000007;
const int SIZE = 110000;
ll inv[SIZE],fac[SIZE],finv[SIZE];
void make(){
    fac[0]=fac[1]=1;
    finv[0]=finv[1]=1;
    inv[1]=1;
    for(int i=2;i<SIZE;i++){
        inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;
        fac[i]=fac[i-1]*(ll) i%MOD;
        finv[i]=finv[i-1]*inv[i]%MOD;
    }
}

ll nCr(ll n,ll r){
    if(n<r) return 0;
    return fac[n] * finv[r] % MOD * finv[n-r] % MOD;
}

ll n,a[100010];
bool used[100010];
ll ka = 0;
ll cnt1,cnt2,cnt3;


int main() {
    make();
    std::cin >> n;
    for (int i = 0; i < n+1; i++) {
        std::cin >> a[i];
        if(!used[a[i]]){
            used[a[i]] = true;
        }else{
            ka = a[i];
        }
    }

    cnt1 = distance(a,find(a,a+n+1,ka));
    cnt2 = distance(a,find(a + cnt1+1,a+n+1,ka))-cnt1-1;
    cnt3 = n+1 - cnt1 - cnt2-2;
    
    for (int i = 1; i <= n+1; i++) {
        std::cout << (nCr(n+1,i) - nCr(cnt1+cnt3,i-1) + MOD*2)%MOD << std::endl;
    }
}

Submission Info

Judge Result