216832026-01-13 18:05:17algoproNegáló rendezés (55 pont)cpp17Wrong answer 25/5535ms1176 KiB
// UUID: 51ffe014-1a36-4c6d-af4d-d6a2f15c774f
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;

int main() {
	int n; cin >> n;
	vector<int> nums(100001);
	int ans = 1;
	bool x = false;
	for(int i = 0; i < n; i++) {
		int a; cin >> a;
		nums[a]++;
	}
	for(int i = 0; i <= 100000; i++) {
		if(nums[i] > 0&& x == false) x = true;
		else if(nums[i] > 0) {
			ans *= nums[i]+1;
			ans = ans % mod;
		}
	}
	cout << ans;
}
SubtaskSumTestVerdictTimeMemory
base25/55
1Accepted0/01ms564 KiB
2Wrong answer0/034ms1076 KiB
3Accepted2/21ms564 KiB
4Accepted2/21ms564 KiB
5Accepted2/21ms568 KiB
6Accepted2/21ms564 KiB
7Accepted3/31ms564 KiB
8Accepted2/21ms564 KiB
9Accepted3/32ms624 KiB
10Accepted3/330ms796 KiB
11Accepted3/334ms812 KiB
12Accepted3/332ms564 KiB
13Wrong answer0/330ms564 KiB
14Wrong answer0/332ms760 KiB
15Wrong answer0/332ms928 KiB
16Wrong answer0/332ms564 KiB
17Wrong answer0/332ms904 KiB
18Wrong answer0/335ms796 KiB
19Wrong answer0/334ms1176 KiB
20Wrong answer0/332ms564 KiB
21Wrong answer0/330ms564 KiB
22Wrong answer0/332ms564 KiB