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 |
|---|---|---|---|---|---|---|---|
p02659 | a,b=map(str,input().split())
a=int(a)
b=float(b)
ans=a*b
import math
print(math.floor(ans)) | a,b=map(str,input().split())
from decimal import Decimal
a=Decimal(a)
b=Decimal(b)
ans=a*b
import math
print(math.floor(ans)) | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 383,210 | 383,211 | u924783770 | python |
p02659 |
def main():
A, B = input().split()
A = int(A)
B = float(B)
ans = A*B
ans = int(ans)
print(ans)
if __name__ == '__main__':
main() |
from decimal import Decimal
def main():
A, B = input().split()
A = Decimal(A)
B = Decimal(B)
ans = A*B
ans = int(ans)
print(ans)
if __name__ == '__main__':
main() | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 383,221 | 383,222 | u476674874 | python |
p02659 | import math
a,b = input().split()
a = int(a)
b = float(b)
print(math.floor(a * b)) | import math
from decimal import *
a,b = input().split()
a = int(a)
b = Decimal(b)
print(math.floor(a * b)) | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 383,231 | 383,232 | u846463155 | python |
p02659 | import math
from decimal import *
getcontext().prec = 300
a,b = map(float,input().split())
print(math.floor(Decimal(a) * Decimal(b))) | import math
from decimal import *
getcontext().prec = 300
a,b = map(Decimal,input().split())
print(math.floor(Decimal(a) * Decimal(b))) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 383,240 | 383,241 | u476124554 | python |
p02659 | import math
from decimal import *
getcontext().prec = 28
a,b = map(float,input().split())
print(math.floor(Decimal(a) * Decimal(b))) | import math
from decimal import *
getcontext().prec = 300
a,b = map(Decimal,input().split())
print(math.floor(Decimal(a) * Decimal(b))) | [
"literal.number.integer.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 383,242 | 383,241 | u476124554 | python |
p02659 | import math
a, b = input().split()
res = int(a) * round(float(b) * 100)
print(int(res / 100))
| import math
a, b = input().split()
res = int(a) * round(float(b) * 1000)
print(res // 1000)
| [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"call.remove"
] | 383,251 | 383,252 | u706929073 | python |
p02659 | a,b = input().split()
a = int(a)
b = Decimal(b)
print(int(a*b)) | a,b = input().split()
from decimal import Decimal
a = int(a)
b = Decimal(b)
print(int(a*b)) | [] | 383,255 | 383,256 | u573234244 | python |
p02659 | import math
A, B = input().split()
A = int(A)
B = float(B)
print(math.floor(A*B)) | import math
from decimal import Decimal
A, B = input().split()
A = Decimal(A)
B = Decimal(B)
print(math.floor(A*B)) | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 383,269 | 383,270 | u729083717 | python |
p02659 | A, B = input().split()
A = int(A)
B = float(B)
print(int(A * B)) | from decimal import Decimal
A, B = input().split()
A = Decimal(A)
B = Decimal(B)
print(int(A * B)) | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 383,273 | 383,274 | u512099209 | python |
p02659 | n,m = map(str,input().split())
n = int(n)
m = float(m)
print(int(n * m)) | from decimal import Decimal
n,m = map(str,input().split())
n = Decimal(n)
m = Decimal(m)
print(int(n * m)) | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 383,281 | 383,282 | u593019570 | python |
p02659 | # -*- coding: utf-8 -*-
a,b = list(map(float,input().split()))
from decimal import Decimal
a = Decimal(a)
b = Decimal(b)
print(int(a*b))
| # -*- coding: utf-8 -*-
a,b = list(input().split())
from decimal import Decimal
a = Decimal(a)
b = Decimal(b)
print(int(a*b)) | [
"call.remove",
"call.arguments.change"
] | 383,290 | 383,291 | u704001626 | python |
p02659 | A, B = [float(i) for i in input().split()]
print(int(A * B)) | from decimal import Decimal
A, B = [Decimal(i) for i in input().split()]
print(int(A * B))
| [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 383,298 | 383,299 | u710515311 | python |
p02659 | a, b = input().split()
print(int(int(a) * float(b) // 1))
| from decimal import Decimal
a, b = input().split()
print(int(Decimal(a) * Decimal(b) // 1))
| [
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 383,309 | 383,310 | u313291636 | python |
p02659 | A,B = input().split()
ans = int(A)*float(B)
print(int(ans))
| from decimal import *
A,B = input().split()
ans = int(A)*Decimal(B)
print(int(ans)) | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 383,360 | 383,361 | u032798323 | python |
p02659 | import sys
from decimal import Decimal
input = sys.stdin.readline
def main():
A, B = map(float, input().split())
a = Decimal(A)
b = Decimal(B)
ans = a * b
ans = int(ans)
print(ans)
if __name__ == "__main__":
main()
| import sys
from decimal import Decimal
input = sys.stdin.readline
def main():
A, B = input().split()
a = Decimal(A)
b = Decimal(B)
ans = a * b
ans = int(ans)
print(ans)
if __name__ == "__main__":
main()
| [
"call.remove",
"call.arguments.change"
] | 383,364 | 383,365 | u934442292 | python |
p02659 | a, b = input().split()
a = int(a)
b = float(b)
ans = int(a * b)
print(ans) | from decimal import Decimal
a, b = input().split()
a = Decimal(a)
b = Decimal(b)
ans = int(a * b)
print(ans) | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 383,372 | 383,373 | u802963389 | python |
p02659 | # -*- coding: utf-8 -*-
# 入力を整数に変換して受け取る
def input_int():
return int(input())
# マイナス1した値を返却
def int1(x):
return int(x) - 1
# 半角スペース区切り入力をIntに変換してMapで受け取る
def input_to_int_map():
return map(int, input().split())
# 半角スペース区切り入力をIntに変換して受け取る
def input_to_int_tuple():
return tuple(map(int, input().sp... | # -*- coding: utf-8 -*-
# 入力を整数に変換して受け取る
def input_int():
return int(input())
# マイナス1した値を返却
def int1(x):
return int(x) - 1
# 半角スペース区切り入力をIntに変換してMapで受け取る
def input_to_int_map():
return map(int, input().split())
# 半角スペース区切り入力をIntに変換して受け取る
def input_to_int_tuple():
return tuple(map(int, input().sp... | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 383,376 | 383,377 | u852210959 | python |
p02659 | from math import trunc
a, b = [float(i) for i in input().split()]
print(int(a*b)) | from math import trunc
from decimal import Decimal
a, b = [Decimal(i) for i in input().split()]
print(trunc(a * b)) | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change",
"io.output.change"
] | 383,392 | 383,393 | u215115622 | python |
p02659 | from sys import stdin
A,B = [float(x) for x in stdin.readline().rstrip().split()]
print(int(A*B)) | from sys import stdin
from decimal import Decimal
A,B = [Decimal(x) for x in stdin.readline().rstrip().split()]
print(int(A*B)) | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 383,402 | 383,403 | u405256066 | python |
p02659 | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**8)
INF = float("inf")
import math
def main():
A, B = input().split()
A = int(A)
B1, B2 = map(int, B.split("."))
tot = A*B1
tot += int((A*B2)/100)
print(tot)
return
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**8)
INF = float("inf")
import math
def main():
A, B = input().split()
A = int(A)
B1, B2 = map(int, B.split("."))
tot = A*B1
tot += (A*B2)//100
print(tot)
return
if __name__ == '__main__':
main()
| [
"call.remove",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 383,408 | 383,409 | u947883560 | python |
p02659 | N,K=map(float,input().split())
print(int((N*K)//1)) | from decimal import Decimal
N,K=map(Decimal,input().split())
print(int((N*K)//1)) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 383,414 | 383,415 | u326943507 | python |
p02659 | a,b=map(float,input().split())
print(str(int(a*b))) | from decimal import Decimal
a,b=map(Decimal,input().split())
print(str(int(a*b))) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 383,416 | 383,417 | u478918022 | python |
p02659 | a,b=input().split()
a=int(a)
b=float(b)
import math
print(math.floor(a*b)) | a,b=input().split()
from decimal import Decimal
a=int(a)
b=Decimal(b)
import math
print(math.floor(a*b)) | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 383,418 | 383,419 | u636502712 | python |
p02659 | def resolve():
import math
a, b = map(float, input().split())
print(math.floor(a * b))
resolve() | def resolve():
import math
from decimal import Decimal
a, b = map(Decimal, input().split())
print(math.floor(a * b))
resolve() | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 383,422 | 383,423 | u736470924 | python |
p02659 | A,B = map(str,input().split())
A = int(A)
B = float(B)
print(int((A*B)//1)) | from decimal import Decimal
A,B = map(str,input().split())
A = int(A)
B = Decimal(B)
print(int((A*B)//1)) | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 383,446 | 383,447 | u674574659 | python |
p02659 | import math
a,b=map(str,input().split( ))
print(math.floor(int(a)*float(b))) | import math
from decimal import Decimal
a,b=map(str,input().split( ))
print(math.floor(int(a)*Decimal(b))) | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 383,450 | 383,451 | u658987783 | python |
p02659 | from decimal import Decimal
a, b = map(Decimal, input().split())
print(math.floor(a * b)) | from decimal import Decimal
import math
a, b = map(Decimal, input().split())
print(math.floor(a * b)) | [] | 383,459 | 383,460 | u508061226 | python |
p02659 | from math import floor
A, B = input().split()
A = int(A)
B = float(B)
print(floor(A * B)) | from math import floor
from decimal import *
A, B = input().split()
A = int(A)
B = Decimal(B)
print(floor(A * B)) | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 383,466 | 383,467 | u153729035 | python |
p02659 | a,b=map(str,input().split())
a=int(a)
b=float(b)
print(int(a*b))
| from decimal import Decimal
a,b=map(str,input().split())
a=int(a)
b=Decimal(b)
print(int(a*b))
| [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 383,471 | 383,472 | u909716307 | python |
p02659 | temp = input().split()
a = int(temp[0])
b = int(float(temp[1])*100)
print(int(a*b//100)) | temp = input().split()
a = int(temp[0])
b = int(float(temp[1])*100+0.01)
print(int(a*b//100)) | [
"assignment.change"
] | 383,473 | 383,474 | u544437477 | python |
p02659 | import math
s = input().split()
s[1] = s[1].replace(".", "")
num = int(s[0]) * int(s[1])
print(math.floor(num/100)) | import math
s = input().split()
s[1] = s[1].replace(".", "")
num = int(s[0]) * int(s[1])
print(num // 100) | [
"call.remove",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 383,479 | 383,480 | u057942294 | python |
p02659 | import math
from decimal import Decimal
A, B = map(float, input().split())
print(math.floor(Decimal(A)*Decimal(B))) | import math
from decimal import Decimal
A, B = map(Decimal, input().split())
print(math.floor((A)*(B))) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 383,483 | 383,484 | u875600867 | python |
p02659 | import math
import decimal
a, b = map(str, input().split())
a = decimal.Decimal(a)
b = decimal.Decimal(b)
print(a, b)
ans = a * b
ans = math.floor(ans)
print(int(ans)) | import math
import decimal
a, b = map(str, input().split())
a = decimal.Decimal(a)
b = decimal.Decimal(b)
ans = a * b
ans = math.floor(ans)
print(int(ans)) | [
"call.remove"
] | 383,485 | 383,486 | u542190960 | python |
p02659 | import math
import decimal
a, b = map(str, input().split())
a = decimal.Decimal(int(a))
b = decimal.Decimal(float(b))
ans = a * b
ans = math.floor(ans)
print(int(ans)) | import math
import decimal
a, b = map(str, input().split())
a = decimal.Decimal(a)
b = decimal.Decimal(b)
ans = a * b
ans = math.floor(ans)
print(int(ans)) | [
"call.remove",
"call.arguments.change"
] | 383,487 | 383,486 | u542190960 | python |
p02659 | s = input().split()
a = int(s[0])
b = float(s[1])
print(int(a * b)) | from decimal import Decimal
s = input().split()
a = int(s[0])
b = Decimal(s[1])
print(int(a * b)) | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 383,494 | 383,495 | u002663801 | python |
p02660 | N = int(input())
primes = {}
for num in range(2, int(N**0.5)+1):
while N%num == 0:
if num in primes:
primes[num] += 1
else:
primes[num] = 1
N //= num
ans = 0
# print(primes)
for p in primes.values():
n = 1
while n*(n+1)//2 <= p:
n += 1
ans += n-1
if ans == 0 and N > 1:
ans = 1
prin... | N = int(input())
primes = {}
for num in range(2, int(N**0.5)+1):
while N%num == 0:
if num in primes:
primes[num] += 1
else:
primes[num] = 1
N //= num
ans = 0
for p in primes.values():
n = 1
while n*(n+1)//2 <= p:
n += 1
ans += n-1
if N > 1:
ans += 1
print(ans) | [
"assignment.value.change"
] | 383,512 | 383,513 | u626337957 | python |
p02660 | import math
n = int(input())
#Prime factoring
pf = []
for i in range(2,math.ceil(n**0.5)+1):
temp = 0
while n%i==0:
n //= i
temp += 1
if temp:
pf.append(temp)
if n==1:
break
if not pf and n!=1:
pf.append(1)
ans = 0
for i in range(len(pf)):
j = 1
while pf[i]... | import math
n = int(input())
#Prime factoring
pf = []
for i in range(2,math.ceil(n**0.5)+1):
temp = 0
while n%i==0:
n /= i
temp += 1
if temp:
pf.append(temp)
if n==1:
break
if n!=1:
pf.append(1)
ans = 0
for i in range(len(pf)):
j = 1
while pf[i]-j>=0:
... | [
"expression.operator.change"
] | 383,558 | 383,559 | u911449886 | python |
p02660 | import math
n = int(input())
#Prime factoring
pf = []
for i in range(2,math.ceil(n**0.5)+1):
temp = 0
while n%i==0:
n /= i
temp += 1
if temp:
pf.append(temp)
if n==1:
break
if not pf and n!=1:
pf.append(1)
ans = 0
for i in range(len(pf)):
j = 1
while pf[i]-... | import math
n = int(input())
#Prime factoring
pf = []
for i in range(2,math.ceil(n**0.5)+1):
temp = 0
while n%i==0:
n /= i
temp += 1
if temp:
pf.append(temp)
if n==1:
break
if n!=1:
pf.append(1)
ans = 0
for i in range(len(pf)):
j = 1
while pf[i]-j>=0:
... | [] | 383,560 | 383,559 | u911449886 | python |
p02660 | import math
n = int(input())
#Prime factoring
pf = []
for i in range(2,math.ceil(n**0.5)+1):
temp = 0
while n%i==0:
n /= i
temp += 1
if temp:
pf.append(temp)
if n==1:
break
if not pf:
pf.append(1)
ans = 0
for i in range(len(pf)):
j = 1
while pf[i]-j>=0:
... | import math
n = int(input())
#Prime factoring
pf = []
for i in range(2,math.ceil(n**0.5)+1):
temp = 0
while n%i==0:
n /= i
temp += 1
if temp:
pf.append(temp)
if n==1:
break
if n!=1:
pf.append(1)
ans = 0
for i in range(len(pf)):
j = 1
while pf[i]-j>=0:
... | [
"control_flow.branch.if.condition.change"
] | 383,561 | 383,559 | u911449886 | python |
p02660 | import copy
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
L=prime_factorize(... | import copy
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
L=prime_factorize(... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 383,575 | 383,576 | u496009935 | python |
p02660 | import copy
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
L=prime_factorize(... | import copy
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
L=prime_factorize(... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 383,577 | 383,576 | u496009935 | python |
p02660 | N = int(input())
res = {}
ans = 0
for i in range(2,int(N**(1/2))+1) :
while(N%i == 0) :
if(i not in res) :
res[i] = 1
else :
res[i] += 1
N /= i
if(N != 1) :
res[N] = 1
for i in res :
b = 1
s = res[i]
while(b <= s) :
ans += 1
s -= 1
... | N = int(input())
res = {}
ans = 0
i = 2
for i in range(2,int(N**(1/2))+1) :
while(N%i == 0) :
if(i not in res) :
res[i] = 1
else :
res[i] += 1
N /= i
if(N != 1) :
res[N] = 1
for i in res :
b = 1
s = res[i]
while(b <= s) :
ans += 1
... | [
"identifier.replace.add",
"literal.replace.remove"
] | 383,589 | 383,588 | u038676814 | python |
p02659 | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
a_s, b_s = input().split()
a, b = int(a_s), float(b_s)
print(int(a * b))
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
# -*- coding: utf-8 -*-
from fractions import Fraction
def main():
a_s, b_s = input().split()
a, b = int(a_s), Fraction(b_s)
print(int(a * b))
if __name__ == '__main__':
main()
| [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 383,590 | 383,591 | u388370899 | python |
p02659 | import math
a, b = map(float, input().split())
a = int(a)
b *= 100
b = int(b)
print(int(a*b//100))
| from decimal import *
a, b = map(Decimal, input().split())
a = int(a)
b *= 100
b = int(b)
print(int(a*b//100))
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 383,608 | 383,609 | u814781830 | python |
p02659 | import math
a, b = map(float, input().split())
print(math.floor(a*b))
| import math
from decimal import Decimal
a, b = map(Decimal, input().split())
print(math.floor(a*b)) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 383,618 | 383,619 | u119012830 | python |
p02659 | a, b = input().split()
a = int(a)
b = int(100 * float(b))
print(a * b // 100) | a, b = input().split()
a = int(a)
b = round(100 * float(b))
print(a * b // 100) | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 383,620 | 383,621 | u935077683 | python |
p02659 | import sys, math,os
from io import BytesIO, IOBase
#from bisect import bisect_left as bl, bisect_right as br, insort
#from heapq import heapify, heappush, heappop
from collections import defaultdict as dd, deque, Counter
#from itertools import permutations,combinations
def data(): return sys.stdin.readline().strip()
de... | import sys, math,os
from io import BytesIO, IOBase
#from bisect import bisect_left as bl, bisect_right as br, insort
#from heapq import heapify, heappush, heappop
from collections import defaultdict as dd, deque, Counter
#from itertools import permutations,combinations
def data(): return sys.stdin.readline().strip()
de... | [
"identifier.change",
"call.arguments.change",
"function.return_value.change"
] | 383,624 | 383,625 | u476225888 | python |
p02659 | a, b = input().split()
a = int(a)
bx100 = int(b.repleace('.', ''))
print(a * bx100 // 100) | a, b = input().split()
a = int(a)
bx100 = int(b.replace('.', ''))
print(a * bx100 // 100) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 383,630 | 383,631 | u686230543 | python |
p02659 | import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline().strip()
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]
# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
... | import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)
from decimal import Decimal
def input():
return sys.stdin.readline().strip()
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]
# 改行区切りの入力をn行読み込んで数値リストにして... | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 383,640 | 383,641 | u407160848 | python |
p02659 | import math
AB = input().split()
a = int(AB[0])
b = float(AB[1])
print(math.floor(a * b)) | from decimal import Decimal
import math
AB = input().split()
a = int(AB[0])
b = Decimal(AB[1])
print(math.floor(a * b)) | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 383,652 | 383,653 | u995323427 | python |
p02659 | A, B = input().split()
A = int(A)
B = float(B)
X = A * int(100*B)
print(X//100) | A, B = input().split()
A = int(A)
B = float(B)
X = A * round(100*B)
print(X//100) | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 383,661 | 383,662 | u984276646 | python |
p02659 | from decimal import *
def main():
A,B = input().split()
A = int(A)
B = float(B)
A,B = Decimal(A),Decimal(B)
print((A*B).quantize(Decimal('0'), rounding=ROUND_DOWN))
if __name__ == '__main__':
main()
| from decimal import *
def main():
A,B = input().split()
A = int(A)
A,B = Decimal(A),Decimal(B)
print((A*B).quantize(Decimal('0'), rounding=ROUND_DOWN))
if __name__ == '__main__':
main()
| [
"assignment.remove"
] | 383,665 | 383,666 | u983853152 | python |
p02659 | import sys
from math import log2,floor,ceil,sqrt
# import bisect
# from collections import deque
# from types import GeneratorType
# def bootstrap(func, stack=[]):
# def wrapped_function(*args, **kwargs):
# if stack:
# return func(*args, **kwargs)
# else:
# call = func(*args... | import sys
from math import log2,floor,ceil,sqrt
# import bisect
# from collections import deque
# from types import GeneratorType
# def bootstrap(func, stack=[]):
# def wrapped_function(*args, **kwargs):
# if stack:
# return func(*args, **kwargs)
# else:
# call = func(*args... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.remove",
"call.arguments.change"
] | 383,667 | 383,668 | u341175126 | python |
p02659 | s_list = input().split()
c = str(int(s_list[0])*float(s_list[1]))
print(c.split(".")[0]) | from decimal import Decimal
s_list = input().split()
c = str(int(s_list[0])*Decimal(s_list[1]))
print(c.split(".")[0]) | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 383,673 | 383,674 | u285372827 | python |
p02659 | import math
a,b = map(float,input().split())
print(math.floor(a*b))
| import math
from decimal import Decimal
a,b = map(Decimal,input().split())
print(math.floor(a*b))
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 383,679 | 383,680 | u212831449 | python |
p02659 | from decimal import Decimal
from decimal import getcontext
s = input();
a,b = s.split();
print(Decimal(a)*Decimal(b)); | from decimal import Decimal
from decimal import getcontext
s = input();
a,b = s.split();
print(int(Decimal(a)*Decimal(b))); | [
"call.arguments.add",
"call.arguments.change"
] | 383,691 | 383,692 | u586832145 | python |
p02659 | A,B=input().split()
A=int(A)
B=int(float(B)*100)
print(A*B//100) | A,B=input().split()
A=int(A)
B=int(round(float(B)*100))
print(A*B//100)
| [
"call.arguments.add",
"call.arguments.change"
] | 383,699 | 383,700 | u173148629 | python |
p02659 | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)
def solve(A: int, B: float):
s = B[0] * 100
x = int(B[2:])
#ret = (B * 100 * A) // 100
ret = ((s + x) * A) // 100
print(int(ret))
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word i... | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)
def solve(A: int, B: float):
s = int(B[0]) * 100
x = int(B[2:])
#ret = (B * 100 * A) // 100
ret = ((s + x) * A) // 100
print(int(ret))
return
def main():
def iterate_tokens():
for line in sys.stdin:
for w... | [
"call.add",
"call.arguments.change"
] | 383,716 | 383,717 | u200785298 | python |
p02659 | from math import floor
from decimal import Decimal
A, B = map(float, input().split())
print(floor(Decimal(A*B))) | from math import floor
from decimal import Decimal
A, B = map(Decimal, input().split())
print(floor(Decimal(A*B))) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 383,728 | 383,729 | u095384238 | python |
p02659 | import math
A,B=list(map(float,input().split()))
B=100*B
C=A*B
C=math.floor(C/100)
print(C) | import math
from decimal import Decimal
A,B=list(map(Decimal,input().split()))
B=100*B
C=A*B
C=math.floor(C/100)
print(C) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 383,730 | 383,731 | u459419927 | python |
p02659 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
A, B = read().split()
A = int(A)
B = int(float(B) * 100)
A *= B
print(A // 100) | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
A, B = read().split()
A = int(A)
B = int(float(B) * 100 + .5)
A *= B
print(A // 100) | [
"assignment.change"
] | 383,742 | 383,743 | u102461423 | python |
p02659 | import math
'''
a=10**15
b=9.99
'''
a,b=map(float,input().split())
num=a*b
num=math.floor(num)
print(num)
| from decimal import Decimal
import math
'''
a=10**15
b=9.99
'''
a,b=map(Decimal,input().split())
num=a*b
#print(num)
num=math.floor(num)
print(num)
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 383,748 | 383,749 | u113107956 | 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.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==[]:
arr.a... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 383,781 | 383,782 | u405733072 | python |
p02660 | import collections
N = int(input())
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
c = collections.Counter(... | import collections
N = int(input())
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
c = collections.Counter(... | [
"call.remove"
] | 383,794 | 383,795 | u598296382 | python |
p02660 | 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
dum = prime_factorize(int(input()))
dum_len = l... | 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
dum = prime_factorize(int(input()))
dum_len = l... | [
"assignment.add"
] | 383,859 | 383,860 | u482157295 | python |
p02660 | n=int(input())
r=int(n**0.5+1)
ans=0
for i in range(2,r):
e=0
while n%i==0:
n//=i
e+=1
k=1
while e>k:
e-=k
ans+=1
k+=1
if n!=1:
ans+=1
print(ans)
| n=int(input())
r=int(n**0.5+1)
ans=0
for i in range(2,r):
e=0
while n%i==0:
n//=i
e+=1
k=1
while e>=k:
e-=k
ans+=1
k+=1
if n!=1:
ans+=1
print(ans)
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 383,861 | 383,862 | u492910842 | python |
p02660 | Number=int(input())
#Number=997764507000
times=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:
... | Number=int(input())
times=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.append([temp, 1]... | [
"call.remove"
] | 383,872 | 383,873 | u029056424 | python |
p02660 | import sys
input = lambda: sys.stdin.readline().rstrip()
from collections import defaultdict
N = int(input())
def prime_factorize(n):
ret = []
for i in range(2, int(n ** (1 / 2)) + 1):
if i > n:break
while n % i == 0:
n //= i
ret.append(i)
if n != 1:
ret.append(n)
return ret
dic = def... | import sys
input = lambda: sys.stdin.readline().rstrip()
from collections import defaultdict
N = int(input())
def prime_factorize(n):
ret = []
for i in range(2, int(n ** (1 / 2)) + 1):
if i > n:break
while n % i == 0:
n //= i
ret.append(i)
if n != 1:
ret.append(n)
return ret
dic = def... | [
"identifier.replace.add",
"literal.replace.remove"
] | 383,887 | 383,888 | u836939578 | 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([i, cnt])
if temp!=1:
arr.append([temp, 1]... | #import math
N = int(input())
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1]... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 383,906 | 383,907 | u088553842 | 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([i, cnt])
if temp!=1:
arr.append([temp, 1]... | #import math
N = int(input())
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1]... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change",
"control_flow.break.add"
] | 383,908 | 383,907 | u088553842 | python |
p02660 | import math
def factors(n):
l = int(math.sqrt(n)) + 1
ret = {}
nf2 = 0
while n % 2 == 0:
nf2 += 1
n //= 2
if nf2 != 0:
ret[2] = nf2
nf3 = 0
while n % 3 == 0:
nf3 += 1
n //= 3
if nf3 != 0:
ret[3] = nf3
# n = append_factors(n, ret, 2)
... | import math
def factors(n):
l = int(math.sqrt(n)) + 1
ret = {}
nf2 = 0
while n % 2 == 0:
nf2 += 1
n //= 2
if nf2 != 0:
ret[2] = nf2
nf3 = 0
while n % 3 == 0:
nf3 += 1
n //= 3
if nf3 != 0:
ret[3] = nf3
# n = append_factors(n, ret, 2)
... | [
"assignment.variable.change",
"identifier.change"
] | 383,911 | 383,912 | u838644735 | python |
p02660 | import math
def append_factor(f, p):
if p not in f:
f[p] = 0
f[p] += 1
def factors(n):
l = int(math.sqrt(n)) + 1
ret = {}
while n % 2 == 0:
append_factor(ret, 2)
n //= 2
while n % 3 == 0:
append_factor(ret, 3)
n //= 3
i = 6
while i*i <= n + 1:
... | import math
def append_factor(f, p):
if p not in f:
f[p] = 0
f[p] += 1
def factors(n):
l = int(math.sqrt(n)) + 1
ret = {}
while n % 2 == 0:
append_factor(ret, 2)
n //= 2
while n % 3 == 0:
append_factor(ret, 3)
n //= 3
i = 6
while i*i <= n + 1:
... | [
"call.remove"
] | 383,913 | 383,914 | u838644735 | python |
p02660 | def append_factor(f, p):
if p not in f:
f[p] = 0
f[p] += 1
def factors(n):
l = int(math.sqrt(n)) + 1
ret = {}
while n % 2 == 0:
append_factor(ret, 2)
n //= 2
while n % 3 == 0:
append_factor(ret, 3)
n //= 3
i = 6
while i*i <= n:
while n % (... | import math
def append_factor(f, p):
if p not in f:
f[p] = 0
f[p] += 1
def factors(n):
l = int(math.sqrt(n)) + 1
ret = {}
while n % 2 == 0:
append_factor(ret, 2)
n //= 2
while n % 3 == 0:
append_factor(ret, 3)
n //= 3
i = 6
while i*i <= n + 1:
... | [
"control_flow.loop.condition.change"
] | 383,916 | 383,914 | u838644735 | python |
p02660 | a,n=0,int(input())
for i in range(2,10**6):
x=j=0
while n%i<1:n/=i;x+=1
while x>=j:a+=1;j+=1;x-=j
print(a+(n>1)) | a,n=0,int(input())
for i in range(2,10**6):
x=j=0
while n%i<1:n//=i;x+=1
while x>j:a+=1;j+=1;x-=j
print(a+(n>1)) | [
"expression.operator.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 383,926 | 383,927 | u248670337 | python |
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])
if arr==[]:
... | 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])
if arr==[]:
... | [
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 383,953 | 383,954 | u248996551 | python |
p02660 | def main():
## IMPORT MODULE
#import sys
from collections import Counter
#sys.setrecursionlimit(100000)
#input=lambda :sys.stdin.readline().rstrip()
#f_inf=float("inf")
#MOD=10**9+7
if 'get_ipython' in globals():
## SAMPLE INPUT
n = 64
else:
##INPUT
n = input()
#a, b = map(... | def main():
## IMPORT MODULE
#import sys
from collections import Counter
#sys.setrecursionlimit(100000)
#input=lambda :sys.stdin.readline().rstrip()
#f_inf=float("inf")
#MOD=10**9+7
if 'get_ipython' in globals():
## SAMPLE INPUT
n = 64
else:
##INPUT
n =int(input())
#a, b = ... | [
"call.add",
"call.arguments.change"
] | 383,982 | 383,983 | u968404618 | python |
p02660 | import itertools
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 ar... | import itertools
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 ar... | [
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 383,991 | 383,992 | u350093546 | python |
p02660 | N = int(input())
def factorize(n):
result = []
tmp = n
for i in range(2, int(n**0.5)+1):
if tmp % i == 0:
cnt = 0
while tmp % i == 0:
cnt += 1
tmp //= i
result.append(cnt)
if tmp != 1:
result.append(1)
... | N = int(input())
def factorize(n):
result = []
tmp = n
for i in range(2, int(n**0.5)+1):
if tmp % i == 0:
cnt = 0
while tmp % i == 0:
cnt += 1
tmp //= i
result.append(cnt)
if tmp != 1:
result.append(1)
... | [] | 383,995 | 383,996 | u892305365 | python |
p02660 | n = int(input())
if n == 1:
print(0)
exit()
def factorization(num):
arr = []
temp = num
for i in range(2, int(num**0.5)+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
... | n = int(input())
if n == 1:
print(0)
exit()
def factorization(num):
arr = []
temp = num
for i in range(2, int(num**0.5)+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
... | [
"call.remove"
] | 383,997 | 383,998 | u397953026 | 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... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 384,063 | 384,064 | u896941378 | 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... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 384,065 | 384,064 | u896941378 | 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])
return arr
z = factoriza... | 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 arr
z = factoriza... | [
"call.remove"
] | 384,066 | 384,067 | u119982001 | python |
p02660 | N = int(input())
div_counts = []
for i in range(2, int(N**0.5)+1):
count = 0
while N%i == 0:
count += 1
N //= i
if N == 1:
break
div_counts.append(count)
if N != 1:
div_counts.append(1)
ans = 0
for count in div_counts:
for i in range(1, count):
if count >= i:
ans += 1
... | N = int(input())
div_counts = []
for i in range(2, int(N**0.5)+1):
count = 0
while N%i == 0:
count += 1
N //= i
if N == 1:
break
div_counts.append(count)
if N != 1:
div_counts.append(1)
ans = 0
for count in div_counts:
for i in range(1, count+1):
if count >= i:
ans += 1
... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 384,106 | 384,107 | u439063038 | python |
p02660 | n = int(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 -= 1
ans += 1
else:
break
print(ans) | n = int(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) | [
"identifier.replace.add",
"literal.replace.remove"
] | 384,108 | 384,109 | u188827677 | python |
p02660 | n = int(input())
s = []
for i in range(2, int(n**0.5)):
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 -= 1
ans += 1
else:
break
print(ans) | n = int(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) | [
"identifier.replace.add",
"literal.replace.remove"
] | 384,110 | 384,109 | u188827677 | python |
p02660 | n = int(input())
s = []
for i in range(2, int(n**0.5)):
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 -= 1
ans += 1
print(ans) | n = int(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) | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.break.add"
] | 384,111 | 384,109 | u188827677 | 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==[]:
a... | [
"call.remove"
] | 384,140 | 384,141 | u763534217 | python |
p02660 | import collections
def factorization(n):
if n<2:
return []
prime_factor=[]
for i in range(2,int(n**0.5)+1):
while n%i==0:
prime_factor.append(i)
n//=i
if n>1:
prime_factor.append(n)
return prime_factor
n=int(input())
... | import collections
def factorization(n):
if n<2:
return []
prime_factor=[]
for i in range(2,int(n**0.5)+1):
while n%i==0:
prime_factor.append(i)
n//=i
if n>1:
prime_factor.append(n)
return prime_factor
count=0
n=int(input())
c... | [
"assignment.add"
] | 384,157 | 384,158 | u125348436 | python |
p02660 | N=int(input())
ans=0
for i in range(2,10**6+1):
anssub=0
t=0
while N%i==0:
N=N//i
anssub+=1
while t*(t+1)//2<=anssub:
t+=1
ans+=t-1
if N!=1:
ans=1
print(ans) | N=int(input())
ans=0
for i in range(2,10**6+1):
anssub=0
t=0
while N%i==0:
N=N//i
anssub+=1
while t*(t+1)//2<=anssub:
t+=1
ans+=t-1
if N!=1:
ans+=1
print(ans) | [
"assignment.value.change"
] | 384,163 | 384,164 | u829249049 | python |
p02660 | # prime factorization
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 ... | # prime factorization
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 ... | [
"call.remove"
] | 384,167 | 384,168 | u050584166 | python |
p02660 | from typing import List
from collections import Counter
def prime_factorize(n: int) -> List[int]:
factor_list = []
while n % 2 == 0:
factor_list.append(2)
n //= 2
f = 3
while f * f <= n+1:
if n % f == 0:
factor_list.append(f)
n //= f
else:
... | from typing import List
from collections import Counter
def prime_factorize(n: int) -> List[int]:
factor_list = []
while n % 2 == 0:
factor_list.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
factor_list.append(f)
n //= f
else:
... | [
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove"
] | 384,169 | 384,170 | u391328897 | python |
p02660 | from typing import List
from collections import Counter
def prime_factorize(n: int) -> List[int]:
factor_list = []
while n % 2 == 0:
factor_list.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
factor_list.append(f)
n //= f
else:
... | from typing import List
from collections import Counter
def prime_factorize(n: int) -> List[int]:
factor_list = []
while n % 2 == 0:
factor_list.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
factor_list.append(f)
n //= f
else:
... | [
"identifier.replace.add",
"literal.replace.remove"
] | 384,171 | 384,170 | u391328897 | python |
p02660 | n = int(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 -= 1
c += 1
i += 1
if n != 1: #nが素数
c += 1
print(c) | n = int(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) | [
"identifier.replace.add",
"literal.replace.remove"
] | 384,172 | 384,173 | u571524394 | python |
p02660 | n = int(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 -= 1
c += 1
i += 1
if n != 1: #nが素数
c += 1
print(c) | n = int(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) | [
"identifier.replace.add",
"literal.replace.remove"
] | 384,172 | 384,174 | u571524394 | python |
p02660 | n = int(input())
r = 0
for p in range(2, int(n**0.5)+1):
e = 0
while n%p == 0:
e += 1
n /= p
i = 1
while e >= i:
e -= i
r += 1
i += 1
if n!=1 and r==0:
r = 1
print(r) | n = int(input())
r = 0
for p in range(2, int(n**0.5)+1):
e = 0
while n%p == 0:
e += 1
n /= p
i = 1
while e >= i:
e -= i
r += 1
i += 1
if n != 1:
r += 1
print(r) | [
"assignment.value.change"
] | 384,179 | 384,180 | u268210555 | python |
p02660 | n=int(input())
import math
def factorization(n): #nを素因数分解する
arr = []
temp = n
for i in range(2, int(math.sqrt(n))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append(cnt)
if temp!=1:
arr.append(1)
#... | n=int(input())
import math
def factorization(n): #nを素因数分解する
arr = []
temp = n
for i in range(2, int(math.sqrt(n))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append(cnt)
if temp!=1:
arr.append(1)
#... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 384,183 | 384,184 | u502126017 | python |
p02660 | n = int(input())
def prime_factorize(n):
res = []
for i in range(2, int(n ** 0.5) + 1):
while n % i == 0:
res.append(i)
n //= i
if n != 1:
res.append(n)
return res
fac = prime_factorize(n)
from collections import Counter
ctr = Counter(fac)
ans = 0
for val i... | n = int(input())
def prime_factorize(n):
res = []
for i in range(2, int(n ** 0.5) + 1):
while n % i == 0:
res.append(i)
n //= i
if n != 1:
res.append(n)
return res
fac = prime_factorize(n)
from collections import Counter
ctr = Counter(fac)
ans = 0
for val i... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 384,197 | 384,198 | u554954744 | python |
p02660 | #わかったこと 2~N**0.5まで素数関係なく調べればいい
n=int(input())
bunkai=[]
def different_value(e):
cnt=0
i=1
while e-i>=0:
e-=i
i+=1
cnt+=1
return cnt
def soinsuu(x):
for i in range(2,int((n)**0.5)+1):
cnt=0
while x%i==0:
x//=i
cnt+=1
if cnt==0:... | #わかったこと 2~N**0.5まで素数関係なく調べればいい
n=int(input())
bunkai=[]
def different_value(e):
cnt=0
i=1
while e-i>=0:
e-=i
i+=1
cnt+=1
return cnt
def soinsuu(x):
for i in range(2,int(n**0.5)+1):
cnt=0
while x%i==0:
x//=i
cnt+=1
if cnt==0:
... | [
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 384,213 | 384,214 | u723583932 | python |
p02660 | arr = []
temp = int(input())
su =0
for i in range(2, int(-(-temp**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==[]:
arr.append(1)
su =1
for t in range(len(arr)):
cnt =1
while arr[t... | arr = []
temp = int(input())
su =0
for i in range(2, int(-(-temp**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==[] and temp !=1:
arr.append(1)
su =1
for t in range(len(arr)):
cnt =1
... | [
"control_flow.branch.if.condition.change"
] | 384,246 | 384,247 | u644126199 | 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(cnt)
if temp!=1:
arr.append(1)
if n==1:
arr.append(0)
return arr
def kak(n):
return ((1+8*n)**(1/2)-1)//2
A=da... | 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 n==1:
arr.append(0)
return arr
def kak(n):
return ((1+8*n)**(1/2)-1)//2
A=fa... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.add",
"call.arguments.change"
] | 384,252 | 384,253 | u831651889 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.