143132025-01-10 13:46:48kongopongNegáló rendezés (55 pont)cpp17Wrong answer 19/5534ms804 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
base19/55
1Accepted0/01ms564 KiB
2Wrong answer0/034ms564 KiB
3Accepted2/21ms564 KiB
4Accepted2/21ms564 KiB
5Accepted2/21ms564 KiB
6Accepted2/22ms748 KiB
7Accepted3/31ms564 KiB
8Accepted2/21ms564 KiB
9Wrong answer0/32ms564 KiB
10Wrong answer0/329ms796 KiB
11Wrong answer0/334ms564 KiB
12Accepted3/334ms564 KiB
13Accepted3/332ms796 KiB
14Wrong answer0/334ms564 KiB
15Wrong answer0/334ms800 KiB
16Wrong answer0/334ms796 KiB
17Wrong answer0/332ms804 KiB
18Wrong answer0/334ms796 KiB
19Wrong answer0/334ms564 KiB
20Wrong answer0/334ms564 KiB
21Wrong answer0/330ms564 KiB
22Wrong answer0/332ms564 KiB