232862026-01-18 14:28:47algoproNegáló rendezés (55 pont)cpp17Wrong answer 5/5582ms5424 KiB
// UUID: 29e03156-8779-4b08-b8b4-98f8913569f8
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
    cin >> n;
    vector<int> szk (n);
    map<int,int> a;
    for (int i = 0; i < n; i++) {
        cin >> szk[i];
        a[szk[i]]++;
    }
    long long szor = 1;
    for (pair<int,int> par : a) {
        if (par.first != 0) {
            szor *= par.second+1;
            szor %= 1000000000 + 7;
        }
    }
    cout << szor/2;
}
SubtaskSumTestVerdictTimeMemory
base5/55
1Accepted0/01ms316 KiB
2Wrong answer0/063ms2356 KiB
3Wrong answer0/21ms500 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Accepted3/31ms316 KiB
8Accepted2/22ms492 KiB
9Wrong answer0/32ms316 KiB
10Wrong answer0/374ms4908 KiB
11Wrong answer0/382ms5424 KiB
12Wrong answer0/335ms564 KiB
13Wrong answer0/332ms564 KiB
14Wrong answer0/350ms1600 KiB
15Wrong answer0/343ms1008 KiB
16Wrong answer0/361ms2356 KiB
17Wrong answer0/359ms2688 KiB
18Wrong answer0/348ms1076 KiB
19Wrong answer0/363ms2268 KiB
20Wrong answer0/354ms1608 KiB
21Wrong answer0/346ms1204 KiB
22Wrong answer0/339ms828 KiB