Submission #7,911

2024-01-11 21:01:50

cpp17

Accepted 55/55

37ms

12532 KiB

#include <iostream>

using namespace std;
const int mod=1000000007;
int n;
int a[100001]={0}; ///elofordulasi
int main()
{
   cin>>n;
   int x, mini=100001, maxi=0;
   for(int i=1;i<=n;i++)
    { cin>>x; a[x]++;
        if(x<mini)mini=x;
        if(x>maxi)maxi=x;
    }
   long long p=1;
   int i=maxi;
   while(i>mini)
   {
       if(a[i]>0) p=(p*((a[i]+1)%mod)%mod);
       i--;
   }
   cout<<p;

    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	55/55
		1	Accepted	0/0	3ms	2160 KiB
		2	Accepted	0/0	37ms	3628 KiB
		3	Accepted	2/2	3ms	2864 KiB
		4	Accepted	2/2	3ms	2940 KiB
		5	Accepted	2/2	3ms	2952 KiB
		6	Accepted	2/2	3ms	3208 KiB
		7	Accepted	3/3	3ms	3248 KiB
		8	Accepted	2/2	3ms	3532 KiB
		9	Accepted	3/3	3ms	4328 KiB
		10	Accepted	3/3	32ms	4820 KiB
		11	Accepted	3/3	37ms	5360 KiB
		12	Accepted	3/3	37ms	5428 KiB
		13	Accepted	3/3	34ms	6276 KiB
		14	Accepted	3/3	37ms	7424 KiB
		15	Accepted	3/3	37ms	8288 KiB
		16	Accepted	3/3	37ms	8808 KiB
		17	Accepted	3/3	35ms	9592 KiB
		18	Accepted	3/3	37ms	10240 KiB
		19	Accepted	3/3	37ms	10840 KiB
		20	Accepted	3/3	35ms	11568 KiB
		21	Accepted	3/3	32ms	12000 KiB
		22	Accepted	3/3	35ms	12532 KiB