problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p02660 | 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==[]:
arr.append([n, 1])
return arr
a = factor... | 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==[]:
arr.append([n, 1])
return arr
a = factorization(i... | [
"expression.operator.change",
"literal.number.integer.change",
"assignment.value.change"
] | 384,286 | 384,287 | u228303592 | python |
p02660 | 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==[]:
arr.append([n, 1])
return arr
a = factorization(... | 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==[]:
arr.append([n, 1])
return arr
a = factorization(... | [
"literal.number.integer.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 384,288 | 384,289 | u228303592 | python |
p02660 | 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==[]:
arr.append([n, 1])
return arr
a = factor... | 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==[]:
arr.append([n, 1])
return arr
a = factorization(... | [
"literal.number.integer.change",
"assignment.value.change"
] | 384,286 | 384,289 | u228303592 | python |
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==[]:
arr.append([n, 1])
return arr
a = factoriz... | 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==[]:
arr.append([n, 1])
return arr
a = factorizat... | [
"expression.operation.unary.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove"
] | 384,290 | 384,292 | u228303592 | python |
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==[]:
arr.append([n, 1])
return arr
a = factoriz... | 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
a = factori... | [
"expression.operation.unary.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 384,290 | 384,293 | u228303592 | python |
p02660 | import sys
import math
def is_prime(N):
if N == 1:
return False
i = 2
while i * i <= N:
if N % i == 0:
return False
i += 1
return True
def prime(N):
prime = []
is_prime = [] # 全て素数であると初期化
for i in range(N):
if i * i > N:
break
... | import sys
import math
def is_prime(N):
if N == 1:
return False
i = 2
while i * i <= N:
if N % i == 0:
return False
i += 1
return True
def prime(N):
prime = []
is_prime = [] # 全て素数であると初期化
for i in range(N):
if i * i > N:
break
... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 384,301 | 384,302 | u187235390 | python |
p02660 | num = int(input())
#prime number counter
ans = 0
prime_check = [1]*1000100
count = 2
while num>1:
if prime_check[count]==1: #countが素数だった場合
tmp = 0
while num % count == 0: #numの因数にcountが何個含まれているか
num/= count
tmp += 1
tmp2 =1
while tmp>=tmp2: #ansに加える
... | num = int(input())
#prime number counter
ans = 0
prime_check = [1]*1000100
count = 2
while num>1:
if prime_check[count]==1: #countが素数だった場合
tmp = 0
while num % count == 0: #numの因数にcountが何個含まれているか
num/= count
tmp += 1
tmp2 =1
while tmp>=tmp2: #ansに加える
... | [] | 384,303 | 384,304 | u881705752 | python |
p02660 | N = int(input())
a = []
count =0
count2 = 0
count3 = 0
X=int(N**0.5)
for i in range(X+1):
if i ==0 or i == 1:
pass
elif N % i == 0:
while N % i==0:
N /= i
count2 += 1
j =1
count3 = 0
while count2 - j >=0:
count2 -= j
j = j+1
count3 += 1
count += count3
count2 = 0
if count... | N = int(input())
a = []
count =0
count2 = 0
count3 = 0
X=int(N**0.5)
for i in range(X+1):
if i ==0 or i == 1:
pass
elif N % i == 0:
while N % i==0:
N /= i
count2 += 1
j =1
count3 = 0
while count2 - j >=0:
count2 -= j
j = j+1
count3 += 1
count += count3
count2 = 0
if N >1... | [
"assignment.value.change"
] | 384,311 | 384,312 | u916242112 | python |
p02660 | N = int(input())
N_prime = []
n = N
i = 2
while i <= N**0.5:
if n%i != 0:
i += 1
continue
N_prime.append(i)
n = n/i
if n == 1:
break
if N_prime == []:
N_prime.append(N)
elif n != 1:
N_prime.append(int(n))
ct = []
for i in N_prime:
if i not in ct:
ct.ap... | N = int(input())
N_prime = []
n = N
i = 2
while i <= N**0.5:
if n%i != 0:
i += 1
continue
N_prime.append(i)
n = n/i
if n == 1:
break
if N_prime == [] and N != 1:
N_prime.append(N)
elif n != 1:
N_prime.append(int(n))
ct = []
for i in N_prime:
if i not in ct:
... | [
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 384,313 | 384,314 | u945199633 | python |
p02660 | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collection... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collection... | [
"assignment.value.change"
] | 384,321 | 384,322 | u191874006 | python |
p02660 | import numpy as np
import sys
#import copy
def xnxn(n=0):
"""
args:
int n: a number of lows to read
example:
input 1
retrun 1
input 1 2 3
return [1,2,3]
input 1 2 3
4
return [[1,2,3],
[4]]
"""
if n ==... | import numpy as np
import sys
#import copy
def xnxn(n=0):
"""
args:
int n: a number of lows to read
example:
input 1
retrun 1
input 1 2 3
return [1,2,3]
input 1 2 3
4
return [[1,2,3],
[4]]
"""
if n ==... | [
"control_flow.branch.if.condition.change"
] | 384,340 | 384,341 | u731807761 | python |
p02660 | # @oj: atcoder
# @id: hitwanyang
# @email: 296866643@qq.com
# @date: 2020-06-05 15:25
# @url:https://atcoder.jp/contests/abc169/tasks/abc169_d
import sys,os
from io import BytesIO, IOBase
import collections,itertools,bisect,heapq,math,string
from decimal import *
# region fastio
BUFSIZE = 8192
BUFSIZE = 8192
class F... | # @oj: atcoder
# @id: hitwanyang
# @email: 296866643@qq.com
# @date: 2020-06-05 15:25
# @url:https://atcoder.jp/contests/abc169/tasks/abc169_d
import sys,os
from io import BytesIO, IOBase
import collections,itertools,bisect,heapq,math,string
from decimal import *
# region fastio
BUFSIZE = 8192
BUFSIZE = 8192
class F... | [] | 384,357 | 384,358 | u456936625 | python |
p02660 | def factorization(y):
arr = []
temp = y
for i in range(2, int(-(-y**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.a... | def factorization(y):
arr = []
temp = y
for i in range(2, int(-(-y**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.a... | [
"call.remove"
] | 384,361 | 384,362 | u385309449 | python |
p02660 | def prime_factorize(n):
a = {}
while n % 2 == 0:
if 2 not in a:
a[2] = 1
else:
a[2] += 1
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
if f not in a:
a[f] = 1
else:
a[f] += 1
n //... | def prime_factorize(n):
a = {}
while n % 2 == 0:
if 2 not in a:
a[2] = 1
else:
a[2] += 1
n //= 2
f = 3
while f * f <= n:
while n % f == 0:
if f not in a:
a[f] = 1
else:
a[f] += 1
n... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 384,371 | 384,372 | u934225857 | python |
p02660 | def prime_factorize(n):
a = {}
while n % 2 == 0:
if 2 not in a:
a[2] = 1
else:
a[2] += 1
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
if f not in a:
a[f] = 1
else:
a[f] += 1
n //... | def prime_factorize(n):
a = {}
while n % 2 == 0:
if 2 not in a:
a[2] = 1
else:
a[2] += 1
n //= 2
f = 3
while f * f <= n:
while n % f == 0:
if f not in a:
a[f] = 1
else:
a[f] += 1
n... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 384,373 | 384,372 | u934225857 | python |
p02660 | def prime_factorize(n):
a = {}
while n % 2 == 0:
if 2 not in a:
a[2] = 1
else:
a[2] += 1
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
if f not in a:
a[f] = 1
else:
a[f] += 1
n //... | def prime_factorize(n):
a = {}
while n % 2 == 0:
if 2 not in a:
a[2] = 1
else:
a[2] += 1
n //= 2
# print('[A]n:{}, a:{}'.format(n, a))
f = 3
while f * f <= n:
while n % f == 0:
if f not in a:
a[f] = 1
... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 384,371 | 384,374 | u934225857 | python |
p02660 | def prime_factorize(n):
a = {}
while n % 2 == 0:
if 2 not in a:
a[2] = 1
else:
a[2] += 1
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
if f not in a:
a[f] = 1
else:
a[f] += 1
n //... | def prime_factorize(n):
a = {}
while n % 2 == 0:
if 2 not in a:
a[2] = 1
else:
a[2] += 1
n //= 2
# print('[A]n:{}, a:{}'.format(n, a))
f = 3
while f * f <= n:
while n % f == 0:
if f not in a:
a[f] = 1
... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 384,373 | 384,374 | u934225857 | python |
p02660 | def resolve():
answer = 0
N = int(input())
if N==1:
print(answer)
else:
# 素因数pを見つける。範囲は2から√Nまででよい。
for p in range(2, int(N**0.5)+2):
e = 0
while (N % p == 0):
N /= p
e += 1
# z=p**eが見つかった
if e>0:
# eを1, 2, 3, 4...に分けられる回数カウント
for i in range(1, e+1):
if e >= i:
e -= i
... | def resolve():
answer = 0
N = int(input())
if N==1:
print(answer)
else:
# 素因数pを見つける。範囲は2から√Nまででよい。
for p in range(2, int(N**0.5)+2):
e = 0
while (N % p == 0):
N /= p
e += 1
# z=p**eが見つかった
if e>0:
# eを1, 2, 3, 4...に分けられる回数カウント
for i in range(1, e+1):
if e >= i:
e -= i
... | [
"assignment.value.change"
] | 384,375 | 384,376 | u090068671 | python |
p02660 | def resolve():
answer = 0
N = int(input())
if N==1:
print(answer)
else:
# 素因数pを見つける。範囲は2から√Nまででよい。
for p in range(2, int(N**0.5)+1):
e = 0
while (N % p == 0):
N /= p
e += 1
# z=p**eが見つかった
if e>0:
# eを1, 2, 3, 4...に分けられる回数カウント
for i in range(1, e+1):
if e >= i:
e -= i
... | def resolve():
answer = 0
N = int(input())
if N==1:
print(answer)
else:
# 素因数pを見つける。範囲は2から√Nまででよい。
for p in range(2, int(N**0.5)+2):
e = 0
while (N % p == 0):
N /= p
e += 1
# z=p**eが見つかった
if e>0:
# eを1, 2, 3, 4...に分けられる回数カウント
for i in range(1, e+1):
if e >= i:
e -= i
... | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"assignment.value.change"
] | 384,377 | 384,376 | u090068671 | python |
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==[]:
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==[]:
arr... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 384,386 | 384,387 | u699944218 | python |
p02660 | def factorization(n):
arr = []
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 arr
N = int(input())
ans = 0
... | def factorization(n):
arr = []
for i in range(2, int(-(-n**0.5//1))+1):
if n%i == 0:
cnt=0
while n%i == 0:
cnt += 1
n //= i
arr.append([i, cnt])
if n != 1:
arr.append([n, 1])
return arr
N = int(input())
ans = 0
if N !=... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.condition.change",
"call.arguments.change"
] | 384,393 | 384,394 | u268822556 | python |
p02660 | import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
rr = lambda: sys.stdin.buffer.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.buffer.readline())
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: l... | import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
rr = lambda: sys.stdin.buffer.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.buffer.readline())
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: l... | [
"assignment.add"
] | 384,399 | 384,400 | u823885866 | python |
p02660 | import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
rr = lambda: sys.stdin.buffer.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.buffer.readline())
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: l... | import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
rr = lambda: sys.stdin.buffer.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.buffer.readline())
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: l... | [
"identifier.change"
] | 384,401 | 384,400 | u823885866 | python |
p02660 | import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
rr = lambda: sys.stdin.buffer.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.buffer.readline())
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: l... | import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
rr = lambda: sys.stdin.buffer.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.buffer.readline())
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: l... | [
"identifier.change"
] | 384,402 | 384,400 | u823885866 | python |
p02660 | 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 number > 1:
... | 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 number > 1:
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 384,403 | 384,404 | u078816252 | python |
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)
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)
if arr == []... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 384,415 | 384,416 | u939026953 | python |
p02660 | import math
N = int(input())
x = N
n = math.floor(math.sqrt(N))
p = {}
i = 2
while i <= n:
while x % i == 0:
p.setdefault(i, 0)
p[i] += 1
x //= i
i += 1
if x != 1 and x == N:
p.setdefault(N, 1)
ans = 0
for v in p.values():
i = 1
while v - i >= 0:
v -= i
... | import math
N = int(input())
x = N
n = math.floor(math.sqrt(N))
p = {}
i = 2
while i <= n:
while x % i == 0:
p.setdefault(i, 0)
p[i] += 1
x //= i
i += 1
if x != 1:
p.setdefault(x, 1)
ans = 0
for v in p.values():
i = 1
while v - i >= 0:
v -= i
ans += 1
... | [
"identifier.change",
"call.arguments.change"
] | 384,417 | 384,418 | u811967730 | python |
p02660 | N = int(input())
def prime_factorization(N):
n = int(N**0.5)
numList = [i if i != 1 else 2 for i in range(1, n, 2) ]
primeList = [2]
ansDict = {}
idx = 0
for data in numList:
for x in primeList:
if (data%x != 0 or x == 2):
count = 0
while N%data == 0:
count += 1
... | N = int(input())
def prime_factorization(N):
n = int(N**0.5)+1
numList = [i if i != 1 else 2 for i in range(1, n, 2) ]
primeList = [2]
ansDict = {}
idx = 0
for data in numList:
for x in primeList:
if (data%x != 0 or x == 2):
count = 0
while N%data == 0:
count += 1
... | [
"control_flow.branch.if.condition.change"
] | 384,419 | 384,420 | u909514237 | python |
p02660 | N = int(input())
def prime_factorize(n):
prime_list = []
tmp = n
if n == 1:
return [1]
for i in range(2,int(n**0.5)+1):
if tmp % i == 0:
while tmp % i == 0:
tmp = tmp // i
prime_list.append(i)
if tmp != 1:
prime_li... | N = int(input())
def prime_factorize(n):
prime_list = []
tmp = n
if n == 1:
return []
for i in range(2,int(n**0.5)+1):
if tmp % i == 0:
while tmp % i == 0:
tmp = tmp // i
prime_list.append(i)
if tmp != 1:
prime_lis... | [] | 384,421 | 384,422 | u698919163 | python |
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 = count(n, 2)
d[... | 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 = count(n, 2)
d[... | [
"call.remove"
] | 384,423 | 384,424 | u307622233 | python |
p02660 | import sys
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
from collections import deque
from bisect import bisect_left
from itertools import product
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readlin... | import sys
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
from collections import deque
from bisect import bisect_left
from itertools import product
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readlin... | [
"control_flow.loop.condition.change"
] | 384,425 | 384,426 | u380995377 | python |
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 arr==[]:
arr.append([tmp,1])
return arr
N=int(input())
a... | 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
N=int(input())... | [
"control_flow.branch.if.condition.change"
] | 384,439 | 384,440 | u338597441 | python |
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 temp!=1:
arr.append([tmp, 1])
if arr==[]:
arr.append([n,... | 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.append([tmp,1... | [
"expression.operation.unary.arithmetic.remove",
"call.arguments.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 384,441 | 384,442 | u338597441 | python |
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 temp!=1:
arr.append([tmp, 1])
if arr==[]:
arr.append([tm... | 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.append([tmp,1... | [
"expression.operation.unary.arithmetic.remove",
"call.arguments.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 384,443 | 384,442 | u338597441 | python |
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 temp!=1:
arr.append([tmp, 1])
if arr==[]:
arr.append([n,... | 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.append([tmp... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 384,441 | 384,444 | u338597441 | python |
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 temp!=1:
arr.append([tmp, 1])
if arr==[]:
arr.append([tm... | 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.append([tmp... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 384,443 | 384,444 | u338597441 | python |
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
if i n... | 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
if i n... | [
"assignment.add",
"assignment.remove"
] | 384,445 | 384,446 | u699296734 | python |
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
if i n... | 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
if i n... | [
"assignment.add",
"assignment.remove"
] | 384,445 | 384,447 | u699296734 | python |
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
if i n... | 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
if i n... | [
"assignment.add"
] | 384,445 | 384,448 | u699296734 | python |
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
if i n... | 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
if i n... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 384,449 | 384,448 | u699296734 | python |
p02660 | from collections import defaultdict
from itertools import accumulate
def main():
n = int(input())
prime_counter = defaultdict(int)
acc = tuple(accumulate(range(1, 42))) # 10^12 < 2^39
f = 2
while f * f <= n:
if n % f == 0:
n //= f
prime_counter[f] += 1
els... | from collections import defaultdict
from itertools import accumulate
def main():
n = int(input())
prime_counter = defaultdict(int)
acc = tuple(accumulate(range(1, 42))) # 10^12 < 2^39
f = 2
while f * f <= n:
if n % f == 0:
n //= f
prime_counter[f] += 1
els... | [
"identifier.change",
"variable_access.subscript.index.change"
] | 384,452 | 384,453 | u512212329 | python |
p02660 | from collections import defaultdict
from itertools import accumulate
def main():
n = int(input())
prime_counter = defaultdict(int)
acc = tuple(accumulate(range(1, 42))) # 10^12 < 2^39
f = 2
while n % f == 0:
n //= f
prime_counter[f] += 1
f = 3
while f * f <= n:
if... | from collections import defaultdict
from itertools import accumulate
def main():
n = int(input())
prime_counter = defaultdict(int)
acc = tuple(accumulate(range(1, 42))) # 10^12 < 2^39
f = 2
while n % f == 0:
n //= f
prime_counter[f] += 1
f = 3
while f * f <= n:
if... | [
"identifier.change",
"variable_access.subscript.index.change"
] | 384,454 | 384,455 | u512212329 | python |
p02660 | import math
#nの素因数分解(O(n**0.5)
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
N = int(input())
ans = 0
howmany = []
nums = sorted(prime_factor(N))
if len(nums)>0:
cou... | import math
#nの素因数分解(O(n**0.5)
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
N = int(input())
ans = 0
howmany = []
nums = sorted(prime_factor(N))
if len(nums)>0:
cou... | [
"call.remove"
] | 384,464 | 384,465 | u136843617 | python |
p02660 | import sys
sys.setrecursionlimit(1000000)
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
from collections import defaultdict
n = I()
def p... | import sys
sys.setrecursionlimit(1000000)
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
from collections import defaultdict
n = I()
def pr... | [
"control_flow.break.add"
] | 384,466 | 384,467 | u190850294 | python |
p02660 | n=int(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[x]=1
a=0
for i in d.values():
t=c=0
while t+c<i: c+=1; t+=c
a+=c
print(a) | n=int(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 d.values():
t=c=0
while t+c<i: c+=1; t+=c
a+=c
print(a) | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 384,473 | 384,474 | u133936772 | python |
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==[]:
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==[]:
arr... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 384,479 | 384,480 | u521866787 | python |
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==[]:
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==[]:
arr... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 384,481 | 384,480 | u521866787 | python |
p02660 | N=int(input())
NN = N
i = 2
ans = 0
while i*i <= NN:
if N%i==0:
j = 0
while N%i==0:
N /= i
j+=1
k = 1
while j>0:
if j - k < 0: break
ans += 1
# print(i,ans,j,k)
j -= k
k += 1
i += 1
if NN == N and N != 1:
ans += 1
print(ans)
| N=int(input())
NN = N
i = 2
ans = 0
while i*i <= NN:
if N%i==0:
j = 0
while N%i==0:
N /= i
j+=1
k = 1
while j>0:
if j - k < 0: break
ans += 1
# print(i,ans,j,k)
j -= k
k += 1
i += 1
if N != 1:
ans += 1
print(ans)
| [] | 384,484 | 384,485 | u107091170 | python |
p02660 | N = int(input())
#素因数分解
def factorize_dict(n):
b = 2
fct = dict()
while b * b <= n:
while n % b == 0:
n //= b
#fct.append(b)
if b not in fct:
fct[b] = 1
else:
fct[b] += 1
b = b + 1
if n > 1:
#fct.app... | N = int(input())
#素因数分解
def factorize_dict(n):
b = 2
fct = dict()
while b * b <= n:
while n % b == 0:
n //= b
#fct.append(b)
if b not in fct:
fct[b] = 1
else:
fct[b] += 1
b = b + 1
if n > 1:
#fct.app... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 384,486 | 384,487 | u314089899 | python |
p02660 | n = int(input())
ans = 0
for i in range(2,int(n**0.5)+1):
count = 1
loop = 1
while n % i == 0:
n = int(n/i)
count -= 1
if count == 0:
ans += 1
loop += 1
count = loop
if n > 1:
ans = 1
print(ans) | n = int(input())
ans = 0
for i in range(2,int(n**0.5)+1):
count = 1
loop = 1
while n % i == 0:
n = int(n/i)
count -= 1
if count == 0:
ans += 1
loop += 1
count = loop
if n > 1:
ans += 1
print(ans) | [
"assignment.value.change"
] | 384,492 | 384,493 | u179508038 | python |
p02660 | n = int(input())
ans = 0
for i in range(2,int(n**0.5)+1):
count = 1
loop = 1
while n % i == 0:
n = int(n/i)
count -= 1
if count == 0:
ans += 1
loop += 1
count = loop
if ans == 0 and n > 1:
ans = 1
print(ans) | n = int(input())
ans = 0
for i in range(2,int(n**0.5)+1):
count = 1
loop = 1
while n % i == 0:
n = int(n/i)
count -= 1
if count == 0:
ans += 1
loop += 1
count = loop
if n > 1:
ans += 1
print(ans) | [
"assignment.value.change"
] | 384,494 | 384,493 | u179508038 | python |
p02660 | import collections
def primes(n): #試し割り法で各素因数とその指数を求める
cnt=collections.defaultdict(int)
for i in range(2,int(n**0.5)+1):
if n%i==0:
while n%i==0:
cnt[i]+=1
n//=i
if n!=1:
cnt[n]+=1
return cnt
n=int(input())
cnt=primes(n)
ans=0
for key in cnt.keys():
val=cnt[key]
print(key,val)
... | import collections
def primes(n): #試し割り法で各素因数とその指数を求める
cnt=collections.defaultdict(int)
for i in range(2,int(n**0.5)+1):
if n%i==0:
while n%i==0:
cnt[i]+=1
n//=i
if n!=1:
cnt[n]+=1
return cnt
n=int(input())
cnt=primes(n)
ans=0
for key in cnt.keys():
val=cnt[key]
for i in range(1... | [
"call.remove"
] | 384,497 | 384,498 | u254221913 | python |
p02660 | import math
N = int(input())
fact = set()
counter = 0
for i in range(2, int(math.sqrt(N))+1):
if N % i != 0:
continue
powt = 0
while N % i == 0:
powt += 1
N /= i
fact.add((i, powt))
if N != 1:
fact.add((N, 1))
for base, e in fact:
for t in range(1, e+1):
if t... | import math
N = int(input())
fact = set()
counter = 0
for i in range(2, int(math.sqrt(N))+1):
if N % i != 0:
continue
powt = 0
while N % i == 0:
powt += 1
N /= i
fact.add((i, powt))
if N != 1:
fact.add((N, 1))
for base, e in fact:
for t in range(1, e+1):
if t... | [
"call.remove"
] | 384,511 | 384,512 | u338904752 | python |
p02660 | N = int(input())
ans = 0
temp = N
fact = []
if N == 1:
print(0)
exit()
for i in range(2, int(N ** 0.5 + 2)):
if temp % i == 0:
n = 0
while temp % i == 0:
temp //= i
n += 1
fact.append(n)
if temp != 1:
fact.append(1)
print(fact)
ans = 0
for f in fact:
... | N = int(input())
ans = 0
temp = N
fact = []
if N == 1:
print(0)
exit()
for i in range(2, int(N ** 0.5 + 2)):
if temp % i == 0:
n = 0
while temp % i == 0:
temp //= i
n += 1
fact.append(n)
if temp != 1:
fact.append(1)
ans = 0
for f in fact:
n = f
... | [
"call.remove"
] | 384,572 | 384,573 | u056358163 | python |
p02660 | n = int(input())
"""nを素因数分解"""
"""2以上の整数n => [[素因数, 指数], ...]の2次元リスト"""
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])
... | n = int(input())
"""nを素因数分解"""
"""2以上の整数n => [[素因数, 指数], ...]の2次元リスト"""
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])
... | [
"identifier.replace.add",
"literal.replace.remove"
] | 384,574 | 384,575 | u480200603 | python |
p02660 | import sys
sys.setrecursionlimit(1000000000)
import math
from math import gcd
def lcm(a, b): return a * b // gcd(a, b)
from itertools import count, permutations, chain
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, in... | import sys
sys.setrecursionlimit(1000000000)
import math
from math import gcd
def lcm(a, b): return a * b // gcd(a, b)
from itertools import count, permutations, chain
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, in... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 384,584 | 384,585 | u402629484 | python |
p02660 | import collections
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(input())
c = coll... | import collections
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(input())
c = coll... | [
"control_flow.branch.if.add",
"control_flow.break.add"
] | 384,590 | 384,591 | u395894569 | python |
p02660 | # 素因数分解
# O(N**0.5)
def p_bunkai(N):
ret = []
for i in range(2, int(N ** 0.5) + 1):
if N % i == 0:
count = 0
while N % i == 0:
N //= i
count += 1
ret.append((i, count))
if N != 1:
ret.append((N, 1))
return ret
N = int(i... | # 素因数分解
# O(N**0.5)
def p_bunkai(N):
ret = []
for i in range(2, int(N ** 0.5) + 1):
if N % i == 0:
count = 0
while N % i == 0:
N //= i
count += 1
ret.append((i, count))
if N != 1:
ret.append((N, 1))
return ret
N = int(i... | [
"identifier.replace.add",
"literal.replace.remove"
] | 384,594 | 384,595 | u887142477 | python |
p02660 | # import sys
# import math #sqrt,gcd,pi
# import decimal
# import queue # queue
# import bisect
# import heapq # priolity-queue
# import time
# from itertools import product,permutations,\
# combinations,combinations_with_replacement
# 重複あり順列、順列、組み合わせ、重複あり組み合わせ
# import collections # deque
# from operator import it... | # import sys
# import math #sqrt,gcd,pi
# import decimal
# import queue # queue
# import bisect
# import heapq # priolity-queue
# import time
# from itertools import product,permutations,\
# combinations,combinations_with_replacement
# 重複あり順列、順列、組み合わせ、重複あり組み合わせ
# import collections # deque
# from operator import it... | [
"control_flow.branch.if.condition.change"
] | 384,596 | 384,597 | u807028974 | python |
p02660 | 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])
return ret
def... | 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])
return ret
def... | [
"misc.typo",
"control_flow.loop.condition.change"
] | 384,604 | 384,605 | u057668615 | python |
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 += odd
retu... | 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 += odd
retu... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 384,606 | 384,607 | u057668615 | python |
p02660 | 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=... |
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... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 384,608 | 384,609 | u576432509 | python |
p02660 | from math import sqrt
from bisect import bisect
def main():
N = int(input())
factor = {}
max_count = 1
while N > 1:
for i in range(2, int(sqrt(N))+1):
if N % i == 0:
N = N // i
if i in factor:
factor[i] += 1
if... | from math import sqrt
from bisect import bisect
def main():
N = int(input())
factor = {}
max_count = 1
while N > 1:
for i in range(2, int(sqrt(N)) + 1):
if N % i == 0:
N = N // i
if i in factor:
factor[i] += 1
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 384,621 | 384,622 | u479719434 | python |
p02660 | from math import sqrt
from bisect import bisect
def main():
N = int(input())
factor = {}
max_count = 1
while N > 1:
for i in range(2, int(sqrt(N))):
if N % i == 0:
N = N // i
if i in factor:
factor[i] += 1
if m... | from math import sqrt
from bisect import bisect
def main():
N = int(input())
factor = {}
max_count = 1
while N > 1:
for i in range(2, int(sqrt(N)) + 1):
if N % i == 0:
N = N // i
if i in factor:
factor[i] += 1
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 384,623 | 384,622 | u479719434 | python |
p02660 | from math import sqrt
N = int(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 * i, rn + 1, i):
... | from math import sqrt
N = int(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 * i, rn + 1, i):
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 384,624 | 384,625 | u347640436 | python |
p02660 | n = int(input())
if n == 1:
print(0)
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.app... | n = int(input())
if n == 1:
print(0)
else:
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... | [] | 384,646 | 384,647 | u470542271 | python |
p02660 | n = int(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
print(ans) | n = int(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)
| [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 384,656 | 384,657 | u018168283 | python |
p02660 | n = int(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
print(ans) | n = int(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)
| [
"assignment.change"
] | 384,658 | 384,657 | u018168283 | python |
p02660 | n = int(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
print(ans) | n = int(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) | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 384,656 | 384,659 | u018168283 | python |
p02660 | n = int(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
print(ans) | n = int(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) | [
"assignment.change"
] | 384,656 | 384,660 | u018168283 | python |
p02660 | n = int(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
print(ans) | n = int(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) | [
"assignment.value.change"
] | 384,658 | 384,660 | u018168283 | python |
p02660 | from collections import defaultdict
N = int(input())
def prime_factorization(N):
PC = defaultdict(int)
P = 2
while N % P == 0:
PC[P] += 1
N //= P
P = 3
while P * P <= N:
if N % P == 0:
PC[P] += 1
N //= P
else:
P += 2
if N ... | from collections import defaultdict
N = int(input())
def prime_factorization(N):
PC = defaultdict(int)
P = 2
while N % P == 0:
PC[P] += 1
N //= P
P = 3
while P * P <= N:
if N % P == 0:
PC[P] += 1
N //= P
else:
P += 2
if N ... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"identifier.replace.add",
"literal.replace.remove"
] | 384,677 | 384,678 | u165429863 | python |
p02660 | #D
import math
N = int(input())
Nsyo = N
count = 0
div = 2
divcount = 0
divlist = []
while N > 1 and div <= math.sqrt(Nsyo)+1:
if N%div == 0:
while N%div == 0:
N = N/div
divcount = divcount+1
divlist.append(divcount)
divcount = 0
else:
pass
div = div +... | #D
import math
N = int(input())
Nsyo = N
count = 0
div = 2
divcount = 0
divlist = []
while N > 1 and div <= math.sqrt(Nsyo)+1:
if N%div == 0:
while N%div == 0:
N = N/div
divcount = divcount+1
divlist.append(divcount)
divcount = 0
else:
pass
div = div +... | [
"assignment.change"
] | 384,687 | 384,688 | u601426916 | python |
p02660 | 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,... | 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(... | [
"literal.number.integer.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 384,711 | 384,712 | u486251525 | python |
p02660 | from math import sqrt
n=int(input())
rn=int(sqrt(n))
s=[0]*(rn+1)
s[0]=-1
s[1]=-1
t=[0]*(rn+1)
for i in range(2,rn+1):
if s[i] != 0:
continue
s[i] = i
j = i
while j < rn + 1:
t[j] = 1
j *= i
for j in range(i * i, rn + 1,i):
if s[j] == 0:
s[j] == i
result ... | from math import sqrt
n=int(input())
rn=int(sqrt(n))
s=[0]*(rn+1)
s[0]=-1
s[1]=-1
t=[0]*(rn+1)
for i in range(2,rn+1):
if s[i] != 0:
continue
s[i] = i
j = i
while j < rn + 1:
t[j] = 1
j *= i
for j in range(i * i, rn + 1,i):
if s[j] == 0:
s[j] = i
result =... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 384,720 | 384,721 | u880480312 | python |
p02660 | from math import ceil
n = int(input())
pf = []
t = n
if n == 1:
print(0)
exit()
for i in range(2, ceil(n ** 0.5) + 1):
c = 0
while t % i == 0:
c += 1
t //= i
if c > 0: pf.append(c)
if pf == []: pf.append(1)
ans = 0
for i in pf:
tmp = i
j = 1
while j <= tmp:
tmp -... | from math import ceil
n = int(input())
pf = []
t = n
if n == 1:
print(0)
exit()
for i in range(2, ceil(n ** 0.5) + 1):
c = 0
while t % i == 0:
c += 1
t //= i
if c > 0: pf.append(c)
if t != 1: pf.append(1)
ans = 0
for i in pf:
tmp = i
j = 1
while j <= tmp:
tmp -= ... | [
"control_flow.branch.if.condition.change"
] | 384,725 | 384,726 | u067694718 | python |
p02660 | from math import floor
n = int(input())
pf = []
t = n
if n == 1:
print(0)
exit()
for i in range(2, floor(n ** 0.5) + 1):
c = 0
while t % i == 0:
c += 1
t //= i
if c > 0: pf.append(c)
if pf == []: pf.append(1)
ans = 0
for i in pf:
tmp = i
j = 1
while j <= tmp:
tmp... | from math import ceil
n = int(input())
pf = []
t = n
if n == 1:
print(0)
exit()
for i in range(2, ceil(n ** 0.5) + 1):
c = 0
while t % i == 0:
c += 1
t //= i
if c > 0: pf.append(c)
if t != 1: pf.append(1)
ans = 0
for i in pf:
tmp = i
j = 1
while j <= tmp:
tmp -= ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.branch.if.condition.change"
] | 384,727 | 384,726 | u067694718 | python |
p02660 | from sys import stdin
import math
def I(): return int(stdin.readline().rstrip())
n = I()
m = n
l = []
for i in range(2,int(math.sqrt(n))+1):
if n==1 or n<i:
break
if n%i==0:
c = 0
while n%i==0:
n//=i
c += 1
for j in range(1,c+1):
l.append(i**j... | from sys import stdin
import math
def I(): return int(stdin.readline().rstrip())
n = I()
m = n
l = []
for i in range(2,int(math.sqrt(n))+1):
if n==1 or n<i:
break
if n%i==0:
c = 0
while n%i==0:
n//=i
c += 1
for j in range(1,c+1):
l.append(i**j... | [
"call.remove"
] | 384,731 | 384,732 | u844895214 | python |
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==[]:
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==[]:
arr... | [
"call.remove"
] | 384,743 | 384,744 | u449473917 | python |
p02660 | 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(cnt)
if temp!=1:
arr.append(1)
if arr=... | 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(cnt)
if temp!=1:
arr.append(1)
if arr=... | [
"call.add",
"call.arguments.change"
] | 384,773 | 384,774 | u483391772 | python |
p02660 | import itertools
import decimal
import math
import collections
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... | import itertools
import decimal
import math
import collections
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... | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 384,783 | 384,784 | u457460736 | python |
p02660 | n = int(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)
return a
a = prime_factorize(n)
b = l... | n = int(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)
return a
a = prime_factorize(n)
b = l... | [
"call.add"
] | 384,794 | 384,795 | u328179275 | python |
p02660 | n = int(input())
def prime_factors(n):
i = 2
factors = []
while i * i <= n:
if n % i:
i += 1
else:
n //= i
factors.append(i)
if n > 1:
factors.append(n)
return factors
f = list(set(prime_factors(n)))
print(f)
ans = 0
for i in f:
e = 1
... | n = int(input())
def prime_factors(n):
i = 2
factors = []
while i * i <= n:
if n % i:
i += 1
else:
n //= i
factors.append(i)
if n > 1:
factors.append(n)
return factors
f = list(set(prime_factors(n)))
ans = 0
for i in f:
e = 1
while... | [
"call.remove"
] | 384,800 | 384,801 | u398930122 | python |
p02660 | import math
import collections
def trial_division(n):
factor = []
tmp = int(math.sqrt(n)) + 1
for num in range(2, tmp):
while n % num == 0:
n //= num
if num != 1:
factor.append(num)
if not factor:
return -1
else:
factor.append(n)
... | import math
import collections
def trial_division(n):
factor = []
tmp = int(math.sqrt(n)) + 1
for num in range(2, tmp):
while n % num == 0:
n //= num
if num != 1:
factor.append(num)
if not factor:
return -1
else:
factor.append(n)
... | [
"call.remove"
] | 384,819 | 384,820 | u256027816 | python |
p02660 | import math
import collections
def trial_division(n):
factor = []
tmp = int(math.sqrt(n)) + 1
for num in range(2, tmp):
while n % num == 0:
n //= num
if num != 1:
factor.append(num)
if not factor:
return -1
else:
factor.append(n)
... | import math
import collections
def trial_division(n):
factor = []
tmp = int(math.sqrt(n)) + 1
for num in range(2, tmp):
while n % num == 0:
n //= num
if num != 1:
factor.append(num)
if not factor:
return -1
else:
factor.append(n)
... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"io.output.change"
] | 384,821 | 384,820 | u256027816 | python |
p02660 | import math,sys
ans=0
def factorization(n):
num=0
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])
num=num+1
if temp!=1:
... | import math,sys
ans=0
def factorization(n):
num=0
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])
num=num+1
if temp!=1:
... | [
"call.add"
] | 384,822 | 384,823 | u016843859 | python |
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==[]:
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==[]:
arr... | [
"io.output.change",
"call.arguments.change"
] | 384,824 | 384,825 | u722761145 | python |
p02660 | import math
n=int(input())
def factorization(num):
factor = []
flag = True
is_Prime= True
if num == 1:
is_Prime = False
while num > 1 and flag:
flag = False
for i in range(int(math.sqrt(num))+2):
k = i + 2
if num % k == 0:
factor.append... | import math
n=int(input())
def factorization(num):
factor = []
flag = True
is_Prime= True
if num == 1:
is_Prime = False
while num > 1 and flag:
flag = False
for i in range(int(math.sqrt(num))+2):
k = i + 2
if num % k == 0:
factor.append... | [
"control_flow.branch.if.condition.change"
] | 384,828 | 384,829 | u984592063 | python |
p02660 | import collections
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
if __name__=="__main__":
... | import collections
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
if __name__=="__main__":
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 384,830 | 384,831 | u701893485 | python |
p02660 | n = int(input())
b = n
def pf(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
l = list(set(pf(n)))
cnt = 0
for i in... | n = int(input())
b = n
def pf(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
l = list(set(pf(n)))
cnt = 0
for i in... | [
"call.remove"
] | 384,836 | 384,837 | u010178026 | python |
p02660 | import math
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])
... | import math
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])
... | [
"misc.opposites",
"identifier.change"
] | 384,840 | 384,841 | u405137387 | python |
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==[]:
a... | 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==[]:
a... | [
"call.remove"
] | 384,848 | 384,849 | u201986772 | python |
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==[]:
a... | 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==[]:
a... | [
"call.remove",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 384,850 | 384,849 | u201986772 | python |
p02660 | import sys
n=int(input())
if n == 1:
print(0)
sys.exit()
orgn=n
counter=0
for i in range(2,int((n**0.5) + 1) ):
if n % i == 0:
counter += 1
n //= i
wari=i**2
while n % wari == 0:
counter +=1
n //= wari
wari *= i
while n %... | import sys
n=int(input())
if n == 1:
print(0)
sys.exit()
orgn=n
counter=0
for i in range(2,int((n**0.5) + 1) ):
if n % i == 0:
counter += 1
n //= i
wari=i**2
while n % wari == 0:
counter +=1
n //= wari
wari *= i
while n %... | [
"call.add",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 384,854 | 384,855 | u485979475 | python |
p02660 | import sys
n=int(input())
if n == 1:
print(0)
sys.exit()
orgn=n
counter=0
for i in range(2,int((n**0.5) + 1) ):
if n % i == 0:
counter += 1
n //= i
wari=i**2
while n % wari == 0:
counter +=1
n //= wari
wari *= i
while n %... | import sys
n=int(input())
if n == 1:
print(0)
sys.exit()
orgn=n
counter=0
for i in range(2,int((n**0.5) + 1) ):
if n % i == 0:
counter += 1
n //= i
wari=i**2
while n % wari == 0:
counter +=1
n //= wari
wari *= i
while n %... | [
"call.add"
] | 384,856 | 384,855 | u485979475 | python |
p02660 | history = set([])
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_divisors[::-1]
def fac... | history = set([])
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_divisors[::-1]
def fac... | [
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 384,857 | 384,858 | u536781361 | python |
p02660 | N = int(input())
import heapq
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,i, cnt])
if temp!=1:
arr.append(... | N = int(input())
import heapq
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,i, cnt])
if temp!=1:
arr.append(... | [
"call.remove"
] | 384,862 | 384,863 | u648901783 | python |
p02660 | N = int(input())
import heapq
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,i, cnt])
if temp!=1:
arr.append([te... | N = int(input())
import heapq
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,i, cnt])
if temp!=1:
arr.append(... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.condition.change",
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 384,864 | 384,863 | u648901783 | python |
p02660 | N = int(input())
ans = 0
# if N % 2 == 0:
# i = 1
# while N % 2**i == 0:
# N //= 2**i
# ans += 1
# i += 1
# if N % 3 == 0:
# i = 1
# while N % 3**i == 0:
# N //= 3**i
# ans += 1
# i += 1
# if N % 5 == 0:
# i = 1
# while N % 5**i == 0:
# ... | N = int(input())
ans = 0
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 set(a)
prime_list = p... | [
"call.remove"
] | 384,868 | 384,869 | u982591663 | python |
p02660 | #!/usr/bin/env python3
import sys
import pprint
import math
sys.setrecursionlimit(10 ** 6)
class Logger:
def __init__(self, debug):
self.debug = debug
def print(self, *args):
if self.debug:
pprint.pprint(args)
def prime_fact(n):
p = {}
for i in range(2, int(-(-n**0.5//1))+1):
if n % i == 0:
while n ... | #!/usr/bin/env python3
import sys
import pprint
import math
sys.setrecursionlimit(10 ** 6)
class Logger:
def __init__(self, debug):
self.debug = debug
def print(self, *args):
if self.debug:
pprint.pprint(args)
def prime_fact(n):
p = {}
for i in range(2, int(-(-n**0.5//1))+1):
if n % i == 0:
while n ... | [
"identifier.replace.add",
"literal.replace.remove"
] | 384,891 | 384,892 | u620755587 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.