Submission #1108502

---

Source Code Expand

from math import factorial as fact
from functools import reduce

def is_prime(n):
    if n < 2:
        return False
    else:
        for i in range(2, n):
            if i * i > n:
                break
            elif n % i == 0:
                return False
        return True

def divc(n, d):
    c = 0
    while n % d == 0:
        c = c + 1
        n = n // d
    return c

n = int(input())
pl = [p for p in range(1, 1001) if is_prime(p)]
cl = [divc(fact(n), d) for d in pl]
ans = reduce(lambda x, y: x * y, [c + 1 for c in cl]) % (10 ** 9 + 7)
print(ans)

Submission Info

Judge Result