s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s860381454 | p03828 | u513081876 | 1589938692 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 255 | import math
N = int(input())
num = 1
ans = 0
for i in range(1, N + 1):
num *= i
maxx = int(math.sqrt(num)) + 2
print(num)
print(maxx)
for i in range(1, (num // 2) + 3):
if num % i == 0:
ans += 1
ans %= (10**9) + 7
print(ans + 1) |
s149799812 | p03828 | u513081876 | 1589938459 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 226 | import math
N = int(input())
num = 1
ans = 0
for i in range(1, N + 1):
num *= i
maxx = int(math.sqrt(num)) + 2
for i in range(1, maxx + 1):
if num % i == 0:
ans += 1
ans %= (10**9) + 7
print(ans + 1) |
s599936952 | p03828 | u513081876 | 1589938291 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 194 | import math
N = int(input())
num = 1
ans = 0
for i in range(1, N + 1):
num *= i
maxx = int(math.sqrt(num)) + 2
for i in range(1, maxx + 1):
if num % i == 0:
ans += 1
print(ans) |
s797820243 | p03828 | u312078744 | 1589345264 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 326 | import math
# nの約数を全て求める
lim = 10 ** 9 + 7
n = int(input())
if (n <= 2):
ans = n
else:
fact = math.factorial(n)
ans = 1
loop = int(fact/2)
for i in range(1, loop + 1):
if (fact % i == 0):
#check[i] = 1
ans += 1
#ans = sum(check)
ans %= lim
print(ans)
|
s026321396 | p03828 | u312078744 | 1589344420 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 244 | import math
# nの約数を全て求める
lim = 10 ** 9 + 7
n = int(input())
fact = math.factorial(n)
check = [0] * (fact + 1)
for i in range(1, fact + 1):
if (fact % i == 0):
check[i] = 1
ans = sum(check)
ans %= lim
print(ans)
|
s743948263 | p03828 | u679520304 | 1589244955 | Python | PyPy3 (2.4.0) | py | Runtime Error | 198 | 39664 | 296 | import collections
N = int(input())
num = []
for i in range(2,N+1):
for j in range(2,i+1):
#print(j)
while i%j==0:
i //= j
num.append(j)
#print(num)
A = collections.Counter(num)
#print(A)
ans = 1
for v in A.values():
ans *= (v+1)%mod
print(ans%mod) |
s844540581 | p03828 | u519923151 | 1588646500 | Python | Python (3.4.3) | py | Runtime Error | 67 | 3064 | 618 | n = int(input())
import math
nn = math.factorial(n)
if n ==1:
print("1")
elif n ==2:
print("2")
else:
sosu =[2]
for i in range(3,n+1,2):
judge = 0
for j in range(2,i):
if i % j == 0:
judge = 1
if judge ==0:
sosu.append(i)
slist =[0]*len(sosu)
for k in range(0,len(sosu)):
m = nn
count = 0
while m % sosu[k] ==0:
m = m //sosu[k]
count +=1
slist[k] = count
res = 1
for l in range(0,len(slist)):
res =res*(slist[l]+1) % 1000000007
print(res) |
s936834498 | p03828 | u519923151 | 1588646201 | Python | Python (3.4.3) | py | Runtime Error | 68 | 3064 | 614 | n = int(input())
import math
nn = math.factorial(n)
if n ==1:
print(1)
elif n ==2:
print(2)
else:
sosu =[2]
for i in range(3,n+1,2):
judge = 0
for j in range(2,i):
if i % j == 0:
judge = 1
if judge ==0:
sosu.append(i)
slist =[0]*len(sosu)
for k in range(0,len(sosu)):
m = nn
count = 0
while m % sosu[k] ==0:
m = m //sosu[k]
count +=1
slist[k] = count
res = 1
for l in range(0,len(slist)):
res =res*(slist[l]+1) % 1000000007
print(res) |
s773503022 | p03828 | u892487306 | 1588209688 | Python | Python (3.4.3) | py | Runtime Error | 68 | 3064 | 708 | N = int(input())
if N == 1:
print(1)
# calculate primes by sieve
primes = list(range(2, N + 1))
prime_index = 0
n = primes[prime_index]
while n**2 <= N:
primes = list(filter(lambda x: x == n or x % n != 0, primes))
prime_index += 1
n = primes[prime_index]
# calculate exponents
exponents = [0 for _ in range(len(primes))]
for n in range(2, N + 1):
for prime_index, prime in enumerate(primes):
exponent = 0
tmp = n
while tmp % prime == 0:
tmp //= prime
exponent += 1
exponents[prime_index] += exponent
# calculate answer
const = 10**9 + 7
answer = 1
for e in exponents:
answer = answer * (e + 1)
answer %= const
print(answer) |
s357909774 | p03828 | u892487306 | 1588209620 | Python | Python (3.4.3) | py | Runtime Error | 65 | 3064 | 684 | N = int(input())
# calculate primes by sieve
primes = list(range(2, N + 1))
prime_index = 0
n = primes[prime_index]
while n**2 <= N:
primes = list(filter(lambda x: x == n or x % n != 0, primes))
prime_index += 1
n = primes[prime_index]
# calculate exponents
exponents = [0 for _ in range(len(primes))]
for n in range(2, N + 1):
for prime_index, prime in enumerate(primes):
exponent = 0
tmp = n
while tmp % prime == 0:
tmp //= prime
exponent += 1
exponents[prime_index] += exponent
# calculate answer
const = 10**9 + 7
answer = 1
for e in exponents:
answer = answer * (e + 1)
answer %= const
print(answer) |
s255767249 | p03828 | u189326411 | 1587933145 | Python | Python (3.4.3) | py | Runtime Error | 47 | 3064 | 777 | import math
n = int(input())
mod = 10**9+7
def eratosthenes(n):
if not isinstance(n, int):
raise TypeError('n is int type.')
if n < 2:
raise ValueError('n is more than 2')
prime = []
limit = math.sqrt(n)
data = [i + 1 for i in range(1, n)]
while True:
p = data[0]
if limit <= p:
return prime + data
prime.append(p)
data = [e for e in data if e % p != 0]
era = eratosthenes(n)
dict = {}
for i in range(n):
num = i+1
while num!=1:
for j in era:
while num%j==0:
num/=j
if j in dict:
dict[j]+=1
else:
dict[j]=1
ans = 1
for i in dict:
ans = ans*(dict[i]+1)%mod
print(ans)
|
s348400261 | p03828 | u891217808 | 1587351544 | Python | Python (3.4.3) | py | Runtime Error | 70 | 3316 | 291 | from collections import defaultdict
n = int(input())
factors = defaultdict(int)
for i in range(2, n + 1):
for j in range(2, i+1):
while i % j == 0:
factors[j] += 1
i //= j
a = '*'.join(str(value+1) for value in factors.values())
print(eval(a)%(10**9+7))
|
s112585327 | p03828 | u282978698 | 1587337434 | Python | PyPy3 (2.4.0) | py | Runtime Error | 184 | 38384 | 448 | import math
N = int(input())
prime=[]
count=[]
ans = 1
place = 0
n = math.factorial(N)
tmp = int(math.sqrt(n))+1
for k in range(1,N+1):
for i in range(2,tmp):
while k % i == 0:
k //= i
if(i in prime):
count[prime.index(i)] += 1
else:
prime.append(i)
count.append(1)
place += 1
for j in range(0,place):
ans *= (count[j]+1)
print(ans) |
s264934948 | p03828 | u255673886 | 1587158710 | Python | PyPy3 (2.4.0) | py | Runtime Error | 185 | 38384 | 2338 | from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import permutations,combinations
from collections import defaultdict,Counter
from math import gcd,ceil,floor,factorial
# from fractions import gcd
from functools import reduce
from pprint import pprint
def myinput():
return map(int,input().split())
def mylistinput(n):
return [ list(myinput()) for _ in range(n) ]
def mycol(data,col):
return [ row[col] for row in data ]
def mysort(data,col):
data.sort(key=lambda x:x[col],reverse=False)
return data
def mymax(data):
M = -1*float("inf")
for i in range(len(data)):
m = max(data[i])
M = max(M,m)
return M
def mymin(data):
m = float("inf")
for i in range(len(data)):
M = min(data[i])
m = min(m,M)
return m
def myoutput(ls,space=True):
if space:
if len(ls)==0:
print(" ")
elif type(ls[0])==str:
print(" ".join(ls))
elif type(ls[0])==int:
print(" ".join(map(str,ls)))
else:
print("Output Error")
else:
if len(ls)==0:
print("")
elif type(ls[0])==str:
print("".join(ls))
elif type(ls[0])==int:
print("".join(map(str,ls)))
else:
print("Output Error")
n = int(input())
mod = 10**9 + 7
# nまでの自然数が素数かどうかを表すリストを返す
# Sieve of Eratosthenes
def makePrimeChecker(n):
isPrime = [True] * (n + 1)
isPrime[0] = False
isPrime[1] = False
for i in range(2, int(n ** 0.5) + 1):
if isPrime[i]:
for j in range(i * i, n + 1, i):
isPrime[j] = False
return isPrime
ls = makePrimeChecker(n)
print(ls)
# def make_divisors(n):
# divisors = []
# for i in range(1, int(n**0.5)+1):
# if n % i == 0:
# divisors.append(i)
# if i != n // i:
# divisors.append(n//i)
# # divisors.sort()
# return divisors
ans = 1
for p in range(2,len(ls)):
if ls[p]:
i = 0
count = 0
while n>=(p**i):
i += 1
count += n//(p**i)
ans *= count + 1
else:
pass
# ans2 = make_divisors(factorial(n))
# print(ans2)
print(ans%mod) |
s184318057 | p03828 | u192154323 | 1586821223 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3700 | 851 | import sys
sys.setrecursionlimit(2000)
n = int(input())
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n ** 0.5 // 1)) + 1):
if temp % i == 0:
cnt = 0
while temp % i == 0:
cnt += 1
temp //= i
arr.append([i,cnt])
# 上のループを通した後にtempが1じゃなかったら、だけど、nが素数以外にそんなケースある？
if temp!=1:
arr.append([temp, 1])
# 素数だったときの処理
if arr == []:
arr.append([n,1])
return arr
def factorial(n):
if n == 1:
return 1
return n * factorial(n-1)
F = factorial(n)
factor_ls = factorization(F)
ls = [factor[1] for factor in factor_ls]
num_factor = 1
for i in ls:
num_factor *= (i + 1)
print(num_factor % (10**9 + 7))
|
s539456144 | p03828 | u627600101 | 1586818932 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 340 | mod=10**9+7
N=int(input())
M=1
y=[1 for k in range(N)]
for k in range(2,N+1):
for j in range(2,k+1):
if k=1:
break
if k%j ==0:
count=0
while k%j==0:
k=k//j
count+=1
y[j-1]+=count
ans=1
for k in range(len(y)):
ans=ans*y[k]%mod
print(ans) |
s476302416 | p03828 | u842964692 | 1586729831 | Python | Python (3.4.3) | py | Runtime Error | 556 | 3692 | 589 | import math
from functools import reduce
N=int(input())
MOD=10**9+7
def all_multiple(a):
return reduce(lambda a,b:a*b,a)
def is_prime(n):
if n==1: return False
for k in range(2,int(math.sqrt(n))+1):
if n%k==0:
return False
return True
A=[1]*(N+1)#indexと割られる数を合わせる
ans=1
for N_t in range(2,N+1):
for num in range(1,N_t+1):
if is_prime(num):
cnt=0
while N_t%num==0:
N_t=N_t//num
cnt+=1
A[num]+=cnt
print(all_multiple_mod(A,MOD)%MOD)
|
s427020918 | p03828 | u896741788 | 1586382042 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 285 | mod=10**9+7
import math
n=int(input())
ans=1
l=[0]*n
for ii in range(n,2,-1):
i=ii
for j in range(2,int(math.sqrt(i))+1):
if i%j==0:
cnt=0
while i%j==0:
snt+=1;i//=j
l[i-1]+=cnt
if i!=1:
l[i-1]+=1
for i in l:
ans+=(i+1)
ans%=mod
print(ans)
|
s912483073 | p03828 | u896741788 | 1586382020 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 285 | mod=10***9+7
import math
n=int(input())
ans=1
l=[0]*n
for ii in range(n,2,-1):
i=ii
for j in range(2,int(math.sqrt(i))+1):
if i%j==0:
cnt=0
while i%j==0:
snt+=1;i//=j
l[i-1]+=cnt
if i!=1:
l[i-1]+=1
for i in l:
ans+=(i+1)
ans%=mod
print(ans) |
s322104699 | p03828 | u123745130 | 1586294569 | Python | Python (3.4.3) | py | Runtime Error | 73 | 3880 | 108 | k=int(input())
def kai(n):
if n==1: return 1
else : return n*kai(n-1) % (10**9+1)
print(kai(k)) |
s849193861 | p03828 | u931173291 | 1586291883 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 188 | n=int(input())
import math
mod=10**9+7
ans = math.factorial(n)
x=0
k = ans
for i in range(1,int(k**0.5)+1):
if k%i==0:
x+=1
if i!=n//i:
x+=1
print(x%mod)
|
s453518633 | p03828 | u291628833 | 1586025103 | Python | PyPy3 (2.4.0) | py | Runtime Error | 171 | 38640 | 367 | n = int(input())
def divisors(n):
# 約数
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
ans = 1
MOD = 10**9+7
for i in range(1,n+1):
ans = ans*i
k = divisors(ans)
print(len(k)%MOD)
|
s694732534 | p03828 | u395816772 | 1585787341 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 392 | import math
def get_prime(n):
if n<= 1:
return[]
prime = [2]
limit = int(math.sqrt(n))
data = [i + 1 for i in range(2,n,2)]
while limit > data[0]:
prime.append(data[0])
data = [j for j in data if j % data[0] != 0]
return prime + data
n = int(input())
ans = 1
a = 1
for i in range(1,n+1):
a *= i
ans = len(get_prime(a))
print(ans) |
s919639841 | p03828 | u896726004 | 1585258905 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 247 | N = int(input())
mod = 10**9+7
s = [0] * (n+1)
for i in range(2, n+1):
p = 2
while i>1:
while i%p==0:
i //= p
s[p] += 1
p += 1
print(s)
ans = 1
for i in s:
ans *= i+1
ans %= mod
print(ans) |
s002918193 | p03828 | u797550216 | 1584840155 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 656 | for i in range(1, n+1):
while i % 2 == 0:
if not 2 in divisor_dic:
divisor_dic[2] = 1
else:
divisor_dic[2] += 1
i //= 2
f = 3
while f*f <= i:
if i % f ==0:
if not f in divisor_dic:
divisor_dic[f] = 1
else:
divisor_dic[f] += 1
i //= f
else:
f += 2
if i != 1:
if not i in divisor_dic:
divisor_dic[i] = 1
else:
divisor_dic[i] += 1
c = 1
for v in divisor_dic.values():
c *= (v+1)
c %= 10**9+7
print(c) |
s513044131 | p03828 | u000123984 | 1584140302 | Python | Python (3.4.3) | py | Runtime Error | 74 | 3872 | 259 | def factorial(x):
if x == 1: return 1
else: return x*factorial(x-1)
n = int(input())
n_bikkuri = factorial(n)
total = 1
for i in range(2, n_bikkuri+1):
n_b = n_bikkuri
while(n_b % i == 0):
total += 1
n_b /= i
print(total % int(1e9+7)) |
s161343479 | p03828 | u000123984 | 1584140205 | Python | Python (3.4.3) | py | Runtime Error | 73 | 3880 | 258 | def factorial(x):
if x == 1: return 1
else: return x*factorial(x-1)
n = int(input())
n_bikkuri = factorial(n)
total = 1
for i in range(2, n_bikkuri+1):
n_b = n_bikkuri
while(not n_b % i):
total += 1
n_b /= i
print(total % int(1e9+7)) |
s497428718 | p03828 | u000123984 | 1584140085 | Python | Python (3.4.3) | py | Runtime Error | 73 | 3880 | 255 | def factorial(x):
if x == 1: return 1
else: return x*factorial(x-1)
n = int(input())
n_bikkuri = factorial(n)
total = 1
for i in range(2, n_bikkuri+1):
n_b = n_bikkuri
while(not n_b % i):
total += 1
n_b /= i
print(total % (1e9+7)) |
s472664910 | p03828 | u000123984 | 1584140019 | Python | Python (3.4.3) | py | Runtime Error | 70 | 3880 | 229 | def factorial(x):
if x == 1: return 1
else: return x*factorial(x-1)
n = int(input())
n_bikkuri = factorial(n)
total = 1
for i in range(2, n_bikkuri+1):
n_b = n_bikkuri
while(not n_b % i):
total += 1
n_b /= i |
s639767588 | p03828 | u000123984 | 1584139974 | Python | Python (3.4.3) | py | Runtime Error | 72 | 3880 | 249 | def factorial(x):
if x == 1: return 1
else: return x*factorial(x-1)
n = int(input())
n_bikkuri = factorial(n)
total = 1
for i in range(2, n+1):
n_b = n_bikkuri
while(not n_b % i):
total += 1
n_b /= i
print(total % (10e9 + 7)) |
s951988331 | p03828 | u000123984 | 1584139921 | Python | Python (3.4.3) | py | Runtime Error | 73 | 3880 | 232 | def factorial(x):
if x == 1: return 1
else: return x*factorial(x-1)
n = int(input())
n_bikkuri = factorial(n)
total = 1
for i in range(2, n+1):
n_b = n_bikkuri
while(not n_b % i):
total += 1
n_b /= i
print(total) |
s944740557 | p03828 | u702018889 | 1583632398 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 182 | n,f,ans=int(input()),1,0
for p in range(1,n+1):
f*=p
for i in range(1,int(f**0.5)+1):
if f%i==0:
ans+=1
if i!=f//i:
ans+=1
print(ans%1000000007) |
s024650526 | p03828 | u263824932 | 1583467306 | Python | Python (3.4.3) | py | Runtime Error | 32 | 3064 | 486 | N=int(input())
b=1
for a in range(1,N+1):
b*=a
numbers=[2]
for c in range(3,N+1):
count=0
for d in numbers:
if not c%d==0:
count+=1
else:
pass
if count==len(numbers):
numbers.append(c)
else:
pass
answers=[]
while b>1:
for e in numbers:
kazu=0
while b%e==0:
b=b/e
kazu+=1
answers.append(kazu)
kotae=1
for f in answers:
kotae*=(f+1)
print(kotae%(10**9+7))
|
s065223260 | p03828 | u263824932 | 1583467250 | Python | PyPy3 (2.4.0) | py | Runtime Error | 189 | 40304 | 476 | N=int(input())
b=1
for a in range(1,N+1):
b*=a
numbers=[2]
for c in range(3,N+1):
count=0
for d in numbers:
if not c%d==0:
count+=1
else:
pass
if count==len(numbers):
numbers.append(c)
else:
pass
answers=[]
while b>1:
for e in numbers:
kazu=0
while b%e==0:
b=b/e
kazu+=1
answers.append(kazu)
kotae=1
for f in answers:
kotae*=(f+1)
print(kotae)
|
s804257445 | p03828 | u263824932 | 1583467214 | Python | Python (3.4.3) | py | Runtime Error | 32 | 3064 | 476 | N=int(input())
b=1
for a in range(1,N+1):
b*=a
numbers=[2]
for c in range(3,N+1):
count=0
for d in numbers:
if not c%d==0:
count+=1
else:
pass
if count==len(numbers):
numbers.append(c)
else:
pass
answers=[]
while b>1:
for e in numbers:
kazu=0
while b%e==0:
b=b/e
kazu+=1
answers.append(kazu)
kotae=1
for f in answers:
kotae*=(f+1)
print(kotae)
|
s264603831 | p03828 | u863442865 | 1582581264 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 252 | n = int(input())
for i in range(1, n+1):
num = 2
while i != 1:
if i % num==0:
i //= num
l.append(num)
else:
num += 1
ans = 1
for i in set(l):
ans *= (l.count(i) + 1) % (10**9+7)
print(ans) |
s622380561 | p03828 | u408375121 | 1582155129 | Python | Python (3.4.3) | py | Runtime Error | 22 | 3188 | 530 | def prime(p):
if p == 2:
return True
else:
flg = False
count = 0
for i in range(1, int(p ** 0.5)):
if p % i == 0:
count += 1
if count == 1:
flg = True
return flg
N = int(input())
if N == 1:
print(1)
else:
p_list = []
for j in range(2, N + 1):
if prime(j):
p_list.append(j)
l = []
for p in p_list:
k = 1
add = 0
while N // (p ** k):
add += N // (p ** k)
k += 1
l.append(add + 1)
for r in l:
ans *= r % (10 ** 9 + 7)
print(ans)
|
s553426920 | p03828 | u408375121 | 1582154771 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 531 | def prime(p):
if p == 2:
return True
else:
count = 0
for i in range(1, int(p ** 0.5), 2):
if p % i == 0:
count += 1
if count == 1:
return True
else:
return False
N = int(input())
if N == 1:
print(1)
else:
p_list = []
for j in range(2, N + 1):
if prime(j):
p_list.append(j)
l = []
for p in p_list:
k = 1
add = 0
while N // (p ** k):
add += N // (p ** k)
k += 1
l.append(add + 1)
for r in l:
ans *= r % (10 ** 9 + 7)
print(ans) |
s975816993 | p03828 | u552290152 | 1582147646 | Python | PyPy3 (2.4.0) | py | Runtime Error | 165 | 38384 | 556 | import math
def factorize(n):
fct = [] # prime factor
b, e = 2, 0 # base, exponent
while b * b <= n:
while n % b == 0:
n = n // b
e = e + 1
if e > 0:
fct.append([b, e])
b, e = b + 1, 0
if n > 1:
fct.append([n, 1])
return fct
n = int(input())
mod = 10 ** 9 + 7
l = [0] * (n + 1)
for i in ranfge(1, n + 1):
soi = factorize(i)
for j in range(len(soi)):
l[soi[j][0]] += soi[j][1]
ans = 1
for i in range(1, n + 1):
ans = ans * (l[i] + 1) % mod
print(ans)
|
s507484089 | p03828 | u928784113 | 1582004023 | Python | Python (3.4.3) | py | Runtime Error | 167 | 14028 | 2060 | import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush,heapify
from fractions import gcd
from copy import deepcopy
import math
import queue
import numpy as np
#import sympy as syp(素因数分解とか)
Mod = 1000000007
import sys
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
def sieve_of_eratosthenes(n):
if not isinstance(n,int):
raise TypeError("n is not int")
if n<2:
raise ValueError("n is not effective")
prime = [1]*(n+1)
for i in range(2,int(math.sqrt(n))+1):
if prime[i] == 1:
for j in range(2*i,n+1):
if j%i == 0:
prime[j] = 0
res = []
for i in range(2,n+1):
if prime[i] == 1:
res.append(i)
return res
def factorial(i):
if i == 1:
return 1
else:
return i*factorial(i-1)
class UnionFind:
def __init__(self,n):
self.parent = [i for i in range(n+1)]
self.rank = [0 for i in range(n+1)]
def findroot(self,x):
if x == self.parent[x]:
return x
else:
y = self.parent[x]
y = self.findroot(self.parent[x])
return y
def union(self,x,y):
px = self.findroot(x)
py = self.findroot(y)
if px < py:
self.parent[py] = px
else:
self.parent[px] = py
def same_group_or_no(self,x,y):
return self.findroot(x) == self.findroot(y)
def main(): #startline--------------------------------------------
n = int(input())
p = sieve_of_eratosthenes(n)
ansdict = defaultdict(int)
for i in range(1,n+1):
for j in p:
subans = 0
while i % j == 0:
ansdict[j] += 1
i //= j
ans = 1
for i in ansdict.values():
ans *= i+1
ans %= Mod
print(ans)
if __name__ == "__main__":
main()
#endline===============================================
|
s522036344 | p03828 | u264681142 | 1581725229 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 233 | N = int(input())
def make_div(n):
div = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
div.append(i)
elif i != n // i:
div.appned(n//i)
div.sort()
return div
print(len(make_div(N)) % 1000000007)
|
s090010554 | p03828 | u088552457 | 1580754555 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 500 | n = int(input())
import math
f = math.factorial(n)
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f*f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
return divisors
d = make_divisors(f)
print(len(d)) |
s782510265 | p03828 | u113971909 | 1580615361 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 503 | n=int(input())
def factorization(n):
primend = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
primend.append([i,cnt])
if temp!=1:
primend.append([temp,1])
if primen==[]:
primend.append([n,1])
return primend#primen,degree
pn=[0]*(n+1)
for i in range(1,n+1):
for j in factorization(i):
pn[j[0]]+=j[1]
ans = 1
for k in range(2,n+1):
ans*=(pn[k]+1)%(10**9+7)
print(ans%(10**9+7))
|
s176264478 | p03828 | u113971909 | 1580615361 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 503 | n=int(input())
def factorization(n):
primend = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
primend.append([i,cnt])
if temp!=1:
primend.append([temp,1])
if primen==[]:
primend.append([n,1])
return primend#primen,degree
pn=[0]*(n+1)
for i in range(1,n+1):
for j in factorization(i):
pn[j[0]]+=j[1]
ans = 1
for k in range(2,n+1):
ans*=(pn[k]+1)%(10**9+7)
print(ans%(10**9+7))
|
s777988573 | p03828 | u113971909 | 1580615217 | Python | Python (3.4.3) | py | Runtime Error | 23 | 3188 | 664 | n=int(input())
def factorization(n):
primen = []
degree = []
primend = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
primen.append(i)
degree.append(cnt)
primend.append([i,cnt])
if temp!=1:
primen.append(temp)
degree.append(1)
primend.append([temp,1])
if primen==[]:
primen.append(n)
degree.append(1)
primend.append([n,1])
return primend#primen,degree
pn=[0]*(n+1)
for i in range(1,n+1):
for j in factorization(i):
pn[j[0]]+=j[1]
ans = 1
for k in range(2,n+1):
ans*=(pn[k]+1)%(10**9+7)
print(pn%(10**9+7)) |
s354733457 | p03828 | u488934106 | 1580403994 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 207 | import math
N = int(input())
ans = 0
mod = 10**9+7
kai = math.factorial(N)
i = 2
while kai == 0:
if kai % i == 0:
#for i in range(1,kai+1):
# if kai % i == 0:
# ans += 1
print(ans % mod)
|
s932604712 | p03828 | u190086340 | 1579377067 | Python | PyPy3 (2.4.0) | py | Runtime Error | 180 | 39024 | 630 | import math
import collections
import functools
def solve():
N = int(input())
P = 10**9+7
fn = math.factorial(N)
c = collections.Counter(prime_factorize(fn))
ans = functools.reduce(lambda x, y: x * y, map(lambda x: x + 1, c.values()))
return ans % P
def prime_factorize(n):
res = []
while n % 2 == 0:
res.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
res.append(f)
n //= f
else:
f += 2
if n != 1:
res.append(n)
return res
if __name__ == '__main__':
res = solve()
print(res)
|
s560849824 | p03828 | u475179653 | 1578354269 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 899 | import math
n=int(input())
l={}
# A function to print all prime factors of
# a given number n
def primeFactors(n):
# Print the number of two's that divide n
while n % 2 == 0:
if('2' in l):
l['2']+=1
else:
l['2']=1
n = n / 2
# n must be odd at this point
# so a skip of 2 ( i = i + 2) can be used
for i in range(3,int(math.sqrt(n))+1,2):
# while i divides n , print i ad divide n
while n % i== 0:
if(i in l):
l[i]+=1
else:
l[i]=1
n = n / i
# Condition if n is a prime
# number greater than 2
if n > 2:
if(n in l):
l[n]+=1
else:
l[n]=1
primeFactors(math.factorial(n))
#print(l)
k=1
for i in l:
k=k*(l[i]+1)
print(k)
|
s195024270 | p03828 | u506858457 | 1577983372 | Python | Python (3.4.3) | py | Runtime Error | 48 | 3788 | 679 | def memoize(f): #メモ化関数
table = {}
def func(*args):
if not args in table:
table[args] = func(*args)
return table[args]
return func
@memoize
def fac(x):
if x==0:
return 1
else:
return x*fac(x-1)
N=int(input())
def divisor(n): #nの約数を全て求める
i = 1
while i * i < n:
if n%i == 0:
table.append(i)
i += 1
table = list(set(table))
return table
def make_divisors(n):
cnt=0
i=1
while i * i < n:
if n%i == 0:
cnt+=2
i += 1
if i*i==n:
cnt+=1
return cnt
ans1=fac(N)
ans2=make_divisors(ans1)%(10**9+7)
print(ans2) |
s636032145 | p03828 | u506858457 | 1577981936 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 125 | @memoize
def fac(x):
if x==0:
return 1
else:
return x*fac(x-1)
N=int(input())
ans=fac(N)%(10**9+7)
print(ans)
|
s566550777 | p03828 | u721166818 | 1577393745 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 361 | n = int(input())
import math
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
# n = 10
fact = math.factorial(n)
print(len(make_divisors(fact)) // (10 ** 9 + 7))
|
s106101870 | p03828 | u721166818 | 1577393709 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 355 | N = int(input())
import math
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
# n = 10
fact = math.factorial(n)
print(len(make_divisors(fact)) // (10 ** 9 + 7)) |
s960323024 | p03828 | u721166818 | 1577393532 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 379 | import sys
args = sys.argv
n = args[0]
import math
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
# n = 10
fact = math.factorial(n)
print(len(make_divisors(fact)) // (10 ** 9 + 7))
|
s506681106 | p03828 | u875600867 | 1577054939 | Python | PyPy3 (2.4.0) | py | Runtime Error | 163 | 38512 | 699 | N = int(input())
# Nの階乗を計算する
factorial = [1] * (N+1)
mod = 10 ** 9 + 7
for i in range(1, N+1):
factorial[i] = i * factorial[i - 1]
#print(factorial)
n = factorial[-1]
#print(n)
"""nを素因数分解"""
"""2以上の整数n => [[素因数, 指数], ...]の2次元リスト"""
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr.append([n, 1])
#print(arr)
# 素因数の出現回数をカウントする
ans = 0
for i,j in arr:
#print(i**j)
ans += i**j
print(ans) |
s541229997 | p03828 | u305366205 | 1577046295 | Python | Python (3.4.3) | py | Runtime Error | 35 | 3064 | 547 | import math
def sieve_of_eratosthenes(n):
max_prime = int(math.sqrt(n))
targets = [i for i in range(2, n + 1)]
primes = []
while targets[0] <= max_prime:
p = targets[0]
primes.append(p)
targets = [i for i in targets if i % p != 0]
primes.extend(targets)
return primes
n = int(input())
p = sieve_of_eratosthenes(n)
ans = 1
for i in p:
cnt = 0
for j in range(2, n + 1):
while j % i == 0:
j //= i
cnt += 1
ans *= cnt + 1
ans %= 10 ** 9 + 7
print(ans) |
s695176885 | p03828 | u141574039 | 1576616041 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 194 | P=[0]*1000
x=1
N=int(input())
for i in range(2,N+1):
A=PF(i)
for j in range(len(A)):
P[A[j][0]]=P[A[j][0]]+A[j][1]
P.remove(0)
for i in range(len(P)):
x=(x*(P[i]+1))%(10**9+7)
print(x) |
s768925912 | p03828 | u349091349 | 1576531279 | Python | PyPy3 (2.4.0) | py | Runtime Error | 173 | 38640 | 1 | g |
s236149630 | p03828 | u778720350 | 1576446977 | Python | Python (3.4.3) | py | Runtime Error | 73 | 3868 | 145 | def count_divisor(n):
if n == 1:
return 1
return (count_divisor(n - 1) - 1) * 2 + 1 + 1
n = int(input())
print(count_divisor(n)) |
s480079083 | p03828 | u989345508 | 1576335407 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 675 | import math
n=int(input())
def get_sieve_of_eratosthenes(n):
if not isinstance(n, int):
raise TypeError('n is int type.')
if n < 2:
raise ValueError('n is more than 2')
prime = []
limit = math.sqrt(n)
data = [i + 1 for i in range(1, n)]
while True:
p = data[0]
if limit <= p:
return prime + data
prime.append(p)
data = [e for e in data if e % p != 0]
e=get_sieve_of_eratosthenes(n)
l=len(e)
co=1
for i in range(l):
k=e[i]
co_sub=1
l_sub=int(math.log(n,k))
for j in range(1,l_sub+1):
co_sub+=n//(k**j)
co*=co_sub
co%=(10**9+7)
#print(co_sub)
print(co)
|
s843644033 | p03828 | u987164499 | 1575150036 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 452 | def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
li = prime_factorize(total)
lin = []
for key, value in groupby(li):
lin.append(len(list(value)))
point = 1
for i in lin:
point *= i+1
point %= 10**9+7
print(point) |
s788581952 | p03828 | u590647174 | 1575054492 | Python | Python (3.4.3) | py | Runtime Error | 72 | 3888 | 143 | def factori(N):
if N == 1:
return 1
return factori(N-1)*N
def factor(Num):
return Num%(10**9+7)
N = int(input())
factor(factori(N)) |
s922106715 | p03828 | u672494157 | 1574719123 | Python | PyPy3 (2.4.0) | py | Runtime Error | 178 | 38512 | 1186 | import sys
from functools import reduce
import copy
import math
from pprint import pprint
import collections
import bisect
import itertools
sys.setrecursionlimit(4100000)
def inputs(num_of_input):
ins = [input() for i in range(num_of_input)]
return ins
def int_inputs(num_of_input):
ins = [int(input()) for i in range(num_of_input)]
return ins
def solve(inputs):
N = int(inputs[0])
SSSS = 1000000007
count = collections.Counter()
for i in range(1, N+1):
target = i
is_end = False
while not is_end:
is_end = True
for j in range(2, int(math.sqrt(target)+1)):
if target % j == 0:
count[j] += 1
target = target // j
is_end = False
break
if is_end and target != 1:
count[target] += 1
c = 1
for k, v in count.items():
c *= (v + 1)
c = c % SSSS
return c
def string_to_int(string):
return list(map(lambda x: int(x), string.split()))
if __name__ == "__main__":
N = int(input())
ret = solve(inputs(N-1))
for r in ret:
print(r)
|
s072116574 | p03828 | u595716769 | 1573025020 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 518 | import math
n = int(input())
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr.append([n, 1])
return arr
L = factorization(math.factorial(n))
out = 1
for i in range(len(L)):
out = out * (L[i][1] + 1)
out = out % (pow(10,9)+7)
print(out)
|
s245944395 | p03828 | u595716769 | 1573024964 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 492 | import math
n = int(input())
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr.append([n, 1])
return arr
L = factorization(math.factorial(n))
out = 1
for i in range(len(L)):
out = out * (L[i][1] + 1)
print(out)
|
s230202202 | p03828 | u901582103 | 1572918088 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3064 | 453 | def prime_factrization(n):
a=[]
for i in range(2,int(n**0.5)+1):
while n%i==0:
n//=i
a.append(i)
if a==[]:
a.append(n)
else:
if n!=1:
a.append(n)
return a
n=int(input())
if n==1:
print(1%(10**9+7))
else:
L=[]
for i in range(2,n+1):
L+=prime_factrization(i)
LC=Counter(L)
r=1
for v in LC.values():
r*=(v+1)
print(r%(10**9+7)) |
s402801546 | p03828 | u733321071 | 1572214455 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 398 | num = int(input())
div_sum = defaultdict(int)
p = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31]
for j in range(1, num + 1):
div_num = defaultdict(int)
for i in p:
n = j
while n % i == 0:
div_num[i] += 1
n //= i
for k, v in div_num.items():
div_sum[k] += v
ans = 1
for k, v in div_sum.items():
ans *= (v + 1)
print(ans % (10**9 + 7))
|
s732114109 | p03828 | u654558363 | 1571364441 | Python | Python (3.4.3) | py | Runtime Error | 23 | 3572 | 398 | import collections
import itertools
import functools
import math
s = set([])
if __name__ == "__main__":
n = math.factorial(int(input()))
prims = (n + 1) * [0]
p = 2
while n >= p*p:
if n % p == 0:
prims[p] += 1
n = n // p
else:
p += 1
prims[n] += 1
print(functools.reduce(lambda x, y: x * (y + 1), prims, 1) % (10**9 + 7)) |
s407674566 | p03828 | u654558363 | 1571364405 | Python | Python (3.4.3) | py | Runtime Error | 23 | 3700 | 396 | import collections
import itertools
import functools
import math
s = set([])
if __name__ == "__main__":
n = math.factorial(int(input()))
prims = (n + 1) * [0]
p = 2
while n >= p*p:
if n % p == 0:
prims[p] += 1
n = n // p
else:
p += 1
prims[n] += 1
print(functools.reduce(lambda x, y: x * (y + 1), prims, 1) % 10**9 + 7) |
s374582158 | p03828 | u654558363 | 1571364353 | Python | Python (3.4.3) | py | Runtime Error | 23 | 3572 | 384 | import collections
import itertools
import functools
import math
s = set([])
if __name__ == "__main__":
n = math.factorial(int(input()))
prims = (n + 1) * [0]
p = 2
while n >= p*p:
if n % p == 0:
prims[p] += 1
n = n // p
else:
p += 1
prims[n] += 1
print(functools.reduce(lambda x, y: x * (y + 1), prims, 1)) |
s018960271 | p03828 | u968846084 | 1571300987 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 577 | n=int(input())
import numpy as np
def seachPrimeNum(N):
max = int(np.sqrt(N))
seachList = [i for i in range(2,N+1)]
primeNum = []
while seachList[0] <= max:
primeNum.append(seachList[0])
tmp = seachList[0]
seachList = [i for i in seachList if i % tmp != 0]
primeNum.extend(seachList)
return primeNum
if n=1:
print("1")
else:
f=len(seachPrimeNum(n))
g=seachPrimeNum(n)
c=1
for j in range(f):
e=g[j]
a=0
b=n
h=0
while b>=e:
b=b//e
h=h+b
a=a+1
c=c*(h+1)
print(c%(10**9+7)) |
s639842291 | p03828 | u968846084 | 1571300871 | Python | Python (3.4.3) | py | Runtime Error | 153 | 12780 | 520 | n=int(input())
import numpy as np
def seachPrimeNum(N):
max = int(np.sqrt(N))
seachList = [i for i in range(2,N+1)]
primeNum = []
while seachList[0] <= max:
primeNum.append(seachList[0])
tmp = seachList[0]
seachList = [i for i in seachList if i % tmp != 0]
primeNum.extend(seachList)
return primeNum
f=len(seachPrimeNum(n))
g=seachPrimeNum(n)
c=1
for j in range(f):
e=g[j]
a=0
b=n
h=0
while b>=e:
b=b//e
h=h+b
a=a+1
c=c*(h+1)
print(c%(10**9+7)) |
s787765768 | p03828 | u153902122 | 1570984151 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 633 | def make_prime(n):
prime = []
temp = n
for i in range(2, int(n**0.5) + 1):
if temp % i == 0:
cnt = 0
while temp % i == 0:
cnt += 1
temp //= i
prime.append([i, cnt])
if temp!=1:
prime.append([temp, 1])
if prime==[]:
prime.append([n, 1])
return prime
def factional_for(n):
result = 1
for i in range(n, 0, -1):
result *= i
return result
num = int(input())
w=10**9+7
s=1
prime_num_list = make_prime(factional_for(num))
for i in range(len(prime_num_list)):
s *= (prime_num_list[i][1]+1)%w
print(s) |
s113658862 | p03828 | u153902122 | 1570983903 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 633 | def make_prime(n):
prime = []
temp = n
for i in range(2, int(n**0.5) + 1):
if temp % i == 0:
cnt = 0
while temp % i == 0:
cnt += 1
temp //= i
prime.append([i, cnt])
if temp!=1:
prime.append([temp, 1])
if prime==[]:
prime.append([n, 1])
return prime
def factional_for(n):
result = 1
for i in range(n, 0, -1):
result *= i
return result
num = int(input())
w=10**9+7
s=0
prime_num_list = make_prime(factional_for(num))
for i in range(len(prime_num_list)):
s += (prime_num_list[i][1]+1)%w
print(s) |
s628202792 | p03828 | u153902122 | 1570983826 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 642 | def make_prime(n):
prime = []
temp = n
for i in range(2, int(n**0.5) + 1):
if temp % i == 0:
cnt = 0
while temp % i == 0:
cnt += 1
temp //= i
prime.append([i, cnt])
if temp!=1:
prime.append([temp, 1])
if prime==[]:
prime.append([n, 1])
return prime
def factional_for(n):
result = 1
for i in range(n, 0, -1):
result *= i
return result
num = int(input())
s=0
prime_num_list = make_prime(factional_for(num))
print(prime_num_list)
for i in range(len(prime_num_list)):
s += prime_num_list[i][1]+1
print(s)
|
s211401735 | p03828 | u153902122 | 1570945594 | Python | Python (3.4.3) | py | Runtime Error | 75 | 3884 | 384 | def make_divisors(n):
divisors = []
for i in range(1,int(n**0.5)+1):
if n % i ==0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
return divisors
def make_factorial(n):
if n <= 1:
return 1
else:
return n*make_factorial(n-1)
num = int(input())
print(len(make_divisors(make_factorial(num)))) |
s053327755 | p03828 | u630786674 | 1570662222 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 108 | import math
import sympy
n = int(input())
nk = math.factorial(n)
ans = sympy.divisor_count(nk)
print(ans) |
s018709379 | p03828 | u223904637 | 1570594735 | Python | Python (3.4.3) | py | Runtime Error | 24 | 3188 | 652 | n=int(input())
if n==1:
print(1)
exit()
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr.append([n, 1])
return arr
so=[]
ka=[]
for i in range(2,n+1):
a=factorization(i)
for j in a:
if not j[0] in so:
so.append(j[0])
ka.append(j[1])
else:
ka[so.index(j[0])]+=j[1]
ans=1
for i in ka:
ans*=(ka+1)
print(ans) |
s676939252 | p03828 | u322354465 | 1570517713 | Python | Python (3.4.3) | py | Runtime Error | 27 | 3572 | 508 | import collections
import functools
DIVISOR = 10 ** 9 + 7
n = int(input())
prime_factor = collections.defaultdict(int)
for i in range(1, n + 1):
tmp = i
for j in range(2, int(n ** 0.5) + 1):
while tmp % j == 0:
prime_factor[j] += 1
tmp //= j
if tmp > 1:
prime_factor[tmp] += 1
# print(prime_factor)
prime_factor_num = [prime_factor[key] + 1 for key in prime_factor]
print((functools.reduce(lambda x, y: (x % DIVISOR) * y, prime_factor_num)) % DIVISOR) |
s219922490 | p03828 | u468811760 | 1570315304 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 509 | #include<iostream>
#include<map>
using namespace std;
const int mo=1e9+7;
main()
{
cin.tie(0);
ios_base::sync_with_stdio(0);
int n;
cin>>n;
map<int,int>m;
for(int i=2;i<=n;i++)
{
int x=i;
for(int j=2;j*j<=x;j++)
{
while(x%j==0)
{
m[j]++;
x/=j;
}
}
if(x!=1)m[x]++;
}
long long ans=1;
for(auto it:m)ans=(ans*(it.second+1)%mo);
cout<<ans;
return 0;
} |
s971845099 | p03828 | u699699071 | 1569455072 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 562 | import math
from sympy import sieve
N=int(input())
num = math.factorial(N)
primeNum=[]
for i in range(2,1000):
flag=False
for j in range(2,i):
if i%j==0:
flag=True
break
if flag==False:
primeNum.append(i)
# primeNum = [i for i in sieve.primerange(1,1000)]
# print(primeNum)
resulNum=[0]*len(primeNum)
result=1
j=0
flag=False
for i in primeNum:
while num % i == 0 :
num = num // i
resulNum[j]+=1
flag=True
if flag==True:
result*=(resulNum[j]+1)
result %= 10**9+7
j+=1
flag=False
print(result)
|
s307647365 | p03828 | u699699071 | 1569453846 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 361 | import math
from sympy import sieve
N=int(input())
num = math.factorial(N)
primeNum = [i for i in sieve.primerange(1,10000000)]
# print(primeNum)
resulNum=[0]*len(primeNum)
result=1
j=0
for i in primeNum:
while num % i == 0 :
num = num // i
resulNum[j]+=1
j+=1
for i in resulNum:
if i>0:
result*=(i+1)
result %= 10**9+7
print(result)
|
s531597450 | p03828 | u141610915 | 1568230644 | Python | PyPy3 (2.4.0) | py | Runtime Error | 169 | 38512 | 189 | from math import sqrt
N = int(input())
mod = 10 ** 9 + 7
divs = [0] * (N + 1)
for i in range(1, N + 1):
for j in range(1, sqrt(i)):
if i % j == 0:
divs[j] += 1
print(sum(divs)) |
s417934896 | p03828 | u948783892 | 1567990032 | Python | Python (3.4.3) | py | Runtime Error | 2108 | 5488 | 1453 | def kjsoinscount(n):
res_ls=[]
for i in range(n): #nの階乗
if i+1 > 1:
N=i+1
for j in range(i+1): #階乗の各要素について素因数分解
if j+1>1:
while N%(j+1)==0:
res_ls.append(j+1)
N=N/(j+1)
return res_ls+[1]
def yakspattern(soins_ls):
import itertools
from operator import mul
from functools import reduce
yaks_ls={}
for i in range(len(soins_ls)):
if i>0:
comb_tup=itertools.combinations(soins_ls,i+1)
for j in comb_tup:
#print(j)
a=reduce(mul,j)
a=str(a)
if a not in yaks_ls:
#print(j)
yaks_ls[a]="ok"
for i in soins_ls:
q=str(i)
yaks_ls[q]="ok"
yaks_ls
return yaks_ls.keys
def kjyakscount(n):
import itertools
from operator import mul
from functools import reduce
yaks_ls=[]
kj_ls=[i+1 for i in range(n)]
for i in range(n):
if i>0:
comb_tup=itertools.combinations(kj_ls,i+1)
for j in comb_tup:
#print(j)
yaks_ls.append(reduce(mul,j))
#print(set(yaks_ls))
return(set(kj_ls+yaks_ls))
#return(yaks_ls.extend(kj_ls))
n=int(input())
kj=1
for i in range(n):
kj=kj*(i+1)
print(len(yakspattern(kjsoinscount(n)))) |
s851692654 | p03828 | u228223940 | 1567209791 | Python | Python (3.4.3) | py | Runtime Error | 28 | 3064 | 379 | n = int(input())
mod = 10**9+7
sosu = [1] * 100
for j in range(2,n+1):
tmp = j
while tmp > 1:
for i in range(2,n+1):
if tmp % i == 0:
sosu[i] += 1
tmp = tmp // i
#print(sosu)
sosu.sort(reverse=True)
ans = 1
for i in range(len(sosu)):
if sosu[i] > 0:
ans = ans*sosu[i] % mod
print(ans) |
s606871900 | p03828 | u625963200 | 1566583057 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 223 | import math
n=int(input())
n=math.factorial(n)
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
print(len(divisors)%(10**9+7)) |
s149177849 | p03828 | u979418645 | 1566532173 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 342 | import math
N=int(input())
import math
factN=math.factorial(N)
count=0
factor = []
tmp = int(math.sqrt(factN)) + 1
for num in range(2,tmp):
while factN % num == 0:
factN //= num
factor.append(num)
factor_set=list(set(factor))
p=1
for x in factor_set:
p*=(factor.count(x)+1)
print(factor)
print(p) |
s465303989 | p03828 | u027929618 | 1566354724 | Python | Python (3.4.3) | py | Runtime Error | 26 | 3064 | 233 | N = int(input())
MOD = 10 ** 9 + 7
x = 1
for i in range(2, N + 1):
x *= i
count = 1
for i in range(2, N + 1):
if x % i != 0:
continue
count = 1
while x % i == 0:
x //= i
count += 1
ans *= count
print(ans % MOD) |
s751308273 | p03828 | u463655976 | 1564101332 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 312 | sosu = []
N = int(input())
g = 10 ** 9 + 7
def add(a, b):
return (a + b) % g
d = []
DP = [0] * (max(2,N)+1)
DP[1] = 0
DP[2] = 1
for i in range(2, N+1):
for j in (x for x in d if j * j <= N):
if i % j == 0:
DP[i] = DP[j] + DP[i//j]
break
else:
d.append(i)
DP[i] = 1
print(DP[N]+1)
|
s008535339 | p03828 | u450904670 | 1563083394 | Python | PyPy3 (2.4.0) | py | Runtime Error | 172 | 38256 | 442 | import math
import sys
def make_divisors(n):
divisors = []
hoge = 0
if(n**0.5 > sys.maxint - 1):
hoge = sys.maxint - 1
else:
hoge = int(n**0.5)
for i in range(1, hoge+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
n = int(input())
print(make_divisors(math.factorial(n)) % (pow(10,9) + 7)) |
s297763292 | p03828 | u450904670 | 1563082253 | Python | PyPy3 (2.4.0) | py | Runtime Error | 171 | 38384 | 280 | import math
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
return divisors
num = int(input())
print(make_divisors(math.factorial(num)) % (pow(10,9) + 7)) |
s971939648 | p03828 | u450904670 | 1563082157 | Python | PyPy3 (2.4.0) | py | Runtime Error | 168 | 38384 | 265 | import math
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
return divisors
num = int(input())
print(make_divisors(math.factorial(num)) % (pow(10,9) + 7)) |
s938899379 | p03828 | u450904670 | 1563082114 | Python | PyPy3 (2.4.0) | py | Runtime Error | 168 | 38640 | 261 | import math
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
return divisors
n = int(input())
print(make_divisors(math.factorial(n)) % (pow(10,9) + 7)) |
s046506968 | p03828 | u450904670 | 1563082026 | Python | PyPy3 (2.4.0) | py | Runtime Error | 167 | 38640 | 329 | import math
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
n = int(input())
print(make_divisors(math.factorial(n)) % (pow(10,9) + 7)) |
s138625615 | p03828 | u450904670 | 1563081249 | Python | PyPy3 (2.4.0) | py | Runtime Error | 168 | 38640 | 1022 | import math
def make_prime_list_2(num):
if num < 2:
return []
prime_list = [i for i in range(num + 1)]
prime_list[1] = 0
num_sqrt = math.sqrt(num)
for prime in prime_list:
if prime == 0:
continue
if prime > num_sqrt:
break
for non_prime in range(2 * prime, num, prime):
prime_list[non_prime] = 0
return [prime for prime in prime_list if prime != 0]
def search_divisor_num(num):
if num < 0:
return None
elif num == 1:
return 1
else:
num_sqrt = int(math.floor(math.sqrt(num)))
prime_list = make_prime_list_2(num_sqrt)
divisor_num = 1
for prime in prime_list:
count = 1
while num % prime == 0:
num //= prime
count += 1
divisor_num *= count
if num != 1:
divisor_num *= 2
return divisor_num
n = int(input())
print(search_divisor_num(math.factorial(n)) % (pow(10,9) + 7)) |
s969405154 | p03828 | u450904670 | 1563080687 | Python | PyPy3 (2.4.0) | py | Runtime Error | 184 | 39664 | 1061 | n = int(input())
def make_prime_list_2(num):
if num < 2:
return []
# 0のものは素数じゃないとする
prime_list = [i for i in range(num + 1)]
prime_list[1] = 0 # 1は素数ではない
num_sqrt = math.sqrt(num)
for prime in prime_list:
if prime == 0:
continue
if prime > num_sqrt:
break
for non_prime in range(2 * prime, num, prime):
prime_list[non_prime] = 0
return [prime for prime in prime_list if prime != 0]
def search_divisor_num(num):
if num < 0:
return None
elif num == 1:
return 1
else:
num_sqrt = math.floor(math.sqrt(num))
prime_list = make_prime_list_2(num_sqrt)
divisor_num = 1
for prime in prime_list:
count = 1
while num % prime == 0:
num //= prime
count += 1
divisor_num *= count
if num != 1:
divisor_num *= 2
return divisor_num
print(search_divisor_num(n) % (pow(10,9) + 7)) |
s586556176 | p03828 | u450904670 | 1563080473 | Python | PyPy3 (2.4.0) | py | Runtime Error | 175 | 38640 | 559 | n = int(input())
def search_divisor_num_1(num):
if num < 0:
return None
elif num == 1:
return 1
else:
num_sqrt = math.floor(math.sqrt(num))
prime_list = make_prime_list_2(num_sqrt)
divisor_num = 1
for prime in prime_list:
count = 1
while num % prime == 0:
num //= prime
count += 1
divisor_num *= count
if num != 1:
divisor_num *= 2
return divisor_num
print(search_divisor_num_1(n) % (pow(10,9) + 7)) |
s188290524 | p03828 | u456353530 | 1563062123 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 4897 | // .........
// .7>?7n. .(wWWVyyyVyVyyyWWAw-.
// J~::::<HyyyyyyyyyyyVyyyyyyyZZuXV<.
// .?<(((JXF:::::+KW#ZuZyyyyyyZZXZZuuuZOvvrw.?.
// ,!-vvrwD:;XaJ++jWUWSw_OuVVTV7XzXkzzvo(wrrrrrw+_i
// .>.zrrvrd>jdXvvvvrrwWOtrrrwzvvrrrwHkrrrrvrvrvrrvw+?.
// .!(rrvrvwXm0vrrwAOrtwRtttrrrrrtttttW0rrrvrvrvrvrrvro.i
// .~JrvrrvwVW0<zrwXKtltwRtttttrtrrttttX0rrrvrrvrrvrvrrrw.1
// <JrrvvvQVWS<czrwWZllOuRttttrtrrtttttXktrvrvrvrrrrZ (rr/>
// .<jZ<wrrwHWSwx-JwXKO1lOu$tttrrtrrrrttcJ0rrrrvrwXOltt< .rrw-i
// .jdvI-jCwXWSrrrvvwW0o(jwZrrOrrrrrzzvrZ>JVtrrrrrtwXOlltrrrrrI,;
// ,+XHvrvrrdHHvrvvvvZWrttrwKCw<jvuzu>?zz:.JZ=lOroJrtwSllltrvvwrl(.
// .~JZU0rvvvvUWSrrvvzzZStrrrdC1duZZZZZXwuuv<dOllwXrvvrtwklllrrrdRr->
//(_7 JrrrrrwHWXrvvzzuuStltOr Jwzzuuuuzzvvv1Izl=lZwrvrtOXOlltrrZ4vI--
// kwyvrrdpKrrvvzzzw0lllZ (ZttOtrrttttrd>~1==ldOrrrtZklltrrO(kr{>
// .kdSvvrdWSvvwwuuzdI??1{ z=====llllllw< 1z=lXOrrttXOtlrrr(Rrl(
// .0d+rrvXWXvwWXuuwOI??v .z>??????==z$~ ?z=lXOtttdZttrrvzSvw(_
// .0W(rrvXHXvwWuuwZjVTO=!???<O&x>>+I???d! ..(?79UUUVU6wkrrrrrv0vr>)
// .kW(rvvwKXvdWuXw$(z?z 1z1>>zz?1> 1zOvOtrXzuzvvrvrvlt
// .SW(rrvdWqvwHurd:.I?; ...~?<<<_<< .. _1I(wrdXZuvvrrvv01
// OWrrrrdWHvwHzwK 1v~.(ggggJ.?! (<(.JggJ.. .TdKZuzvwkvrXj
// .WDzvrdHWwwHzdH. (MHM###MkTU_ .UTWM##NMMN, ?Huuuw(WvrX(
// O>zrrwWHkwHzWW{.dY!jNWML .r_! !jMd@F k?Wo juuuIJWvvW(
// (zrzVWKdMwb.:(% .H@HNM@@N W@HNMagM. C_,kzzCdWvvfz
// 1wvXWWXHX>_> .hJHXZWHN XJWUWWHM: (Rzz1Hkvw\(-
// 1wdWvHHW<>_ ?U0zzXX= ,WVCO4y= ydzZJ 4wd
// (wf[?Wr1>(. .. .3JuO\ .SI
// (Wb zH, .__-_____- -__~__.-..~.k2 ,\
// .4 4WHeo~~~~~~~_. .~~:~<::~.dqH? !
// 4fWTe .1WW&&&&W1 .(OkP
// 4f ,n. \Y Y1 .d!.H:
// ? Wx. &_ _ 2 .dMK ?
// 4 ?a.. ~ ..JWDOq%
// (HkMNmx.... ....(&kHP,kk\.K
// ...?qHNWB:::::::::WHHH-.dK
// .J>:jz77<:(C:::::::::O_:~?7f;?3(.
// ..z>::::u-~::::~::~:::::(<:::(3::::?-
// .,C-::::::<:?x<1+-_~~:~~:(J++?!(3~<:<(J=_<..
// .? ._1.....~~(z-.._(-1+,.....-J!.._(v! ?1,
// .< ! ?1--...~?iv>___~(T+..J=_(Jv^ <.
// .= _ ?7u-((JXJ-((JJZ6+JwY!_ _ (.
// .} ?1&J-:<Z<<<:<+=_ . _. :
// / : . _d7COZW>~ (. . ..
// .: ! ( .>.~(:d (~ . !-
// ( ~ ( .z777TT .. _ . :
// : ~ <_ J<<<<<j_ ._ : { (
// . ! >_ >.....({ (_ < . (.
// - ~ >_ ,~.~..~v) < < ; .;
// . .> <..~.._Il ~ ( . >
// . .~ .>.~..~(Iz ( . (
// < -~ ,_..~..(>j . .
// { <. <..~..~(<j. .. _
// >. >..~...z:(_ _ <
// . >. .<.~..~_C(<} } .
// _ .~. .~..~..(>(:> } _
// : (~. ._..~..(<(+> > ~
// ~ <~_ ??<<!! < .
import java.util.*
fun main(args : Array<String>) {
val sc = Scanner(System.`in`)
val k = sc.nextInt()
val s = sc.nextInt()
var result = 0
for (x in 0..k) {
for (y in 0..k) {
if (0 <= s - (x + y) <= k){
result += 1
}
}
}
print(result)
}
import math
def prime(x):
p = {}
cnt = 2
Flag = True
while Flag:
last = math.ceil(x ** 0.5)
if cnt > last:
break
for i in range(cnt, last + 1):
if x % i == 0:
x //= i
p[i] = 1
cnt = i + 2
while x % i == 0:
x //= i
p[i] += 1
cnt = i + 1
break
if i == last:
Flag = False
if x != 1:
p[x] = 1
return p
N = int(input())
R = {}
MOD = 10 ** 9 + 7
for i in range(1, N + 1):
t = prime(i)
for i in t.keys():
if i not in R:
R[i] = t[i]
else:
R[i] += t[i]
ans = 1
for i in R.values():
ans = ans * (i + 1) % MOD
print(ans) |
s860725924 | p03828 | u623687794 | 1563059504 | Python | Python (3.4.3) | py | Runtime Error | 266 | 18532 | 567 | import numpy as np
n=int(input())
mod=10**9+7
def searchPrimeNum(N):
max = int(np.sqrt(N))
searchList = [i for i in range(2,N+1)]
primeNum = []
while searchList[0] <= max:
primeNum.append(searchList[0])
tmp = searchList[0]
searchList = [i for i in searchList if i % tmp != 0]
primeNum.extend(searchList)
return primeNum
l=len(searchPrimeNum(n))
plist=searchPrimeNum(n)
cnt=[0]*l
for i in range(l):
k=1
while plist[i]**k<n:
cnt[i]+=n//(plist[i]**k)
k+=1
ans=1
for i in cnt:
ans=(ans*(i+1))%mod
print(ans)
|
s279334367 | p03828 | u623687794 | 1563059379 | Python | PyPy3 (2.4.0) | py | Runtime Error | 185 | 38256 | 562 | import numpy as np
n=int(input())
mod=10**9+7
def searchPrimeNum(N):
max = int(np.sqrt(N))
searchList = [i for i in range(2,N+1)]
primeNum = []
while searchList[0] <= max:
primeNum.append(searchList[0])
tmp = searchList[0]
searchList = [i for i in searchList if i % tmp != 0]
primeNum.extend(searchList)
return primeNum
l=len(searchPrimeNum(n))
plist=searchPrimeNum(n)
cnt=[0]*l
for i in range(l):
k=1
while plist[i]**k<n:
cnt[i]+=n//(plist[i]**k)
k+=1
ans=1
for i in cnt:
ans=(ans*i)%mod
print(ans) |
s661628314 | p03828 | u474423089 | 1563043363 | Python | Python (3.4.3) | py | Runtime Error | 51 | 3188 | 766 | def power(x,y):
if x%y != 0:
return 0
else:
return 1+power(x/y,y)
def main():
n = int(input())
prime=[]
fact = {}
num_list = [i for i in range(2,n+1)]
i = 0
ans = 1
mod = 10**9+7
while i <=n**0.5:
i = num_list.pop(0)
prime.append(i)
for j in num_list:
if j%i ==0:
num_list.remove(j)
prime = prime + num_list
for i in range(1,n+1):
for j in prime:
if i <j:
break
elif j in fact.keys():
fact[j] += power(i,j)
else:
fact[j] = power(i,j)
for i in fact.values():
ans *= (i+1)
ans %= mod
print(ans)
if __name__ == '__main__':
main() |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.