Submission #24,220

2026-02-06 20:50:16

pypy3

Accepted 55/55

79ms

31984 KiB

# UUID: 64154307-741a-4b5c-bebe-c684b8b0a8d3
mod = 10**9+7

def solv():
    N = int(input())
    A = [int(x) for x in input().split()]
    histogram = [0]*100001
    for a in A: histogram[a]+=1
    ans=1
    for j in range(100001): ans = (ans * (histogram[j] + 1)) % mod
    print(ans * pow(histogram[min(A)] + 1, -1, mod) % mod)

solv()

	Sum	Test	Verdict		Time	Memory
base	55/55
		1	Accepted	0/0	46ms	22256 KiB
		2	Accepted	0/0	76ms	31924 KiB
		3	Accepted	2/2	52ms	22220 KiB
		4	Accepted	2/2	46ms	22216 KiB
		5	Accepted	2/2	54ms	22164 KiB
		6	Accepted	2/2	54ms	22324 KiB
		7	Accepted	3/3	48ms	22272 KiB
		8	Accepted	2/2	46ms	22272 KiB
		9	Accepted	3/3	59ms	22504 KiB
		10	Accepted	3/3	65ms	30944 KiB
		11	Accepted	3/3	65ms	31976 KiB
		12	Accepted	3/3	75ms	31984 KiB
		13	Accepted	3/3	79ms	31904 KiB
		14	Accepted	3/3	67ms	31904 KiB
		15	Accepted	3/3	65ms	31892 KiB
		16	Accepted	3/3	75ms	31932 KiB
		17	Accepted	3/3	68ms	31840 KiB
		18	Accepted	3/3	78ms	31980 KiB
		19	Accepted	3/3	67ms	31880 KiB
		20	Accepted	3/3	75ms	31984 KiB
		21	Accepted	3/3	72ms	30924 KiB
		22	Accepted	3/3	67ms	31948 KiB