Submission #8352190

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
using namespace std;
#define MOD 998244353
#define INF (1<<29)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;

Int mod_pow(Int x, Int a, Int m = MOD){
    if(a == 0)return 1;
    Int res = mod_pow(x, a / 2, m);
    res = res * res % m;
    if(a % 2)res *= x;
    return res % m;
}

Int inv(Int x, Int m = MOD){
    return mod_pow(x, m-2, m);
}
Int n, d;
Int cnt[110000];


int main(){
    cin >> n;
    Int maxd = 0;
    for(int i = 0;i < n;i++){
        cin >> d;
        if(i == 0){
            if(d != 0)cout << 0 << endl;
            return 0;
        }else{
            if(d == 0)cout << 0 << endl;
            return 0;
        }
        cnt[d]++;
        maxd = max(maxd, d);
    }
    Int ans = 1;
    for(int i = 1;i <= maxd;i++){
        ans = ans * mod_pow(cnt[i-1], cnt[i]) % MOD;
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result