Submission #3776140

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;

const long long MOD = (long long)1e9 + 7;
long long func[100010];

void init_func(){
    func[0] = 1;
    for(int i = 1; i <= 100000; i++){
        func[i] = (func[i - 1] * i) % MOD; 
    }
}

long long mod_pow(long long x_, long long y_){
    if(y_ == 0) return 1;
    long long res = mod_pow(x_ * x_ % MOD, y_ / 2);
    if(y_ & 1) res =  x_ * res % MOD;
    return res;
}

long long comb(long long x, long long y){
    if(x < y) return 0;
    return (((func[x] * mod_pow(func[y], MOD - 2)) % MOD) * mod_pow(func[x - y], MOD - 2)) % MOD;
}

int main(){
    int n, ans = 0, l, r;
    cin >> n;
    vector<int> b(n + 1, -1);
    for(int i = 0; i < n + 1; i++){
        int x;
        cin >> x;
        if(b[x] == -1)
            b[x] = i;
        else{
            l = b[x];
            r = n - i;
            break;
        }
    }
    init_func();
    for(int i = 1; i <= n + 1; i++){
        cout << (comb(n + 1, i) - comb(l + r, i - 1) + MOD) % MOD << endl;
    }
    return 0;
}

Submission Info

Judge Result