Submission #2071484

---

Source Code Expand

N = int(input())
div = 10**9+7


# ある自然数未満までのエラトステネスの篩をつくる
def mark(s, x):
    for i in range(x + x, len(s), x):
        s[i] = False


def eratosthenes(n):
    s = [True] * n
    for x in range(2, int(n ** 0.5) + 1):
        if s[x]: mark(s, x)
    return [i for i in range(0, n) if s[i] and i > 1]


primes = eratosthenes(1000)
num_pow = [1] * (N+1)

for n in range(1, N+1):
    for p in primes:
        if p > n:
            break
        while True:
            if n % p == 0:
                n /= p
                num_pow[p] += 1
            else:
                break

ans = 1
for z in num_pow:
    ans *= z

print(ans % div)

Submission Info

Judge Result