143142025-01-10 13:47:52kongopongNegáló rendezés (55 pont)cpp17Accepted 55/5534ms816 KiB
#include <iostream>
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector <int> v;
    v.resize(100001);
    int x, mn=2147483647, mx=0;
    for(int i=0; i<n; i++){
        cin >> x;
        v[x]++;
        mn=min(mn, x);
        mx=max(mx, x);
    }
    long long db=1;
    for(int i=mn+1; i<=mx; i++)
    {
        if(v[i]!=0)
        {
             db=db*(v[i]+1);
             db=db%1000000007;
        }
            
    }
   
    cout << db;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base55/55
1Accepted0/01ms564 KiB
2Accepted0/034ms564 KiB
3Accepted2/21ms564 KiB
4Accepted2/22ms564 KiB
5Accepted2/21ms564 KiB
6Accepted2/21ms644 KiB
7Accepted3/31ms564 KiB
8Accepted2/21ms564 KiB
9Accepted3/32ms564 KiB
10Accepted3/330ms808 KiB
11Accepted3/334ms748 KiB
12Accepted3/332ms564 KiB
13Accepted3/330ms564 KiB
14Accepted3/332ms756 KiB
15Accepted3/334ms800 KiB
16Accepted3/334ms564 KiB
17Accepted3/332ms804 KiB
18Accepted3/334ms808 KiB
19Accepted3/334ms816 KiB
20Accepted3/332ms564 KiB
21Accepted3/330ms800 KiB
22Accepted3/332ms564 KiB