137642025-01-08 17:27:36csdavidNegáló rendezés (55 pont)cpp17Accepted 55/5597ms5400 KiB
#include <iostream>
#include <set>
#include <map>
using namespace std;

int main()
{
    int n, x;
    long long y;
    map<int, int> mp;
    cin >> n;
    map<int, int>::iterator it;
    while(n--){
        cin >> x;
        it=mp.find(x);
        if(it==mp.end()){
            mp[x]=1;
        }
        else{
            it->second++;
        }
    }
    it=mp.begin();
    int meret=mp.size();
    int a[meret], i=0;
    while(it!=mp.end()){
        a[i]=it->second;
        i++;
        it++;
    }
    y=1;
    for(i=1; i<meret; i++){
        y=y*(a[i]+1)%1000000007;
    }
    cout << y;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base55/55
1Accepted0/01ms500 KiB
2Accepted0/067ms2100 KiB
3Accepted2/21ms508 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted3/31ms316 KiB
8Accepted2/21ms316 KiB
9Accepted3/32ms316 KiB
10Accepted3/383ms4916 KiB
11Accepted3/397ms5400 KiB
12Accepted3/335ms404 KiB
13Accepted3/332ms500 KiB
14Accepted3/354ms1332 KiB
15Accepted3/343ms316 KiB
16Accepted3/368ms2216 KiB
17Accepted3/365ms2392 KiB
18Accepted3/348ms788 KiB
19Accepted3/364ms2100 KiB
20Accepted3/357ms1240 KiB
21Accepted3/346ms820 KiB
22Accepted3/341ms432 KiB