Submission #2063342

---

Source Code Expand

def prime_decomposition(n):
    # nを素因数分解
    from collections import defaultdict
    i = 2
    table = defaultdict(int)
    while i**2 <= n:
        while n % i == 0:
            n //= i
            table[i]+=1
        i += 1
    if n > 1:
        table[n]+=1
    return table

import math
N = int(input())
c = prime_decomposition(math.factorial(N))
ans = 1
for k, v in c.items():
    ans = (ans * (v + 1)) % (10**9 + 7)
print(ans)

Submission Info

Judge Result