223162026-01-14 21:15:02algoproNegáló rendezés (55 pont)cpp17Accepted 55/5582ms5092 KiB
// UUID: 48afe9e2-165b-4729-8c69-64dfbbdfe586
#include <bits/stdc++.h>
using namespace std;
//segítséggel
int main() {
	int n;
    cin >> n;
    map <int,int> szam;
    int min=100001;
    for (int a, i=0; i<n; i++) {
        cin >> a;
        szam[a]++;
        if (a<min) min=a;
    }
    long long ans=1;
    for (pair<int,int> x : szam) {
        if (x.first!=min)
        {   ans*= x.second+1;
            ans=ans%1000000007;
        }
    }
    cout << ans;



}
SubtaskSumTestVerdictTimeMemory
base55/55
1Accepted0/01ms316 KiB
2Accepted0/061ms2108 KiB
3Accepted2/21ms508 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms500 KiB
6Accepted2/21ms316 KiB
7Accepted3/31ms316 KiB
8Accepted2/21ms384 KiB
9Accepted3/32ms316 KiB
10Accepted3/371ms4560 KiB
11Accepted3/382ms5092 KiB
12Accepted3/334ms316 KiB
13Accepted3/332ms396 KiB
14Accepted3/350ms1240 KiB
15Accepted3/343ms316 KiB
16Accepted3/361ms2100 KiB
17Accepted3/359ms2228 KiB
18Accepted3/348ms848 KiB
19Accepted3/361ms2048 KiB
20Accepted3/354ms1332 KiB
21Accepted3/346ms708 KiB
22Accepted3/341ms428 KiB