210992026-01-12 11:39:27szjNegáló rendezés (55 pont)cpp17Accepted 55/5537ms1324 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    long long  n, sz, mi=100000, ma=0;
    int a[100001]={};
    cin >> n;
    for(int i=0; i<n; i++)
    {
        cin >> sz;
        a[sz]++;
        mi=min(mi, sz);
        ma=max(ma,sz);
    }
    sz=1;
    for(mi=mi+1; mi<=ma; mi++)
    {
        if(a[mi]!=0)sz*=(a[mi]+1);
        sz=sz%1000000007;
    }
    cout << sz;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base55/55
1Accepted0/01ms564 KiB
2Accepted0/035ms1324 KiB
3Accepted2/21ms564 KiB
4Accepted2/22ms564 KiB
5Accepted2/22ms788 KiB
6Accepted2/22ms564 KiB
7Accepted3/32ms564 KiB
8Accepted2/22ms584 KiB
9Accepted3/33ms564 KiB
10Accepted3/332ms784 KiB
11Accepted3/335ms788 KiB
12Accepted3/334ms784 KiB
13Accepted3/332ms564 KiB
14Accepted3/335ms788 KiB
15Accepted3/335ms820 KiB
16Accepted3/335ms784 KiB
17Accepted3/334ms1064 KiB
18Accepted3/337ms564 KiB
19Accepted3/335ms1288 KiB
20Accepted3/334ms792 KiB
21Accepted3/332ms564 KiB
22Accepted3/335ms756 KiB