40602023-03-12 16:06:28horvathabelNegáló rendezés (55 pont)cpp17Wrong answer 25/5579ms15544 KiB
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
	int n;
	cin>>n;
	map<ll, ll> m;
	int mn=10e9+1; 
	for (int i=0; i<n;i++){
		int x;
		cin>>x;
		m[x]++; 
		mn=min(x,mn);
	}
	int ans=1; 
	for (auto i:m){
		if (i.first!=mn) ans*=i.second+1;
		ans=ans%1000000007;
	}
	cout<<ans; 
}
SubtaskSumTestVerdictTimeMemory
base25/55
1Accepted0/03ms1808 KiB
2Wrong answer0/061ms6864 KiB
3Accepted2/22ms2368 KiB
4Accepted2/23ms2456 KiB
5Accepted2/23ms2640 KiB
6Accepted2/23ms2720 KiB
7Accepted3/32ms2868 KiB
8Accepted2/22ms2892 KiB
9Accepted3/33ms2972 KiB
10Accepted3/371ms14152 KiB
11Accepted3/379ms15544 KiB
12Accepted3/335ms3180 KiB
13Wrong answer0/334ms3244 KiB
14Wrong answer0/352ms6036 KiB
15Wrong answer0/343ms3696 KiB
16Wrong answer0/363ms8500 KiB
17Wrong answer0/361ms9092 KiB
18Wrong answer0/350ms5176 KiB
19Wrong answer0/361ms8204 KiB
20Wrong answer0/354ms6344 KiB
21Wrong answer0/346ms5164 KiB
22Wrong answer0/341ms4064 KiB