Submission #3391139

---

Source Code Expand

def prime(n):
    p_list=[2]
    for i in range(3,n+1):
        flag=True
        for p in p_list:
            if i%p==0:
                flag=False
                break
        if flag:
            p_list.append(i)
    return p_list
    
p_list=prime(1000)
N=int(raw_input())
p_count = [1 for i in range(len(p_list))]
for i in range(len(p_list)):
    j=1
    p=p_list[i]
    count=0
    while p**j <=N:
        count+=int(N/(p**j))
        j+=1
    p_count[i]+=count

ans=1
for c in p_count:
    ans= (ans*c)%(10**9+7)
print ans

Submission Info

Judge Result