Submission #12,088

12088

2024-12-02 09:02:11

cpp17

Accepted 55/55

43ms

1148 KiB

#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, MOD = 1e9+7;
	cin >> n;
	vector<int> v(n);
	for(int i = 0; i < n; i++) cin >> v[i];

	sort(v.begin(), v.end());
	v.push_back(-1);

	unsigned long long p = 1;
	int c = 1;
	bool elso = true;
	for(int i = 1; i <= n; i++) {
		if(v[i] == v[i-1]) c++;
		else {
			if(!elso) p = p*(c+1) % MOD;
			else elso = false;
			c = 1;
		}
	}
	cout << p;

	return 0;
}

	Sum	Test	Verdict		Time	Memory
base	55/55
		1	Accepted	0/0	1ms	320 KiB
		2	Accepted	0/0	43ms	1080 KiB
		3	Accepted	2/2	1ms	320 KiB
		4	Accepted	2/2	1ms	320 KiB
		5	Accepted	2/2	1ms	320 KiB
		6	Accepted	2/2	1ms	320 KiB
		7	Accepted	3/3	1ms	320 KiB
		8	Accepted	2/2	1ms	396 KiB
		9	Accepted	3/3	1ms	320 KiB
		10	Accepted	3/3	39ms	1080 KiB
		11	Accepted	3/3	43ms	1080 KiB
		12	Accepted	3/3	35ms	1064 KiB
		13	Accepted	3/3	34ms	1148 KiB
		14	Accepted	3/3	41ms	1060 KiB
		15	Accepted	3/3	39ms	1064 KiB
		16	Accepted	3/3	43ms	1064 KiB
		17	Accepted	3/3	39ms	1052 KiB
		18	Accepted	3/3	41ms	988 KiB
		19	Accepted	3/3	43ms	1080 KiB
		20	Accepted	3/3	41ms	1060 KiB
		21	Accepted	3/3	37ms	1028 KiB
		22	Accepted	3/3	39ms	1080 KiB