Submission #14,218

2025-01-10 09:51:09

cpp17

Accepted 55/55

43ms

1084 KiB

#include <bits/stdc++.h>

using namespace std;
//ifstream f("be.in");
int n,m=1e9+7;

int main()
{
    cin>>n;
    vector<int>a(n);
    for (int i=0; i<n; i++) cin>>a[i];
    sort(a.begin(),a.end());
    a.push_back(-1);
    int c=1;
    unsigned long long p=1;
    bool elso=true;
    for (int i=1; i<=n; i++) {
        if(a[i]==a[i-1]) c++;
        else {
            if (elso==false) p=p*(c+1)%m;
            else elso=false;
            c=1;
        }
    }
    cout<<p;
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	55/55
		1	Accepted	0/0	1ms	316 KiB
		2	Accepted	0/0	43ms	1056 KiB
		3	Accepted	2/2	1ms	316 KiB
		4	Accepted	2/2	1ms	316 KiB
		5	Accepted	2/2	1ms	316 KiB
		6	Accepted	2/2	1ms	500 KiB
		7	Accepted	3/3	1ms	316 KiB
		8	Accepted	2/2	1ms	316 KiB
		9	Accepted	3/3	1ms	316 KiB
		10	Accepted	3/3	39ms	1016 KiB
		11	Accepted	3/3	43ms	1076 KiB
		12	Accepted	3/3	35ms	1060 KiB
		13	Accepted	3/3	34ms	1068 KiB
		14	Accepted	3/3	43ms	1056 KiB
		15	Accepted	3/3	39ms	1076 KiB
		16	Accepted	3/3	43ms	1060 KiB
		17	Accepted	3/3	41ms	1048 KiB
		18	Accepted	3/3	41ms	1084 KiB
		19	Accepted	3/3	43ms	1076 KiB
		20	Accepted	3/3	41ms	1052 KiB
		21	Accepted	3/3	39ms	1028 KiB
		22	Accepted	3/3	39ms	1084 KiB