input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
iN ,iX = [int(x) for x in input().split()]
aCum = [0]
for i in map(int,input().split()):aCum+=[aCum[-1]+i]
aCum = aCum[1:]
#aX = [int(x) for x in input().split()]
#aCum = [0]*iN
#aCum[0] = aX[0]
#for i in range(1,iN):
# aCum[i]=aCum[i-1]+aX[i]
def fCeil(iT,iR):
return -1 * iT // iR * -1
def fC... | iN ,iX = [int(x) for x in input().split()]
aX = [int(x) for x in input().split()]
aCum = [0]*iN
aCum[0] = aX[0]
for i in range(1,iN):
aCum[i]=aCum[i-1]+aX[i]
def fCeil(iT,iR):
return -1 * iT // iR * -1
def fCalcCost(iN,iX,aCum,iK):
iCost = (iN + iK ) * iX + 5 * aCum[-1]
for i in range(2... | p03255 |
iN ,iX = [int(x) for x in input().split()]
aX = [int(x) for x in input().split()]
aCum = [0]*iN
aCum[0] = aX[0]
for i in range(1,iN):
aCum[i]=aCum[i-1]+aX[i]
def fCeil(iT,iR):
return -1 * iT // iR * -1
#マネして記法を圧縮してみたがどうだろう
def fCalcCost(iN,iX,aCum,iK):
return (iN + iK ) * iX + 5 * aCum[-1] ... | iN ,iX = [int(x) for x in input().split()]
#かえって遅い？
aCum = [0]
for x in input().split():
aCum += [aCum[-1] + int(x)]
def fCeil(iT,iR):
return -1 * iT // iR * -1
def fCalcCost(iN,iX,aCum,iK):
iCost = (iN + iK ) * iX + 5 * aCum[-1]
for i in range(2,fCeil(iN,iK) ):
iCost += 2 * aCum[... | p03255 |
iN ,iX = [int(x) for x in input().split()]
aCum = [0]
for x in input().split():
aCum += [aCum[-1] + int(x)]
def fCeil(iT,iR):
return -1 * iT // iR * -1
def fCalcCost(iN,iX,aCum,iK):
iCost = (iN + iK ) * iX + 5 * aCum[iN]
for i in range(2,fCeil(iN,iK) ):
iCost += 2 * aCum[iN - i * i... | iN ,iX = [int(x) for x in input().split()]
aCum = [0]
for x in input().split():
aCum += [aCum[-1] + int(x)]
def fCeil(iT,iR):
return -1 * iT // iR * -1
def fCalcCost(iN,iX,aCum,iK):
iCost = (iN + iK ) * iX + 5 * aCum[iN]
for i in range(2,fCeil(iN,iK) ):
iCost += 2 * aCum[iN - i * i... | p03255 |
iN ,iX = [int(x) for x in input().split()]
aCum = [0]
for x in input().split():
aCum += [aCum[-1] + int(x)]
def fCeil(iT,iR):
return -1 * iT // iR * -1
def fCalcCost(iN,iX,aCum,iK):
iCost = (iN + iK ) * iX + 5 * aCum[iN]
for i in range(2,fCeil(iN,iK) ):
iCost += 2 * aCum[iN - i * i... | iN ,iX = [int(x) for x in input().split()]
aCum = [0]
for x in input().split():
aCum += [aCum[-1] + int(x)]
def fCeil(iT,iR):
return -1 * iT // iR * -1
def fCalcCost(iN,iX,aCum,iK):
iCost = (iN + iK ) * iX + 5 * aCum[iN]
for i in range(2,fCeil(iN,iK) ):
iCost += 2 * aCum[iN - i * i... | p03255 |
import math
import sys
n,x= list(map(int,input().split()))
a = list(map(int, sys.stdin.readline().split()))
ru = [0]*(n+1)
for i in range(1,n+1):
ru[i] = ru[i-1]+a[i-1]
ans = float("inf")
for i in range(1,n+1):
tmp = x*i
l = math.ceil(n/i)
for j in range(1,l+1):
if ans <= tmp:
break
... | import sys
n,x= list(map(int,input().split()))
a = list(map(int, sys.stdin.readline().split()))
ru = [0]*(n+1)
for i in range(1,n+1):
ru[i] = ru[i-1]+a[i-1]
ans = float("inf")
for i in range(1,(n+1)//2+1):
tmp = x*i+ru[n]*5
j = n-i*2
while j > 0:
tmp += ru[j]*2
j -= i
ans = min(ans,tmp)
... | p03255 |
def main():
string = input().strip()
k = int(eval(input()))
s = set()
length = len(string)
for i in range(length):
for j in range(i, length):
s.add(string[i:j+1])
print((sorted(s)[k - 1]))
if __name__ == '__main__':
main()
| def main():
string = input().strip()
k = int(eval(input()))
s = set()
for char in sorted(set(string)):
for i in range(len(string)):
if string[i] == char:
s.add(string[i])
s.add(string[i:i+1])
s.add(string[i:i+2])
... | p03355 |
#!/usr/bin/env python3
from sys import stdin
def solve(tc):
s = stdin.readline().strip()
k = int(stdin.readline().strip())
n = len(s)
li = [list() for i in range(26)]
for i in range(n):
li[ord(s[i])-ord('a')].append(i)
p = 0
while len(li[p])==0:
p += 1
... | #!/usr/bin/env python3
from sys import stdin
def solve(tc):
s = stdin.readline().strip()
k = int(stdin.readline().strip())
n = len(s)
li = [list() for i in range(26)]
for i in range(n):
li[ord(s[i])-ord('a')].append(i)
p = 0
while len(li[p])==0:
p += 1
... | p03355 |
# -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
class Scanner():
@staticmethod
def int():
return i... | # -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
class Scanner():
@staticmethod
def int():
return i... | p03355 |
import sys
def solve():
input = sys.stdin.readline
s = input().strip("\n")
K = int(eval(input()))
substr = set()
N = len(s)
for i in range(N):
for j in range(i+1, N + 1):
substr |= {s[i:j]}
sl = list(substr)
sl.sort()
print((sl[K-1]))
return 0... | import sys
def solve():
input = sys.stdin.readline
s = input().strip("\n")
K = int(eval(input()))
substr = set()
N = len(s)
for i in range(N):
for j in range(1, min(6, N - i + 1)):
substr |= {s[i:i+j]}
sl = list(substr)
sl.sort()
print((sl[K-1]))
... | p03355 |
s = input().strip()
K = int(eval(input()))
C = {}
for i in range(len(s)):
if s[i] not in C:
C[s[i]] = []
C[s[i]].append(i)
if len(C)==1:
a = s[0]
print((a*K))
else:
A = []
for a in C:
for i in C[a]:
for j in range(i+1,len(s)+1):
A.append... | s = input().strip()
K = int(eval(input()))
C = {}
for i in range(len(s)):
if s[i] not in C:
C[s[i]] = []
C[s[i]].append(i)
D = {}
for a in C:
for i in C[a]:
for j in range(i+1,len(s)+1):
if s[i:j] not in D:
D[s[i:j]] = 0
D[s[i:j]] += 1
D ... | p03355 |
def all_index(s, c):
ins = []
for i in range(len(s)):
if s[i] == c:
ins.append(i)
return ins
s = input().strip()
k = int(eval(input()))
ss = set()
alphabets = sorted(list(set(s)))
for c in alphabets:
ins = all_index(s, c)
for i in ins:
for j in range(... | def all_index(s, c):
ins = []
for i in range(len(s)):
if s[i] == c:
ins.append(i)
return ins
s = input().strip()
k = int(eval(input()))
ss = set()
alphabets = sorted(list(set(s)))
for c in alphabets:
ins = all_index(s, c)
for i in ins:
for j in range(... | p03355 |
import sys
from string import ascii_lowercase as AL
input = sys.stdin.readline
def main():
s = input().rstrip()
K = int(eval(input()))
N = len(s)
total = 0
for al in AL:
induces = []
for i in range(N):
if al == s[i]:
induces.append(i)
... | import sys
input = sys.stdin.readline
def main():
s = input().rstrip()
K = int(eval(input()))
N = len(s)
sub = []
for i in range(N):
for j in range(K):
sub.append(s[i:i+j+1])
sub = set(sub)
sub = sorted(sub)
ans = sub[K-1]
print(ans)
if _... | p03355 |
import sys
from string import ascii_lowercase as AL
input = sys.stdin.readline
def main():
S = input().rstrip()
K = int(eval(input()))
N = len(S)
sub = set()
for al in AL:
for i in range(N):
if S[i] == al:
for j in range(1, 6):
... | import sys
input = sys.stdin.readline
def main():
S = input().rstrip()
K = int(eval(input()))
N = len(S)
sub = set()
for i in range(N):
for j in range(1, K + 1):
sub.add(S[i:i + j])
sub = sorted(sub)
ans = sub[K - 1]
print(ans)
if __name__... | p03355 |
import sys
sys.setrecursionlimit(10 ** 7)
# ----------
INF = float("inf")
MOD = 10 ** 9 + 7
# ----------
s = list(input().strip())
K = int(eval(input()))
N = len(s)
if N == 1:
print((s[0]))
exit()
sub = set()
for i in range(N):
for j in range(N):
sub.add(''.join(s[i:j+1]))... |
S = input().strip()
K = int(eval(input()))
L = len(S)
substr = set()
for i in range(L):
for j in range(5):
s = S[i:min(i+j+1, L)]
if s:
substr.add(s)
print((sorted(substr)[K-1]))
| p03355 |
import sys
from sys import exit
from collections import deque
from copy import deepcopy
from bisect import bisect_left, bisect_right, insort_left, insort_right
from heapq import heapify, heappop, heappush
from itertools import product, permutations, combinations, combinations_with_replacement
from functools impo... | import sys
from sys import exit
from collections import deque
from copy import deepcopy
from bisect import bisect_left, bisect_right, insort_left, insort_right
from heapq import heapify, heappop, heappush
from itertools import product, permutations, combinations, combinations_with_replacement
from functools impo... | p03355 |
from sys import stdin
from sys import setrecursionlimit
setrecursionlimit(10 ** 7)
s = stdin.readline().rstrip()
k = int(stdin.readline().rstrip())
def main():
finish = set()
S = len(s)
for i in range(S):
for j in range(i+1,S+1):
finish.add(s[i:j])
finish = list(fini... | from sys import stdin
from sys import setrecursionlimit
setrecursionlimit(10 ** 7)
s = stdin.readline().rstrip()
k = int(stdin.readline().rstrip())
finish = set()
S = len(s)
for i in range(S):
for j in range(1,6):
finish.add(s[i:i+j])
finish = list(finish)
finish.sort()
print((finish... | p03355 |
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def ... | import sys
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
A,B = MI()
S = LS2()
for i in range(A+B+1):
if i == A:
if S[i] != '-':
print('No')
break
else:
if S[i] == '-':
... | p03474 |
import sys
# import collections
# import math
import string
# import bisect
# import re
# import itertools
# import statistics
def main():
a, b = (int(x) for x in sys.stdin.readline().split())
s = sys.stdin.readline().rstrip()
if s[a] == '-':
s_a, s_b = s[:a], s[a+1:]
for i in... | import sys
a, b = list(map(int, sys.stdin.readline().split()))
s = sys.stdin.readline().rstrip()
def main():
return 'Yes' if s[a] == '-' and not '-' in set(s[:a] + s[a+1:]) else 'No'
if __name__ == '__main__':
ans = main()
print(ans) | p03474 |
a=list(map(int,input().split()));t=list(map(len,input().split('-')));print(['No','Yes'][a==t]) | print(['No','Yes'][list(map(int,input().split()))==list(map(len,input().split('-')))]) | p03474 |
"""
author : halo2halo
date : 24, Jan, 2020
"""
import sys
# import itertools
# import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
A, B = list(map(int, readline().split()))
S = readline().decode('... | """
author : halo2halo
date : 24, Jan, 2020
"""
import sys
# import itertools
# import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
A, B = list(map(int, readline().split()))
S = readline().decode('... | p03474 |
import re
a,b = list(map(int, input().split()))
s = input().split('-')
print(('Yes' if len(s)==2 and len(s[0])==a else 'No')) | a,b = list(map(int, input().split()))
s = input().split('-')
print(('Yes' if len(s)==2 and len(s[0])==a else 'No')) | p03474 |
import re,sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
A,B = LI()
S = S()
print(('Yes' if re.fullmatch(pattern=r'\d{{{}}}-\d{{{}}}'.format(A,B),string=S) else 'No'))
| import sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
A,B = LI()
S = S()
ans = 1
for i in range(A+B+1):
if i==A:
if S[i]!='-':
ans = 0
break
else:
if not S[i] in '1234567890':
... | p03474 |
#!/usr/bin/env python3
import sys
YES = "Yes" # type: str
NO = "No" # type: str
def solve(A: int, B: int, S: str):
is_hyphen = True if S[A : A + 1] == "-" else False
before = S[:A]
after = S[A + 1 :]
try:
int(before)
int(after)
if is_hyphen:
print(... | #!/usr/bin/env python3
import sys
YES = "Yes" # type: str
NO = "No" # type: str
def solve(A: int, B: int, S: str):
is_mid = True if S[A] == "-" else False
is_num = (S[:A] + S[A + 1 :]).find("-") == -1
print((YES if is_mid and is_num else NO))
# Generated by 1.1.7.1 https://github.com/kyu... | p03474 |
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0144
"""
import sys
from sys import stdin
input = stdin.readline
from enum import Enum
class Graph(object):
""" single source shortest path """
class Status(Enum):
""" ?????????????¨??????¶??? """
... | # -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0144
"""
import sys
from sys import stdin
input = stdin.readline
from enum import Enum
class Graph(object):
""" single source shortest path """
class Status(Enum):
""" ?????????????¨??????¶??? """
... | p00144 |
from collections import deque
n=int(input())
r=[list(map(int,input().split())) for _ in range(n)]
m=int(input())
pa=[list(map(int,input().split())) for _ in range(m)]
for i in range(m):
d=[1]*n
q=deque([pa[i][0]])
used=[False]*n
used[pa[i][0]-1]=True
while len(q)!=0:
f=0
... | n=int(input())
g=[[1000000]*n for _ in range(n)]
for i in range(n):
g[i][i]=0
for i in range(n):
r=list(map(int,input().split()))
for j in r[2:]:
g[r[0]-1][j-1]=1
for k in range(n):
for i in range(n):
for j in range(n):
g[i][j]=min(g[i][j],g[i][k]+g[k][j])
m=int(i... | p00144 |
n=int(eval(input()))
count=0
def make_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_di... | from collections import Counter
n=int(eval(input()))
def soin(n):
soin_ans=[]
while n%2==0:
n//=2
soin_ans.append(2)
f=3
while f<=n**0.5:
if n%f==0:
n//=f
soin_ans.append(f)
else:
f+=2
if n!=1:
soin_ans.append(n)
return soin_ans
s_list=soin(n)
s_set=se... | p02660 |
n = int(eval(input()))
ans = 0
i = 2
while n>1 and i*i<=n:
if n % i == 0:
c = 0
while n % i == 0:
n = n / i
c = c + 1
Y=1
U=2
while c>=Y:
ans=ans+1
Y=Y+U
U=U+1
i = i + 1
if n > 1:
ans = 1 + ans
print(ans) | n = int(eval(input()))
ans = 0
i = 2
while n>1 and i*i<=n:
if n % i == 0:
c = 0
while n % i == 0:
n = n / i
c = c + 1
Y=1
U=2
while c>=Y:
ans=ans+1
Y=Y+U
U=U+1
i += 1
if n > 1:
ans = 1 + ans
print(ans) | p02660 |
n = int(eval(input()))
ans = 0
i = 2
while n>1 and i*i<=n:
if n % i == 0:
c = 0
while n % i == 0:
n = n / i
c += 1
Y=1
U=2
while c>=Y:
ans=ans+1
Y=Y+U
U=U+1
i = i + 1
if n > 1:
ans = 1 + ans
print(ans)
| n = int(eval(input()))
ans = 0
i = 2
while n>1 and i*i<=n:
if n % i == 0:
c = 0
while n % i == 0:
n = n / i
c += 1
j = 1
while c>=j:
ans=ans+1
c -= j
j += 1
i = i + 1
if n > 1:
ans = 1 + ans
print(ans) | p02660 |
import sys
N = int(sys.stdin.readline().rstrip())
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
def prime_jud... | import sys
N = int(sys.stdin.readline().rstrip())
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
def prime_fac... | p02660 |
import sys
N = int(sys.stdin.readline().rstrip())
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
def prime_fac... | import sys
N = int(sys.stdin.readline().rstrip())
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.app... | p02660 |
import math
N = int(eval(input()))
if N == 1:
print((0))
exit()
div = {}
i = 2
while i*i <= N:
while N % i == 0:
N = N // i
if i in div:
div[i] += 1
else:
div[i] = 1
if N == 1:
break
i += 1
if N != 1:
div[N] = 1
ans = 0
... | import math
N = int(eval(input()))
if N == 1:
print((0))
exit()
div = {}
for i in range(2, int(math.sqrt(N))+1):
while N % i == 0:
N = N // i
if i in div:
div[i] += 1
else:
div[i] = 1
if N == 1:
break
if N != 1:
div[N] = 1
ans ... | p02660 |
def find_primes(n):
ps = []
t = [True] * n
t[0] = t[1] = False
for i in range(2, n):
if not t[i]:
continue
ps.append(i)
for j in range(i, n, i):
t[j] = False
return ps
def solve(string):
n = int(string)
if n == 1:
retu... | import collections
n = int(eval(input()))
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)... | p02660 |
import math
def get_prime(n):
if n <= 1:
return []
prime = [2]
if n > 2:
limit = int(math.sqrt(n))
odd = [i for i in range(3, n + 1, 2)]
while limit >= odd[0]:
prime.append(odd[0])
odd = [j for j in odd if j % odd[0] != 0]
prime += o... | def p_facto(n):
ret = []
nc = n
for i in range(2, nc):
if i*i > nc:
break
if n % i == 0:
ex = 0
while n % i == 0:
ex += 1
n //= i
ret.append([i, ex])
if n != 1:
ret.append([n, 1])
re... | p02660 |
N = int(eval(input()))
if N == 1:
print((0))
exit()
primes = []
i = 2
tmp = N
flag = False
while i**2 <= tmp:
if N % i == 0:
flag = True
count = 0
while N % i == 0:
N //= i
count += 1
primes.append((i, count))
i += 1
if (not N ==... | N = int(eval(input()))
if N == 1:
print((0))
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.app... | p02660 |
import sys
read = sys.stdin.read
def main():
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 //= ... | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
# 「素数の乗数」かつ「Nを割り切れる」数Zをなるべく多く選ぶ
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n ** 0.5 // 1)) + 1):
if temp % i == 0:
cnt = 0
while tem... | p02660 |
N = int(eval(input()))
def prime_factorize(n):
if n == 1:
return []
ans = []
tmp = n
i = 2
while pow(i, 2) <= n:
if tmp % i == 0:
cnt = 0
while tmp % i == 0:
cnt += 1
tmp /= i
ans.append([i, cnt])
... | N = int(eval(input()))
i = 2
tmp = N
ans = 0
while i*i <= N:
cnt = 0
while tmp % i == 0:
tmp //= i
cnt += 1
if cnt > 0:
k = 1
while cnt - k >= 0:
cnt -= k
ans += 1
k += 1
i += 1
if tmp != 1:
ans += 1
print(an... | p02660 |
from functools import reduce
from decimal import *
from operator import mul
def main():
n = int(eval(input()))
p = prime_factorize(n)
sa = list(sorted(p))
pp = []
num = 1
for i, v in enumerate(sa):
if i > 0 and sa[i-1] != v:
num = 1
num *= v
if ... | # import sys
# input = sys.stdin.readline
import itertools
import collections
from decimal import Decimal
# 持っているビスケットを叩き、1枚増やす
# ビスケット A枚を 1円に交換する
# 1円をビスケット B枚に交換する
def main():
n = int(eval(input()))
p = prime_factorize(n)
cp = collections.Counter(p)
ans = 0
for c, num in list(cp.... | p02660 |
n = int(eval(input()))
dic = {}
def f(num):
while(num%2==0):
num //= 2
if(dic.get(2) is None):
dic[2] = 1
else:
dic[2] += 1
s = 3
while((s*s) <= num):
if((num % s)==0):
if(dic.get(s) is None):
dic[s] = 1
... | n = int(eval(input()))
def pFact(n):
l=[]
if(n==1):
return [1]
while(n%2==0):
l.append(2)
n//=2
f=3
while(f*f <= n):
if(n%f==0):
l.append(f)
n//=f
else:
f += 2
if(n!=1):
l.append(n)
... | p02660 |
def factorize(n):
res = []
i = 2
while i * i <= n:
cnt = 0
while n % i == 0:
cnt += 1
n //= i
if cnt > 0:
res.append([i, cnt])
i += 1
if n != 1:
res.append([n, 1])
return res
n = int(eval(input()))
nlist = f... | def factorize(n):
res = []
i = 2
while i * i <= n:
cnt = 0
while n % i == 0:
cnt += 1
n //= i
if cnt > 0:
res.append([i, cnt])
i += 1
if n != 1:
res.append([n, 1])
return res
n = int(eval(input()))
nlist = f... | p02660 |
#約数
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
#素因数分解
def soinsu_bunkai(m):
pf={}
for... | #約数
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
#素因数分解
def soinsu_bunkai(m):
pf={}
for... | p02660 |
#約数
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
#素因数分解
def soinsu_bunkai(m):
pf={}
for... | #約数は使わず、素因数分解のみ
#素因数分解
def soinsu_bunkai(m):
pf={}
for i in range(2,int(m**0.5)+1):
while m%i==0:
pf[i]=pf.get(i,0)+1
m//=i
if m>1:
pf[m]=1
return pf
#初期入力
N = int(eval(input()))
xx =[]
prime_factorization =soinsu_bunkai(N)
count =0
for i in ... | p02660 |
def LI():return list(map(int,input().split()))
def yes():return print("Yes")
def no():return print("No")
from collections import deque, defaultdict, Counter
# from heapq import heappop, heappush
# import math
# from decimal import Decimal
# def divisors(x):
# ret=[]
# for i in range(1,int(x**.5)+1):
... | a=[]
for i in range(51):
a+=[i]*(i+1)
def prime_factor(n):
ass=[]
for i in range(2,int(n**0.5)+1):
while n%i==0:
ass.append(i)
n=n//i
if n!=1:
ass.append(n)
return ass
from collections import Counter
c=Counter(prime_factor(int(eval(input()... | p02660 |
n=int(eval(input()))
M=10**6+1
l=[]
p=[1]*M
for i in range(2,M):
if p[i]:
l+=[i]
for j in range(2*i,M,i):
p[j]=0
d={}
for k in l:
c=0
while n%k==0: n//=k; c+=1
if c>0: d[k]=c
s=[1]
for i in range(2,9):
s.append(s[-1]+i)
a=0
for i in list(d.values()):
for j in s:
if j>i:... | n=int(eval(input()))
M=10**6
l=[]
p=[1]*M
for i in range(2,M):
if p[i]:
l+=[i]
for j in range(2*i,M,i): p[j]=0
d={}
for k in l:
while n%k<1: n//=k; d[k]=d.get(k,0)+1
a=0
for i in list(d.values()):
t=c=0
while t+c<i: c+=1; t+=c
a+=c
print((a+(n>1))) | p02660 |
n=int(eval(input()))
M=10**6
l=[]
p=[1]*M
for i in range(2,M):
if p[i]:
l+=[i]
for j in range(2*i,M,i): p[j]=0
d={}
for k in l:
while n%k<1: n//=k; d[k]=d.get(k,0)+1
a=0
for i in list(d.values()):
t=c=0
while t+c<i: c+=1; t+=c
a+=c
print((a+(n>1))) | n=int(eval(input()))
d={}
for k in range(2,10**6):
while n%k<1: n//=k; d[k]=d.get(k,0)+1
a=0
for i in list(d.values()):
t=c=0
while t+c<i: c+=1; t+=c
a+=c
print((a+(n>1))) | p02660 |
n=int(eval(input()))
int_sqrt=lambda x:int(x**0.5)+1
def sieve(x):
p=[]
b=[1]*x
for i in range(2,x):
if b[i]:
p+=[i]
for j in range(2*i,x,i): b[j]=0
return p
def prime_factor(x):
d={}
for i in p:
while x%i<1:
x//=i
d[i]=d.get(i,0)+1
if x<2: break
if x... | n=int(eval(input()))
int_sqrt=lambda x:int(x**0.5)+1
def prime_factor(x):
d={}
for i in p:
while x%i<1:
x//=i
d[i]=d.get(i,0)+1
if x<2: break
if x>1: d[x]=1
return d
p=list(range(2,int_sqrt(n)))
d=prime_factor(n)
a=0
for i in list(d.values()):
t=c=0
while t+c<i: c+=1;... | p02660 |
n=int(eval(input()))
int_sqrt=lambda x:int(x**0.5)+1
def prime_factor(x):
d={}
for i in p:
while x%i<1:
x//=i
d[i]=d.get(i,0)+1
if x<2: break
if x>1: d[x]=1
return d
p=list(range(2,int_sqrt(n)))
d=prime_factor(n)
a=0
for i in list(d.values()):
t=c=0
while t+c<i: c+=1;... | n=int(eval(input()))
d={2:0}
while n%2<1: n//=2; d[2]+=1
for i in range(3,int(n**0.5)+1,2):
while n%i<1: n//=i; d[i]=d.get(i,0)+1
if n<2: break
if n>1: d[n]=1
a=0
for i in list(d.values()):
t=c=0
while t+c<i: c+=1; t+=c
a+=c
print(a) | p02660 |
n = int(eval(input()))
# 素因数分解
# √n+1までを対象に因数分解
# 素数のみを対象に処理しなくても2で引っかかる場合は4、6などは対象にならない。
prime = []
for i in range(2, int(n**0.5)+1):
cnt = 0
while n%i == 0:
n //= i # 割り切れる場合に最後の処理で余りが1になり、ループを抜ける
cnt += 1
prime.append(cnt) # 因数分解した回数を保持
if n == 1:
break
# 対象が素数であった場合は１を結果として保持
... | n = int(eval(input()))
s = []
for i in range(2, int(n**0.5)+1):
t = 0
while n%i == 0:
n //= i
t += 1
s.append(t)
if n == 1: break
if n > 1: s.append(1)
ans = 0
for i in s:
for j in range(1, i+1):
if i >= j:
i -= j
ans += 1
else:
break
print(ans) | p02660 |
import sys
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])
... | 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])
... | p02660 |
n = int(eval(input()))
def pcheck(n):
if n == 1:
return False
else:
root = int(n ** 0.5)
for i in range(2, root + 1):
if n % i == 0:
return False
return True
if n == 1:
print('0')
elif pcheck(n) == True:
print('1')
else:
... | n = int(eval(input()))
def pcheck(n):
if n == 1:
return False
else:
root = int(n ** 0.5)
for i in range(2, root + 1):
if n % i == 0:
return False
return True
if n == 1:
print('0')
elif n == 6:
print('2')
elif pcheck(n) == True... | p02660 |
from collections import defaultdict
import decimal
import sys
input = sys.stdin.readline
def prime_factor_count(n):
def count(n, i):
cnt = 0
while n % i == 0:
cnt += 1
n //= i
return n, cnt
d = {}
if n == 1:
return d
n, cnt = ... | import sys
input = sys.stdin.readline
def prime_factor_count(n):
def count(n, p):
cnt = 0
while n % p == 0:
n //= p
cnt += 1
np_cnt = 1
while (cnt := cnt - np_cnt) >= 0:
np_cnt += 1
return n, np_cnt - 1
n, cnt = count(... | p02660 |
def main():
from math import sqrt
N = int(eval(input()))
def prime_factorization(n):
facts = []
for i in range(2, int(sqrt(n)) + 5):
while n % i == 0:
n //= i
facts.append(i)
if n != 1:
facts.append(n)
retur... | def main():
N = int(eval(input()))
def prime_factorize(n):
res = []
for i in range(2, n+1):
if i*i > n:
break
if n % i != 0:
continue
ex = 0
while n % i == 0:
ex += 1
n /... | p02660 |
import sys
input = sys.stdin.readline
def factors(x: int) -> list:
s, xx = [], x
for i in range(2, int(x ** 0.5 + 1)):
if xx % i == 0:
c = 0
while xx % i == 0: c += 1; xx //= i
s.append((i, c))
if xx != 1: s.append((xx, 1))
if s == []: s.append((x,... | import sys
input = sys.stdin.readline
from collections import defaultdict
def prime(n: int) -> defaultdict:
f, i = defaultdict(int), 2
while i * i <= n:
while n % i == 0: f[i] += 1; n //= i
i += 1
if n != 1: f[n] = 1
return f
def solve(n: int) -> int:
if n == 1: return... | p02660 |
n=int(eval(input()))
def primes_factraizar(n):
rn = int(n**0.5)
is_prime = [True] * (rn+1) #まずは[1]*n^0.5を用意
is_prime[0] = False
is_prime[1] = False
for i in range(2, rn + 1): #素数の判定√nまでで十分
if not is_prime[i]: #非素数は無視
continue #continue分はループ中の後続の命令をスキップする
... | n = int(eval(input()))
if n == 1:
print((0))
exit()
def primes_factraizar(n):
rn = int(n**0.5)
is_prime = [True]*(rn+1)
is_prime[0] = False
is_prime[1] = False
for i in range(2,rn+1):
if not is_prime[i]:
continue
for j in range(i*2,rn+1,i):
... | p02660 |
import math
# 素数リスト生成 eratosthenes
def makePrime(m):
p = [i for i in range(m + 1)]
for i in p[3:]:
if p[i] % 2 == 0: p[i] = 0
root_m = m ** 0.5
for i in range(3,m):
if i > root_m: break
if p[i] != 0:
for j in range(i, m + 1, 2):
if i * j... | n = int(eval(input()))
i = 2
memo = []
while( i*i <= n ):
x = 0
while(n % i == 0):
#print("n % i == 0 =",n,i,"n/i=",n/i,x+1)
n = int(n / i);
x = x + 1
memo.append([i,x])
i = i + 1
if not (n == 1):
memo.append([n,1])
ans = 0
for i in memo:
x = i[1]
... | p02660 |
def func(N):
tmp=N
arr=[]
for i in range(2,int((N**0.5//1))+1):
if tmp%i==0:
cnt=0
while tmp%i==0:
cnt+=1
tmp//=i
arr.append([i,cnt])
if tmp!=1:
arr.append([tmp, 1])
if arr==[]:
arr... | def func(N):
tmp=N
arr=[]
for i in range(2,int((N**0.5//1))+1):
if tmp%i==0:
cnt=0
while tmp%i==0:
cnt+=1
tmp//=i
arr.append([i,cnt])
if tmp!=1 or arr==[]:
arr.append([tmp, 1])
return arr
... | p02660 |
from math import sqrt
N = int(eval(input()))
rn = int(sqrt(N))
sieve = [0] * (rn + 1)
sieve[0] = -1
sieve[1] = -1
t = [0] * (rn + 1)
for i in range(2, rn + 1):
if sieve[i] != 0:
continue
sieve[i] = i
j = i
while j < rn + 1:
t[j] = 1
j *= i
for j in range(i ... | from math import sqrt
def prime_factorize(n):
result = []
for i in range(2, int(sqrt(n)) + 1):
if n % i != 0:
continue
t = 0
while n % i == 0:
n //= i
t += 1
result.append((i, t))
if n == 1:
break
if n !... | p02660 |
from math import sqrt
def prime_factorize(n):
result = []
for i in range(2, int(sqrt(n)) + 1):
if n % i != 0:
continue
t = 0
while n % i == 0:
n //= i
t += 1
result.append((i, t))
if n == 1:
break
if n !... | from math import sqrt
def prime_factorize(n):
result = []
if n % 2 == 0:
t = 0
while n % 2 == 0:
n //= 2
t += 1
result.append((2, t))
for i in range(3, int(sqrt(n)) + 1, 2):
if n % i != 0:
continue
t = 0
whi... | p02660 |
from math import sqrt
def prime_factorize(n):
result = []
if n % 2 == 0:
t = 0
while n % 2 == 0:
n //= 2
t += 1
result.append((2, t))
for i in range(3, int(sqrt(n)) + 1, 2):
if n % i != 0:
continue
t = 0
whi... | def prime_factorize(n):
result = []
if n % 2 == 0:
t = 0
while n % 2 == 0:
n //= 2
t += 1
result.append((2, t))
for i in range(3, int(n ** 0.5) + 1, 2):
if n % i != 0:
continue
t = 0
while n % i == 0:
... | p02660 |
import math
import random
def is_prime3(q,k=50):
q = abs(q)
#計算するまでもなく判定できるものははじく
if q == 2: return True
if q < 2 or q&1 == 0: return False
#n-1=2^s*dとし（但しaは整数、dは奇数)、dを求める
d = (q-1)>>1
while d&1 == 0:
d >>= 1
#判定をk回繰り返す
for i in range(k):
a = random... | import math
def factrization_prime(number):
factor = {}
div = 2
s = math.sqrt(number)
while div < s:
div_cnt = 0
while number % div == 0:
div_cnt += 1
number //= div
if div_cnt != 0:
factor[div] = div_cnt
div += 1
if nu... | p02660 |
x = int(eval(input()))
import math
from collections import defaultdict
def isprime(n):
if n <= 1:
return 0
m = int(math.sqrt(n)) + 1
for i in range(2, m):
if n % i == 0:
return 0
return 1
if isprime(x):
print((1))
else:
res = 0
value = defau... | x = int(eval(input()))
import math
from collections import defaultdict
res = 0
value = defaultdict(int)
def isprime(n):
if n <= 1:
return 0
m = int(math.sqrt(n)) + 1
for i in range(2, m):
if n % i == 0:
return 0
return 1
if isprime(x):
print((1))
else:
... | p02660 |
import math
def sosu(n):
sosu=1
if n==1:
sosu=0
sq=int(math.sqrt(n))
for x in range(2,sq+2):
if n%x==0 and x<n:
sosu=0
break
return sosu #素数なら1、そうでなければ0
n=int(eval(input()))
so=[]
count=0
if n==1:
count=0
elif sosu(n)==1:
count=1
... | 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
n=int(eval(input()))
if n==1:
... | p02660 |
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def prime_factorization(n):
res = []
for i in range(2, int(pow(n, 0.5)) + 1):
if n % i == 0:
ex = 0
while n % i == 0:
ex += 1
... | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def prime_factorization(n):
res = []
for i in range(2, int(pow(n, 0.5)) + 1):
if n % i == 0:
ex = 0
while n % i == 0:
ex += 1
... | p02660 |
n = int(eval(input()))
if n == 1:
print((0))
exit()
from collections import Counter
def factorize(n):
d = Counter()
m = 2
while m*m <= n:
while n%m == 0:
n //= m
d[m] += 1
m += 1
if n > 1:
d[n] += 1
return d
fac = factorize... | n = int(eval(input()))
if n == 1:
print((0))
exit()
from collections import Counter
def factorize(n):
d = Counter()
if n < 2:
return d
while n%2 == 0:
n //= 2
d[2] += 1
m = 3
while m*m <= n:
while n%m == 0:
n //= m
... | p02660 |
from collections import defaultdict
from itertools import accumulate
def main():
n = int(eval(input()))
prime_counter = defaultdict(int)
acc = tuple(accumulate(list(range(1, 42)))) # 10^12 < 2^39
f = 2
while f * f <= n:
if n % f == 0:
n //= f
prime_co... | from collections import defaultdict
from itertools import accumulate
def main():
n = int(eval(input()))
prime_counter = defaultdict(int)
acc = tuple(accumulate(list(range(1, 42)))) # 10^12 < 2^39
f = 2
while n % f == 0:
n //= f
prime_counter[f] += 1
f = 3
wh... | p02660 |
def main():
n = int(eval(input()))
ans = 0
fac = 2
e = 1
while True:
div = pow(fac, e)
if n % div == 0:
n //= div
ans += 1
e += 1
else:
while n % fac == 0:
n //= fac
fac += 1
... | def main():
n = int(eval(input()))
ans = 0
fac = 2
e = 1
while True:
div = pow(fac, e)
if n % div == 0:
n //= div
ans += 1
e += 1
else:
while n % fac == 0:
n //= fac
if fac == 2:
... | p02660 |
def main():
n = int(eval(input()))
ans = 0
e = 1
facs = (2 if x == 0 else x * 2 + 1 for x in range(10 ** 6))
for fac in facs:
while n % (div := pow(fac, e)) == 0:
n //= div
ans += 1
e += 1
while n % fac == 0:
n //= fac
... | def main():
n = int(eval(input()))
ans = 0
e = 1
def facs():
yield 2
for x in range(10 ** 6):
yield x * 2 + 3
for fac in facs():
while n % (div := pow(fac, e)) == 0:
n //= div
ans += 1
e += 1
while n % f... | p02660 |
from itertools import accumulate
from collections import defaultdict
def main():
n = int(eval(input()))
prime_counter = defaultdict(int)
acc = tuple(accumulate(list(range(1, 42)))) # 10^12 < 2^39
def facs():
yield 2
for x in range(10 ** 6):
yield x * 2 + 3
... | from itertools import accumulate
from collections import defaultdict
def main():
n = int(eval(input()))
prime_counter = defaultdict(int)
acc = tuple(accumulate(list(range(1, 42)))) # 10^12 < 2^39
def facs():
yield 2
for x in range(10 ** 6):
yield x * 2 + 3
... | p02660 |
from itertools import accumulate
from collections import defaultdict
def main():
n = int(eval(input()))
prime_counter = defaultdict(int) # key ^ value
acc = tuple(accumulate(list(range(1, 42)))) # because 10^12 < 2^39
def facs():
yield 2
for x in range(10 ** 5 * 5):
... | from itertools import accumulate
from collections import defaultdict
def main():
n = int(eval(input()))
prime_counter = defaultdict(int) # key ^ value
acc = tuple(accumulate(list(range(1, 42)))) # because 10^12 < 2^39
def facs(n):
yield 2
max_x = int((n ** 0.5 - 3) / 2 + ... | p02660 |
from itertools import accumulate
from collections import defaultdict
def main():
n = int(eval(input()))
prime_counter = defaultdict(int) # key ^ value
acc = tuple(accumulate(list(range(1, 42)))) # because 10^12 < 2^39
def facs(n):
yield 2
max_x = int((n ** 0.5 - 3) / 2 + ... | from itertools import accumulate
from collections import defaultdict
def main():
n = int(eval(input()))
prime_counter = defaultdict(int) # key ^ value
acc = tuple(accumulate(list(range(1, 42)))) # because 10^12 < 2^39
def facs(n):
yield 2
max_x = int(n ** 0.5)
fo... | p02660 |
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==[... | 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==[... | p02660 |
import math
def isPrime(num):
if num < 2:
return False
elif num == 2:
return True
elif num % 2 == 0:
return False
for i in range(3, math.floor(math.sqrt(num))+1, 2):
if num % i == 0:
return False
return True
def find_all_prime(num):
... | def factorization(n):
factorization_list = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp % i == 0:
count = 0
while temp % i == 0:
count += 1
temp //= i
factorization_list.append([i, count])
if temp != ... | p02660 |
from collections import Counter
n = int(eval(input()))
def primes(x):
is_prime = [True] * (x+1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(x**0.5)+1):
if not is_prime[i]:
continue
for j in range(i*2, x+1, i):
is_prime[j] = False
return [i fo... | n = int(eval(input()))
from collections import Counter
factors = []
i = 2
while n > 1:
if n < i * i:
factors.append(n)
break
while n % i == 0:
factors.append(i)
n //= i
i += 1
ans = 0
for cnt in list(Counter(factors).values()):
i = 1
while cnt >= i:
cnt... | p02660 |
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==[... | 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])
return ar... | p02660 |
n=int(eval(input()))
a=p=1
while p<6**8:
c=t=0;p+=1
while n%p<1:n//=p;x=c==t;t+=x;c+=1-t*x;a+=x
print((a-(n<2))) | n=int(eval(input()))
a=p=1
while p<1e6:
c=t=0;p+=1
while n%p<1:n//=p;x=c==t;t+=x;c+=1-t*x;a+=x
print((a-(n<2))) | p02660 |
#!/usr/bin/env python3
import sys
from functools import reduce
import math
def is_prime(n):
if n % 2 == 0 and n > 2:
return False
for i in range(3, int(math.sqrt(n)) + 1, 2):
if n % i == 0:
return False
return True
def sieve(n):
n=int(n)
# Create a b... | #!/usr/bin/env python3
import sys
from functools import reduce
import math
from collections import defaultdict
from math import sqrt
def is_prime(n):
for i in range(2, int(sqrt(n))):
if n % i == 0:
return False
return True
def prime_factors(n):
primes = defaultdic... | p02660 |
N=int(eval(input()))
p_list=[]
if N%2==0:
count=0
while N%2==0:
count+=1
N/=2
p_list.append([2,count])
i=3
while i<N**0.5+1:
if N%i==0:
count=0
while N%i==0:
count+=1
N/=i
p_list.append([i,count])
i+=2
if N!=1:
p_list.append([int(N),1])
result=0
fo... | N=int(eval(input()))
p=[]
r=0
if N%2==0:
c=0
while N%2==0:
c+=1
N/=2
p.append([c])
i=3
while i<N**0.5+1:
if N%i==0:
c=0
while N%i==0:
c+=1
N/=i
p.append([c])
i+=2
if N!=1:
p.append([1])
for i in range(len(p)):
j=1
while p[i][0]>=j:
... | p02660 |
N=int(eval(input()))
p=[]
r=0
if N%2==0:
c=0
while N%2==0:
c+=1
N/=2
p.append(c)
for i in range(3,int(N**0.5)+1,2):
if N%i==0:
c=0
while N%i==0:
c+=1
N/=i
p.append(c)
if N!=1:
p.append(1)
for i in p:
r+=int(((8*i+1)**0.5-1)/2)
print(r) | N=int(eval(input()))
p=[]
r=0
if N%2==0:
c=0
while N%2==0:
N=N//2
c+=1
p.append(c)
for i in range(3,int(N**0.5)+1,2):
if N%i==0:
c=0
while N%i==0:
N=N//i
c+=1
p.append(c)
if N!=1:
p.append(1)
while p:
r+=int(((8*p.pop()+1)**0.5-1)/2)
print(r) | p02660 |
n = int(eval(input()))
c = 0
for p in range(2, int(n**0.5)+1): #nが合成数
e = 0
while n%p == 0:
n //= p
e += 1
i = 1
while e >= i:
e -= i
c += 1
i += 1
if n != 1: #nが素数
c += 1
print(c) | n = int(eval(input()))
c = 0
for p in range(2, int(n**0.5)+1): #nが合成数
e = 0
while n%p == 0:
n //= p
e += 1
i = 1
while e >= i:
e -= i
c += 1
i += 1
if n != 1: #nが素数 or nがn^0.5より大きい素数を因数に持つ合成数
c += 1
print(c) | p02660 |
from math import sqrt
def is_prime(n):
if n == 1:
return False
for i in range(2, int(sqrt(n))+1):
if n % i == 0:
return False
return True
def factorization(n):
arr = []
temp = n
for i in range(2, int(sqrt(n))+1):
if temp%i==0:
cnt=0
while... | from math import sqrt
def is_prime(n):
if n == 1:
return False
for i in range(2, int(sqrt(n))+1):
if n % i == 0:
return False
return True
def factorization(n):
arr = []
temp = n
for i in range(2, int(sqrt(n))+1):
if temp%i==0:
cnt=0
while... | p02660 |
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==[... | 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==[... | p02660 |
from collections import Counter
N = int(eval(input()))
n = N
counter = Counter()
while n % 2 == 0:
counter[2] += 1
n //= 2
p = 3
while p ** 2 <= N:
if n % p == 0:
counter[p] += 1
n //= p
else:
p += 2
if n != 1:
counter[N] += 1
ans = 0
for key in list(co... | from collections import Counter
def prime_factorization(n):
counter = Counter()
max_pp = n
while n % 2 == 0:
counter[2] += 1
n //= 2
p = 3
while p ** 2 <= max_pp:
if n % p == 0:
counter[p] += 1
n //= p
else:
p += 2
... | p02660 |
import sys
from bisect import bisect
def solve():
input = sys.stdin.readline
N = int(eval(input()))
A = [int(i) + 1 for i in range(40)]
B = [0] * 41
for i, a in enumerate(A):
B[i+1] = B[i] + a
count = 0
k = N
for i in range(2, N+1):
if i ** 2 > N: break
... | import sys
from bisect import bisect
def solve():
input = sys.stdin.readline
N = int(eval(input()))
sum = [0] * 41
for i in range(1, 41):
sum[i] = sum[i-1] + i
count = 0
k = N
for i in range(2, N + 1):
if i ** 2 > k: break
if k % i == 0:
d =... | p02660 |
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==[... | def factorization(n):
arr = []
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
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:... | p02660 |
N = int(eval(input()))
A = [0 for k in range(int(N**0.5)+1)]
#N=1の処理
if N == 1:
print((0))
exit()
ans = 0
prime = [2]
for k in range(3, len(A), 2):
if A[k] == 0:
prime.append(k)
for j in range(k, len(A), k):
A[j] = 1
for p in prime:
if N%p == 0:
break
else:
print((1))... | N = int(eval(input()))
A = [0 for k in range(int(N**0.5)+1)]
#N=1の処理
if N == 1:
print((0))
exit()
ans = 0
prime = [2]
for k in range(3, len(A), 2):
if A[k] == 0:
prime.append(k)
for j in range(k, len(A), k):
A[j] = 1
for p in prime:
if N%p == 0:
break
else:
print((1))... | p02660 |
n = int(eval(input()))
def prime_factor(n):
factor = []
for i in range(2, int(n ** 0.5) + 1):
while (n % i == 0):
factor.append(i)
n //= i
if n != 1:
factor.append(n)
return factor
from collections import Counter
f = prime_factor(n)
c = Counter(f)
res = 0
for k, v in list(c.items()):
... | from collections import Counter
n = int(eval(input()))
def prime_factor(n):
factor = []
for i in range(2, int(n ** 0.5) + 1):
while (n % i == 0):
factor.append(i)
n //= i
if n != 1:
factor.append(n)
return factor
factor = prime_factor(n)
c = Counter(factor)
cnt = 0
for k, v in list(c... | p02660 |
from collections import Counter
n = int(eval(input()))
def prime_factor(n):
factor = []
for i in range(2, int(n ** 0.5) + 1):
while (n % i == 0):
factor.append(i)
n //= i
if n != 1:
factor.append(n)
return factor
factor = prime_factor(n)
c = Counter(factor)
cnt = 0
for k, v in list(c... | n = int(eval(input()))
def prime_factor(n):
factor = []
for i in range(2, int(n ** 0.5) + 1):
while (n % i == 0):
factor.append(i)
n //= i
if n != 1:
factor.append(n)
return list(set(factor))
factor = prime_factor(n)
cnt = 0
for p in factor:
... | p02660 |
from heapq import heappop, heappush
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def prime_factorization(n):
d = {}
i = 2
while i * i <= n:
if n % i == 0:
d[i] = 1
n //= i
while n % i == 0:
... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def prime_factorization(n):
d = {}
i = 2
while i * i <= n:
if n % i == 0:
d[i] = 1
n //= i
while n % i == 0:
n //= i
d[i] ... | p02660 |
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,copy
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
... | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
import sys,math,itertools,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.std... | p02660 |
import math
def solve():
N = int(eval(input()))
divisors = calc_divisors(N)
divisors.sort()
now = N
i = 1
ans = 0
while i != len(divisors):
if isPrime(divisors[i]) and now % divisors[i] == 0:
now /= divisors[i]
ans += 1
else:
... | import math
from collections import Counter
def solve():
N = int(eval(input()))
primeFac = prime_factorize(N)
counter = Counter(primeFac)
divisors = []
for key, val in list(counter.items()):
for i in range(1,val+1):
divisors.append(pow(key,i))
divisors.sort()
... | p02660 |
import itertools
import math
import fractions
import functools
import copy
from collections import deque
from functools import reduce
from decimal import Decimal
n = int(eval(input()))
prime = {}
num = n
i = 2
while True:
if i * i > n:
if(num > 1):
prime[num] = 1
brea... | import itertools
import math
import fractions
import functools
import copy
from collections import deque
from functools import reduce
from decimal import Decimal
n = int(eval(input()))
def how_many_prime(n):
prime = {}
num = n
i = 2
while True:
if i * i > n:
if(num... | p02660 |
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==[]:
... | 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==[]:
... | p02660 |
def factorization(n):
m=n
counter_map={}
i=2
tmp=1
while n!=1:
#因数に持つか判定
if n%i==0:
n=n//i
#素数判定
for j in range(2,int(i**(1/2))+1):
if i%j==0:
break
else:
tmp*=i
... | def factorization(n):
m=n
counter_map={}
i=2
tmp=1
while n!=1:
#因数に持つか判定
if n%i==0:
n=n//i
#素数判定
for j in range(2,int(i**(1/2))+1):
if i%j==0:
break
else:
tmp*=i
... | p02660 |
def era(num):
input_list = [False if i % 2 == 0 or i % 3 == 0 or i % 5 == 0 else True for i in range(num)]
input_list[0] = input_list[1] = False
input_list[2] = input_list[3] = input_list[5] = True
sqrt = num**0.5
for serial in range(3, num, 2):
if serial >= sqrt:
retu... | N=int(eval(input()))
F={}
for i in range(2,int(N**0.5)+1):
if N%i==0:
F[i]=1
N//=i
while N%i==0:
N//=i
F[i]+=1
if N>1:
F[N]=1
ans=0
for f in F:
j=1
while True:
F[f]-=j
j+=1
if F[f]>=0:
ans+=1
else:
... | p02660 |
K = int(eval(input()))
N = 10**6
dp = [1] * (N+1)
dp[0] = dp[1] = 0
def pw(j,i):
while(j%i==0):
j //= i
if j == 1:
return True
else:
return False
for i in range(2,N+1):
if dp[i]:
for j in range(i*i, N+1, i):
#if not pw(j,i):
... | N = int(eval(input()))
def factorize(N):
n = N
r = []
for i in range(2,int(N**0.5)+1): # intに変換すること
cnt = 0
while(n%i==0):
cnt += 1
n //= i # 整数除算(//)を使うこと
if cnt!=0:
r.append((i,cnt))
if n!=1:
r.append((n,1))
return r... | p02660 |
def is_prime(num:int):
if num == 1:
return False
elif num == 2:
return True
elif num % 2 == 0:
return False
r_num = int(num ** 0.5)
for i in range(3, r_num + 1, 2):
if num % i == 0:
return False
return True
def main():
n = int(ev... | def is_prime(num:int):
if num == 1:
return False
elif num == 2:
return True
elif num % 2 == 0:
return False
r_num = int(num ** 0.5)
for i in range(3, r_num + 1, 2):
if num % i == 0:
return False
return True
def main():
n = int(ev... | p02660 |
#23ぐらいまでで良さそう。
z = [2, 3, 4, 5, 7, 8, 9, 11, 13, 16, 17, 19, 23]
def primes(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_pri... | N = int(eval(input()))
hash = {}
end = int(N ** (1/2))
for i in range(2, end + 1):
while N % i == 0:
if i in hash:
hash[i] += 1
else:
hash[i] = 1
N = N // i
if N != 1:
if N in hash:
hash[N] += 1
else:
hash[N] =... | p02660 |
from collections import Counter
def get_prime_factors(x):
out = []
if x < 1:
return out
while not x%2:
out.append(2)
x //= 2
i = 3
while i*i <= x:
if not x%i:
out.append(i)
x //= i
else:
i += 2
if x != 1... | from collections import Counter
def get_prime_factors(x):
out = []
if x < 1:
return out
while not x%2:
out.append(2)
x //= 2
i = 3
while i*i <= x:
if not x%i:
out.append(i)
x //= i
else:
i += 2
if x != 1... | p02660 |
N = int(eval(input()))
n, p, score = N, 2, 0
while p ** 2 <= N:
e = 1
while n % (p ** e) == 0:
n //= (p ** e)
score += 1
e += 1
else:
while n % p == 0:
n //= p
p += 1
else:
if n != 1:
score += 1
print(score) | N = int(eval(input()))
n, p, score = N, 2, 0
while p ** 2 <= N:
e = 1
while n % (p ** e) == 0:
n //= (p ** e)
score += 1
e += 1
else:
while n % p == 0:
n //= p
p = p + 1 if p == 2 else p + 2
else:
if n != 1:
score += 1
print(score) | p02660 |
def prime(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
N = int(eval(input()))
a = prime(N)
a.... | def prime(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
N = int(eval(input()))
a = prime(N)
a.... | p02660 |
from heapq import *
import sys
from collections import *
from itertools import *
from decimal import *
import copy
from bisect import *
import math
sys.setrecursionlimit(4100000)
def gcd(a,b):
if(a%b==0):return(b)
return (gcd(b,a%b))
input=lambda :sys.stdin.readline().rstrip()
N=int(eval(input()))
... | from heapq import *
import sys
from collections import *
from itertools import *
from decimal import *
import copy
from bisect import *
import math
sys.setrecursionlimit(4100000)
def gcd(a,b):
if(a%b==0):return(b)
return (gcd(b,a%b))
input=lambda :sys.stdin.readline().rstrip()
N=int(eval(input()))
... | p02660 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.