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 |
|---|---|---|---|---|---|---|---|
p02835 | a,b,c=input().split()
a=int(a)
b=int(b)
c=int(c)
if a+b+c<=21:
print(win)
else:
print(bust) | a,b,c=input().split()
a=int(a)
b=int(b)
c=int(c)
if a+b+c<=21:
print("win")
else:
print("bust") | [
"call.arguments.change"
] | 639,503 | 639,504 | u672542358 | python |
p02835 | a,b,c = map(int,input().split())
print("bust" if a+b+c>22 else "win") | a,b,c = map(int,input().split())
print("bust" if a+b+c>=22 else "win") | [
"expression.operator.compare.change",
"call.arguments.change",
"io.output.change"
] | 639,507 | 639,508 | u480887263 | python |
p02835 | a1, a2, a3 = int(input().split())
if (a1 + a2 + a3 <= 21):
print('win')
else:
print('bust') | a1, a2, a3 = map(int, input().split())
if (a1 + a2 + a3 <= 21):
print('win')
else:
print('bust') | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.add"
] | 639,524 | 639,525 | u838786721 | python |
p02835 | a, b, c = map(int, input().split())
print("win" if a+b+c==21 else "bust") | a, b, c = map(int, input().split())
print("win" if a+b+c<=21 else "bust") | [
"expression.operator.compare.change",
"call.arguments.change",
"io.output.change"
] | 639,548 | 639,549 | u963343620 | python |
p02835 | a=list(map(int, input().split()))
if sum(a)<22:
print("bust")
else:
print("win")
| a = list(map(int, input().split()))
if sum(a) < 22:
print("win")
else:
print("bust")
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 639,559 | 639,560 | u339503988 | python |
p02835 | a = list(map(int, input().split()))
if a[0] + a[1] + a[2] << 22:
print("win")
else: print("bust") | a = list(map(int, input().split()))
if int(a[0] + a[1] + a[2]) <= 21:
print("win")
else: print("bust")
| [
"control_flow.branch.if.condition.change",
"call.add"
] | 639,565 | 639,566 | u660245210 | python |
p02835 | a, b, c = map(int, input().split())
if a+b+c >= 21 :
print('bust')
else:
print('win') | a, b, c = map(int, input().split())
if a+b+c >= 22 :
print('bust')
else:
print('win') | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 639,567 | 639,568 | u492511953 | python |
p02835 | A = list(map(int, input().split()))
SUM_A = sum(A)
if SUM_A <= 21:
pritn("win")
else:
print("bust") | A = list(map(int, input().split()))
SUM_A = sum(A)
if SUM_A <= 21:
print("win")
else:
print("bust") | [
"identifier.change",
"call.function.change"
] | 639,575 | 639,576 | u609814378 | python |
p02835 | A = list(map(int, input().split()))
print('bust' if(sum(A) > 22) else 'win') | A = list(map(int, input().split()))
print('bust' if(sum(A) >= 22) else 'win') | [
"expression.operator.compare.change",
"call.arguments.change",
"io.output.change"
] | 639,593 | 639,594 | u024383312 | python |
p02835 | a1,a2,a3 = map(int, input().split())
if a1 + a2 + a3 <= 21:
print("win")
else:
print("burst") | a1,a2,a3 = map(int, input().split())
if a1 + a2 + a3 <= 21:
print("win")
else:
print("bust") | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 639,611 | 639,612 | u037430802 | python |
p02835 | n, l, m = (int(i) for i in input().split())
if n+l+m >22:
print('bust')
else:
print('win') | n, l, m = (int(i) for i in input().split())
if n+l+m >= 22:
print('bust')
else:
print('win') | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 639,615 | 639,616 | u917733926 | python |
p02836 | A=input()
c=0
B=A[::-1]
for i in range(len(A)):
if A[i]!=B[i]:
cnt+=1
print(cnt//2) | A=input()
c=0
B=A[::-1]
for i in range(len(A)):
if A[i]!=B[i]:
c+=1
print(c//2) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 639,657 | 639,658 | u404794295 | python |
p02836 | s=input()
rs=s[::-1]
ans=0
for i in range (len(s)):
if s[i] != rs[i]:
ans+=1
print(ans)
| s=input()
rs=s[::-1]
ans=0
for i in range (len(s)):
if s[i] != rs[i]:
ans+=1
print(ans//2)
| [
"expression.operation.binary.add"
] | 639,659 | 639,660 | u658600714 | python |
p02836 | s=input()
t=s[::-1]
num=0
for i in range(len(s)):
if s[i]!=t[i]:
num+=1
print(num)
| s=input()
t=s[::-1]
num=0
for i in range(len(s)):
if s[i]!=t[i]:
num+=1
print(num//2)
| [
"expression.operation.binary.add"
] | 639,671 | 639,672 | u438189153 | python |
p02836 | s = input()
ans = 0
for i in range(len(s)):
if s[i] != s[-i-1]:
ans += 1
print(ans) | s = input()
ans = 0
for i in range(len(s)//2):
if s[i] != s[-i-1]:
ans += 1
print(ans)
| [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 639,673 | 639,674 | u024890678 | python |
p02836 | S = input()
cnt = 0
for i in range(S // 2):
if S[i] != S[len(S) - 1 - i]:
cnt += 1
print(cnt) | S = input()
cnt = 0
for i in range(len(S) // 2):
if S[i] != S[len(S) - 1 - i]:
cnt += 1
print(cnt)
| [
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 639,675 | 639,676 | u849756457 | python |
p02836 | s = input()
cnt = 0
for i in range(len(s)):
a0, a1 = s[i], s[-i-1]
if a0 != a1:
cnt += 1
print(cnt)
| s = input()
cnt = 0
for i in range(len(s)//2):
a0, a1 = s[i], s[-i-1]
if a0 != a1:
cnt += 1
print(cnt)
| [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 639,683 | 639,684 | u612975321 | python |
p02836 | s = int(input())
s_r = s[::-1]
cnt = 0
for i in range(len(s)):
if s[i] != s_r[i]:
cnt += 1
print(cnt//2) | s = input()
s_r = s[::-1]
cnt = 0
for i in range(len(s)):
if s[i] != s_r[i]:
cnt += 1
print(cnt//2) | [
"call.remove",
"call.arguments.change"
] | 639,685 | 639,686 | u440478998 | python |
p02836 | S = input()
cnt = 0
for i in range(len(S)):
if S[i]!=S[len(S)-1-i]:
cnt += 1
print(cnt) | S = input()
cnt = 0
for i in range(len(S)):
if S[i]!=S[len(S)-1-i]:
cnt += 1
print(cnt//2) | [
"expression.operation.binary.add"
] | 639,687 | 639,688 | u983853152 | python |
p02836 | S = input()
T = S[::-1]
a = 0
for s,t in zip(S,T):
if s!=t:
a+=1
print(a) | S = input()
T = S[::-1]
a = 0
for s,t in zip(S,T):
if s!=t:
a+=1
print(a//2) | [
"expression.operation.binary.add"
] | 639,695 | 639,696 | u759412327 | python |
p02836 | s = list(input())
n = len(s)
res = 0
for i in range(n):
if s[i] != s[n-1-i]:
res += 1
print(res)
| s = list(input())
n = len(s)
res = 0
for i in range(n//2):
if s[i] != s[n-1-i]:
res += 1
print(res)
| [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 639,699 | 639,700 | u185806788 | python |
p02836 | s = input()
n = len(s) // 2
p = n
j = -1
for i in range(n):
if n[i] == n[j]:
p -= 1
j -= 1
print(p) | s = input()
n = len(s) // 2
p = n
j = -1
for i in range(n):
if s[i] == s[j]:
p -= 1
j -= 1
print(p) | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 639,701 | 639,702 | u357751375 | python |
p02836 | s = input()
ans = 0
center = len(s) // 2
if center % 2 == 1:
s2 = s[center+1:]
else:
s2 = s[center:]
s1 = s[:center]
s2 = "".join(reversed(s2))
for str1 , str2 in zip(s1,s2):
if str1 != str2:
ans += 1
print(ans) | s = input()
ans = 0
center = len(s) // 2
if len(s) % 2 == 1:
s2 = s[center+1:]
else:
s2 = s[center:]
s1 = s[:center]
s2 = "".join(reversed(s2))
for str1 , str2 in zip(s1,s2):
if str1 != str2:
ans += 1
print(ans) | [
"control_flow.branch.if.condition.change",
"call.arguments.add"
] | 639,703 | 639,704 | u049182844 | python |
p02836 | s=input()
print(sum(s[i]!=s[-1-i])for i in range(len(s)//2)) | s=input()
print(sum(s[i]!=s[-1-i]for i in range(len(s)//2))) | [
"call.arguments.change"
] | 639,705 | 639,706 | u729119068 | python |
p02836 | s = list(input())
n = len(s)-1
count = 0
if s != s[::-1]:
for i in range(0,n//2):
if s[i] != s[n-i]:
count += 1
print(count)
| s = list(input())
n = len(s)-1
count = 0
if s != s[::-1]:
for i in range(0,(n+1)//2):
if s[i] != s[n-i]:
count += 1
print(count) | [
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 639,707 | 639,708 | u021770165 | python |
p02836 | lit = input().split()
length = len(lit)
times = 0
if length != 1:
for i in range(int(length/2)):
if lit[i] != lit[length-1-i]:
times += 1
print(times)
else:
print(times) | lit = input()
length = len(lit)
times = 0
if length != 1:
for i in range(int(length/2)):
if lit[i] != lit[length-1-i]:
times += 1
print(times)
else:
print(times) | [
"call.remove"
] | 639,709 | 639,710 | u957843607 | python |
p02836 | ess = input()
sse = ess[::-1]
hugs = 0
for i in range(0, len(ess)):
if ess[i] != sse[i]: hugs += 1
print(hugs) | ess = input()
sse = ess[::-1]
hugs = 0
for i in range(0, len(ess)):
if ess[i] != sse[i]: hugs += 1
print(int(hugs/2))
| [
"call.add",
"call.arguments.add"
] | 639,711 | 639,712 | u276686572 | python |
p02836 | import math
A=list(input())
N=len(A)
x=0
for i in range(0,N):
if A[i]!=A[N-1-i]:
x+=1
a=math.ceil(x/2)
print(x) | import math
s=list(input())
N=len(s)
x=0
for i in range(0,N):
if s[i]!=s[N-1-i]:
x+=1
x=math.ceil(x/2)
print(x) | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 639,713 | 639,714 | u749614185 | python |
p02836 | s = input()
ans = 0
for i in range(len(s)):
if s[i] != s[-(i+1)]:
ans += 1
print(ans) | s = input()
ans = 0
for i in range(len(s)):
if s[i] != s[-(i+1)]:
ans += 1
print(ans // 2) | [
"expression.operation.binary.add"
] | 639,715 | 639,716 | u779728630 | python |
p02836 | s = input()
if len(s) == 1:
print(0)
exit()
ans = 0
for i in range(len(s)//2-1):
if s[i] != s[(-1)*(i+1)]:
ans += 1
else:
pass
print(ans) | s = input()
if len(s) == 1:
print(0)
exit()
ans = 0
for i in range(len(s)//2):
if s[i] != s[(-1)*(i+1)]:
ans += 1
else:
pass
print(ans)
| [
"expression.operation.binary.remove"
] | 639,717 | 639,718 | u757274384 | python |
p02819 | import math
import sys
def eratosthenes(limit):
A = [i for i in range(2, limit+1)]
P = []
time = 0
while True:
prime = min(A)
if prime > math.sqrt(limit):
break
P.append(prime)
i = 0
while i < len(A):
... | import math
import sys
def eratosthenes(limit):
A = [i for i in range(2, limit+1)]
P = []
time = 0
while True:
prime = min(A)
if prime > math.sqrt(limit):
break
P.append(prime)
i = 0
while i < len(A):
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 639,719 | 639,720 | u931462344 | python |
p02819 | def primes(n):
i = 1
p = [2]
while i+2 <= n:
flag = True
i += 2
for j in range(3, int(i**(1/2))+1, 2):
if i % j == 0:
flag = False
break
if flag:
p.append(i)
return p
n = int(input())
p = primes(10**5+10... | def primes(n):
i = 1
p = [2]
while i+2 <= n:
flag = True
i += 2
for j in range(3, int(i**(1/2))+1, 2):
if i % j == 0:
flag = False
break
if flag:
p.append(i)
return p
n = int(input())
p = primes(10**5+10... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"io.output.change"
] | 639,728 | 639,729 | u891217808 | python |
p02819 | import math
import sys
input = sys.stdin.readline
def is_prime(n):
if n == 1: return False
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return False
return True
def main():
X = int(input())
for i in range(X, 100003):
if is_prime(i):
print(i)
... | import math
import sys
input = sys.stdin.readline
def is_prime(n):
if n == 1: return False
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return False
return True
def main():
X = int(input())
for i in range(X, 100004):
if is_prime(i):
print(i)
... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 639,734 | 639,735 | u610473220 | python |
p02819 | X = int(input())
def is_prime(n):
if n == 2:
return True
elif n%2 == 0:
return False
if pow(2, n-1, n) != 1:
return False
return True
n = X
primes = []
while True:
n += 1
if is_prime(n):
flag = True
for p in range(3, n//2):
if n%p == 0:
... | X = int(input())
def is_prime(n):
if n == 2:
return True
elif n%2 == 0:
return False
if pow(2, n-1, n) != 1:
return False
return True
n = X-1
primes = []
while True:
n += 1
if is_prime(n):
flag = True
for p in range(3, n//2):
if n%p == 0:
... | [
"assignment.change"
] | 639,736 | 639,737 | u197078193 | python |
p02819 | x = int(input())
def is_prime(num):
for i in range(2, num):
if num % i == 0:
return False
return True
for i in range(x, 10 ** 5):
if is_prime(i):
print(i)
exit()
| x = int(input())
def is_prime(num):
for i in range(2, num):
if num % i == 0:
return False
return True
for i in range(x, 10 ** 9):
if is_prime(i):
print(i)
exit()
| [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 639,745 | 639,746 | u749770850 | python |
p02819 | X=int(input())
def is_prime(n):
if n==1:
return False
for i in range(2,int(n**0.5)+1):
if n % i == 0:
return False
return True
for i in range(X,100000):
if is_prime(i):
print(i)
break | X=int(input())
def is_prime(n):
if n==1:
return False
for i in range(2,int(n**0.5)+1):
if n % i == 0:
return False
return True
for i in range(X,1000000):
if is_prime(i):
print(i)
break | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 639,749 | 639,750 | u861071267 | python |
p02819 | from sys import exit
from math import sqrt
x = int(input())
if x == 2:
print(3)
exit()
elif x == 3:
print(5)
exit()
i = x
while i <= x * int(sqrt(x)):
j = 2
while j <= int(sqrt(i)):
if not i % j:
break
j += 1
if j > int(sqrt(i)):
print(i)
exit()
... | from sys import exit
from math import sqrt
x = int(input())
if x == 2:
print(2)
exit()
elif x == 3:
print(3)
exit()
i = x
while i <= x * int(sqrt(x)):
j = 2
while j <= int(sqrt(i)):
if not i % j:
break
j += 1
if j > int(sqrt(i)):
print(i)
exit()
... | [
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 639,753 | 639,754 | u769095634 | python |
p02819 | x = int(input())
s =[2]
if x==2:
print(x)
else:
for i in range(3,int(x/2),2):
if all(i%k!=0 for k in s):
s.append(i)
while any(x%k==0 for k in s):
x+=1
else:
print(x) | x = int(input())
s =[2]
if x==2:
print(x)
exit()
else:
for i in range(3,int(x/2),2):
if all(i%k!=0 for k in s):
s.append(i)
while any(x%k==0 for k in s):
x+=1
else:
print(x) | [
"call.add"
] | 639,755 | 639,756 | u728318205 | python |
p02819 | x = int(input())
while True:
p = True
for i in range(2, int(x**0.5)+3):
if x % i == 0:
p = False
break
if p:
break
x += 1
print(x) | x = int(input())
while True:
p = True
for i in range(2, int(x**0.5)+1):
if x % i == 0:
p = False
break
if p:
break
x += 1
print(x) | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 639,757 | 639,758 | u454524105 | python |
p02819 | p = int(input())
n = 2*p
primes = set(range(2, n+1))
for i in range(2, int(n**0.5+1)):
primes.difference_update(range(i*2, n+1, i))
primes=list(primes)
for i in primes:
if i >= p:
print(i)
break | p = int(input())
n = 2*p
primes = set(range(2, n+1))
for i in range(2, int(n**0.5+1)):
primes.difference_update(range(i*2, n+1, i))
primes=list(primes)
primes.sort()
for i in primes:
if i >= p:
print(i)
break
| [
"call.add"
] | 639,761 | 639,762 | u306950978 | python |
p02819 | p = int(input())
n = 3*p
primes = set(range(2, n+1))
for i in range(2, int(n**0.5+1)):
primes.difference_update(range(i*2, n+1, i))
primes=list(primes)
for i in primes:
if i >= p:
print(i)
break | p = int(input())
n = 2*p
primes = set(range(2, n+1))
for i in range(2, int(n**0.5+1)):
primes.difference_update(range(i*2, n+1, i))
primes=list(primes)
primes.sort()
for i in primes:
if i >= p:
print(i)
break
| [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.add"
] | 639,763 | 639,762 | u306950978 | python |
p02819 | x=int(input())
p=x**0.5
while any(X%i==0 for i in range(2,x//1+1)):
x+=1
else:
print(x) | x=int(input())
p=x**0.5
while any(x%i==0 for i in range(2,int(p)+1)):
x+=1
else:
print(x) | [
"identifier.change",
"control_flow.loop.condition.change"
] | 639,770 | 639,769 | u702018889 | python |
p02819 | from math import sqrt
def prime_check(a):
for i in range(int(sqrt(a))):
if a % (i + 2) == 0:
return False
return True
x = int(input())
while not(prime_check(x)):
x += 1
print(x) | from math import sqrt
def prime_check(a):
for i in range(int(sqrt(a))):
if a % (i + 2) == 0:
return False
return True
x = int(input())
if x != 2:
while not(prime_check(x)):
x += 1
print(x)
| [
"control_flow.branch.if.add"
] | 639,775 | 639,776 | u711193305 | python |
p02819 | x=int(input())
for i in range(x,10**5+1):
for j in range(2,i):
if i%j==0:
break
else:
print(i)
break
| x=int(input())
for i in range(x,10**6):
for j in range(2,i):
if i%j==0:
break
else:
print(i)
break | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove"
] | 639,779 | 639,780 | u345483150 | python |
p02819 | # ABC149C - Next Prime
def is_prime_miller_rabin(n: int) -> bool:
"""Miller–Rabin primality test in O(k log^3 n).
https://twitter.com/kiri8128/status/1241033090773860353
https://www.wikiwand.com/en/Miller%E2%80%93Rabinprimalitytest
"""
# cut out small primes and 87% of composite numbers.
if n < ... | # ABC149C - Next Prime
def is_prime_miller_rabin(n: int) -> bool:
"""Miller–Rabin primality test in O(k log^3 n).
https://twitter.com/kiri8128/status/1241033090773860353
https://www.wikiwand.com/en/Miller%E2%80%93Rabinprimalitytest
"""
# cut out small primes and 87% of composite numbers.
if n < ... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 639,781 | 639,782 | u077291787 | python |
p02819 | from bisect import bisect_left
def get_primes(n):
if not isinstance(n, int):
raise TypeError('n is int-type.')
if n < 2:
raise ValueError('n is more than 2')
from math import sqrt
def _sieve_of_eratosthenes(n):
primes = []
limit = sqrt(n)
data = [i + 1 for ... | from bisect import bisect_left
def get_primes(n):
if not isinstance(n, int):
raise TypeError('n is int-type.')
if n < 2:
raise ValueError('n is more than 2')
from math import sqrt
def _sieve_of_eratosthenes(n):
primes = []
limit = sqrt(n)
data = [i + 1 for ... | [
"expression.operation.binary.remove"
] | 639,783 | 639,784 | u417365712 | python |
p02819 | from bisect import bisect_left
def get_primes(n):
if not isinstance(n, int):
raise TypeError('n is int-type.')
if n < 2:
raise ValueError('n is more than 2')
from math import sqrt
def _sieve_of_eratosthenes(n):
primes = []
limit = sqrt(n)
data = [i + 1 for ... | from bisect import bisect_left, bisect_right
def get_primes(n):
if not isinstance(n, int):
raise TypeError('n is int-type.')
if n < 2:
raise ValueError('n is more than 2')
from math import sqrt
def _sieve_of_eratosthenes(n):
primes = []
limit = sqrt(n)
data... | [
"expression.operation.binary.remove"
] | 639,783 | 639,785 | u417365712 | python |
p02819 | import sys
input=sys.stdin.readline
import math
X = int(input())
if X == 2:
print(2)
x = math.ceil(math.sqrt(X))
for i in range(X,X+1000):
c = 0
for j in range(2,x+1):
if i % j == 0:
c = 1
break
if c == 0:
print(i)
break | import sys
input=sys.stdin.readline
import math
X = int(input())
if X == 2:
print(2)
else:
x = math.ceil(math.sqrt(X))
for i in range(X,X+1000):
c = 0
for j in range(2,x+1):
if i % j == 0:
c = 1
break
if c == 0:
print(i)
break | [] | 639,793 | 639,794 | u201387466 | python |
p02819 | from __future__ import print_function
import sys
import re
import array
import copy
import functools
import operator
import math
import string
from math import gcd
# math.log2()はatcoderでは対応していない．留意せよ．
import collections
import itertools
import bisect
import random
import time
import heapq
from heapq import heappu... | from __future__ import print_function
import sys
import re
import array
import copy
import functools
import operator
import math
import string
from math import gcd
# math.log2()はatcoderでは対応していない．留意せよ．
import collections
import itertools
import bisect
import random
import time
import heapq
from heapq import heappu... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 639,795 | 639,796 | u185249212 | python |
p02819 | from __future__ import print_function
import sys
import re
import array
import copy
import functools
import operator
import math
import string
from math import gcd
# math.log2()はatcoderでは対応していない．留意せよ．
import collections
import itertools
import bisect
import random
import time
import heapq
from heapq import heappu... | from __future__ import print_function
import sys
import re
import array
import copy
import functools
import operator
import math
import string
from math import gcd
# math.log2()はatcoderでは対応していない．留意せよ．
import collections
import itertools
import bisect
import random
import time
import heapq
from heapq import heappu... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 639,797 | 639,796 | u185249212 | python |
p02819 | # -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
from math import gcd
from functools import lru_cache
#############
# Constants #
#############
MOD = 10**9 +7
INF = float('inf')
#############
# Functions #
#############
######INPUT######
def inpu... | # -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
from math import gcd
from functools import lru_cache
#############
# Constants #
#############
MOD = 10**9 +7
INF = float('inf')
#############
# Functions #
#############
######INPUT######
def inpu... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 639,800 | 639,801 | u493130708 | python |
p02819 | x = int(input())
while not all(x % i for i in range(2, x)):
x += 1 | x = int(input())
while not all(x % i for i in range(2, x)):
x += 1
print(x) | [
"call.add"
] | 639,810 | 639,811 | u373047809 | python |
p02836 | s=input()
t=s[::-1]
cnt=0
for i in range(len(t)):
if s[i]!=t[i]: cnt+=1
print(cnt) | s=input()
t=s[::-1]
cnt=0
for i in range(len(t)//2):
if s[i]!=t[i]: cnt+=1
print(cnt) | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 639,827 | 639,828 | u131881594 | python |
p02836 | import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(inpu... | import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(inpu... | [
"expression.operation.binary.remove"
] | 639,831 | 639,832 | u750651325 | python |
p02836 | s = input()
t = 0
for i in range(len(s)):
if s[i] != s[::-1][i]:
t += 1
ptint(t//2) | s = input()
t = 0
for i in range(len(s)):
if s[i] != s[::-1][i]:
t += 1
print(t//2) | [
"identifier.change",
"call.function.change"
] | 639,835 | 639,836 | u468972478 | python |
p02836 | s = input()
t = 0
for i in range(len(s)):
if s[i] != s[::-1][i]:
t += 1
ptint(t) | s = input()
t = 0
for i in range(len(s)):
if s[i] != s[::-1][i]:
t += 1
print(t//2) | [
"identifier.change",
"call.function.change"
] | 639,837 | 639,836 | u468972478 | python |
p02836 | a=input()
b=0
for i in range(len(a)):
if a[i]!=a[len(a)-i]:
b=b+1
print(int(b/2)) | a=input()
b=0
for i in range(len(a)):
if a[i]!=a[len(a)-i-1]:
b=b+1
print(int(b/2)) | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 639,838 | 639,839 | u244836567 | python |
p02836 | S = input()
hug = 0
if len(S) % 2 == 0:
for i in range(len(S/2)):
if not S[i] == S[-i-1]:
hug += 1
else:
pass
else:
for i in range(int((len(S)+1)/2)):
if not S[i] ==S[-i-1]:
hug += 1
else:
pass
print(hug)
| S = input()
hug = 0
if len(S) % 2 == 0:
for i in range(int(len(S)/2)):
if not S[i] == S[-i-1]:
hug += 1
else:
pass
else:
for i in range(int((len(S)+1)/2)):
if not S[i] ==S[-i-1]:
hug += 1
else:
pass
print(hug) | [
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 639,840 | 639,841 | u272457181 | python |
p02836 | a = str(input())
b = len(a)//2
count =0
for i in range(b):
if a[i]!=a[-i]:
count+=1
print(count) | a = str(input())
b = len(a)//2
count =0
for i in range(b):
if a[i]!=a[-(i+1)]:
count+=1
print(count) | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 639,842 | 639,843 | u620846115 | python |
p02836 | s=input()
n=len(s)
if n%2:
ms,us=s[:(n-1)//2],s[:(n-1)//2:-1]
else:
ms,us=s[:n//2],s[:n//2+1:-1]
ans=0
for a,d in zip(list(ms),list(us)):
if a!=d:ans+=1
print(ans) | s=input()
n=len(s)
if n%2:
ms,us=s[:(n-1)//2],s[:(n-1)//2:-1]
else:
ms,us=s[:n//2],s[:n//2-1:-1]
ans=0
for a,d in zip(list(ms),list(us)):
if a!=d:ans+=1
print(ans)
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 639,844 | 639,845 | u896741788 | python |
p02836 | s = int(input())
cnt = 0
for s1, s2 in zip(s, s[::-1]):
if s1 != s2:
cnt += 1
print(cnt // 2) | s = input()
cnt = 0
for s1, s2 in zip(s, s[::-1]):
if s1 != s2:
cnt += 1
print(cnt // 2) | [
"call.remove",
"call.arguments.change"
] | 639,871 | 639,872 | u745514010 | python |
p02836 | x = input()
a = x[::-1]
b = 0
c = 0
d = len(x)
while b >= d:
if x[b] == a[b]:
c = c
b = b + 1
else:
c = c + 1
b = b + 1
c = int(c/2)
print(c) | x = input()
a = x[::-1]
b = 0
c = 0
d = int(len(x))
while b + 1 <= d:
if x[b] == a[b]:
c = c
b = b + 1
else:
c = c + 1
b = b + 1
c = int(c/2)
print(c) | [
"call.add",
"call.arguments.change",
"control_flow.loop.condition.change"
] | 639,892 | 639,893 | u287660527 | python |
p02836 | S = input()
result = 0
入力例1なら3文字目まで
for i in range(len(S) // 2):
# sの1(2番目)がsの最後尾と一緒ならカウント
if S[i] != S[-(i + 1)]:
result += 1
print(result) | S = input()
result = 0
# 入力例1なら3文字目まで
for i in range(len(S) // 2):
# sの1(2番目)がsの最後尾と一緒ならカウント
if S[i] != S[-(i + 1)]:
result += 1
print(result) | [] | 639,900 | 639,901 | u294542073 | python |
p02836 | s=input()
l=[]
for i in s:
l.append(i)
new_l = l[::-1]
count=0
for a,b in zip(l,new_l):
if a != b:
count+=1
print(count)
| s=input()
l=[]
for i in s:
l.append(i)
new_l = l[::-1]
count=0
for a,b in zip(l,new_l):
if a != b:
count+=1
print(count//2)
| [
"expression.operation.binary.add"
] | 639,902 | 639,903 | u095844416 | python |
p02836 | s = input()
cnt = 0
for i in range(int(len(s) // 2)):
if s[i] != s[-i]:
cnt += 1
print(cnt) | s = input()
cnt = 0
for i in range(int(len(s) // 2)):
if s[i] != s[-i-1]:
cnt += 1
print(cnt)
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 639,912 | 639,913 | u733774002 | python |
p02836 | s=input()
n=len(s)
ans=0
for i,j in zip(s[:n//2-1],s[n:n//2-1:-1]):
if i!=j:
ans+=1
print(ans) | s=input()
n=len(s)
ans=0
for i,j in zip(s[:n//2],s[:n//2-1:-1]):
if i!=j:
ans+=1
print(ans) | [
"expression.operation.binary.remove",
"call.arguments.change"
] | 639,914 | 639,915 | u480264129 | python |
p02836 | S=input()
count=0
for i in range(S):
if S[i]!=S[-i-1]:
count+=1
print(count) | S=input()
count=0
for i in range(len(S)//2):
if S[i]!=S[-i-1]:
count+=1
print(count) | [
"call.add"
] | 639,916 | 639,917 | u963944915 | python |
p02836 | s = input()
l = len(s)
ans = 0
for i in range(l // 2):
if s[i]!=s[-i]:
ans += 1
print(ans)
| s = input()
l = len(s)
ans = 0
for i in range(l // 2):
if s[i]!=s[l-1-i]:
ans += 1
print(ans)
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 639,919 | 639,920 | u873736356 | python |
p02836 | s = input()
n = len(s)//2
cnt = 0
for i in range(n):
if (s[i] != s[n - 1 - i]):
cnt+=1
print(cnt)
| s = input()
n = len(s)
cnt = 0
for i in range(n//2):
if (s[i] != s[n - 1 - i]):
cnt+=1
print(cnt)
| [
"expression.operation.binary.remove"
] | 639,921 | 639,922 | u566574814 | python |
p02836 | s = input()
n = len(s)
cnt = 0
for i in range(n):
if (s[i] != s[n - 1 - i]):
cnt+=1
print(cnt)
| s = input()
n = len(s)
cnt = 0
for i in range(n//2):
if (s[i] != s[n - 1 - i]):
cnt+=1
print(cnt)
| [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 639,923 | 639,922 | u566574814 | python |
p02836 | #B
from collections import deque
s = deque(list(input()))
cnt = 0
while 1 <= len(s):
r = s.pop()
l = s.popleft()
if r != l:
cnt += 1
print(cnt) | #B
from collections import deque
s = deque(list(input()))
cnt = 0
while 1 < len(s):
r = s.pop()
l = s.popleft()
if r != l:
cnt += 1
print(cnt) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 639,925 | 639,926 | u297667660 | python |
p02836 | S=input()
cnt=0
for i in range(len(S)//2-1):
if S[i]!=S[-1*i]:
cnt+=1
print(cnt) | S=input()
cnt=0
for i in range(len(S)//2):
if S[i]!=S[-i-1]:
cnt+=1
print(cnt) | [
"expression.operation.binary.remove",
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 639,934 | 639,935 | u038819082 | python |
p02836 | S=input()
cnt=0
for i in range(S//2):
if S[i]!=S[-i]:
cnt+=1
print(cnt) | S=input()
cnt=0
for i in range(len(S)//2):
if S[i]!=S[-i-1]:
cnt+=1
print(cnt) | [
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 639,936 | 639,935 | u038819082 | python |
p02836 | import math
s = input()
S = s[::-1]
print(S)
count = 0
for i in range(0, len(s)):
if s[i] != S[i]:
count += 1
print(math.floor(count/2)) | import math
s = input()
S = s[::-1]
count = 0
for i in range(0, len(s)):
if s[i] != S[i]:
count += 1
print(math.floor(count/2)) | [
"call.remove"
] | 639,937 | 639,938 | u085530099 | python |
p02836 | s=input()
n=len(n)
c=0
i=0
while i<n-i-1:
if s[i]!=s[n-i-1]:
c+=1
i+=1
print(c) | s=input()
n=len(s)
c=0
i=0
while i<n-i-1:
if s[i]!=s[n-i-1]:
c+=1
i+=1
print(c) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 639,944 | 639,945 | u920103253 | python |
p02836 | S=input()
count=0
for i in range(len(s)//2):
if s[i]!=s[-(i-1)]:
count+=1
print(count) | s=input()
count=0
for i in range(len(s)//2):
if s[i]!=s[-i-1]:
count+=1
print(count) | [
"misc.typo",
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 639,957 | 639,958 | u332793228 | python |
p02836 | s = input()
count = 0
for i in range(len(s)):
if s[i] != s[len(n)-1-i]:
count += 1
print(count//2) | s = input()
count = 0
for i in range(len(s)):
if s[i] != s[len(s)-1-i]:
count += 1
print(count//2)
| [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 639,975 | 639,976 | u626881915 | python |
p02836 | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
s=input()
cnt=0
for i in range(len(s)//2):
if s[i]!=s[-1-i]:
cnt+=1
print(cnt)
resolve | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
s=input()
cnt=0
for i in range(len(s)//2):
if s[i]!=s[-1-i]:
cnt+=1
print(cnt)
resolve()
| [
"call.add"
] | 639,985 | 639,986 | u057964173 | python |
p02836 | s = input()
ans = 0
rs = s.copy()
rs = rs[::-1]
for i in range(len(s)//2):
if s[i] != rs[i]:
ans += 1
print(ans) | s = list(input())
ans = 0
rs = s.copy()
rs = rs[::-1]
for i in range(len(s)//2):
if s[i] != rs[i]:
ans += 1
print(ans) | [
"call.add",
"call.arguments.change"
] | 639,991 | 639,992 | u953379577 | python |
p02836 | s =input()
cnt =0
a =len(s)
if a%2==0:
a = a/2-1
else:
a = a//2 -1
for i in range(int(a)):
if s[i]!=s[-i-1]:
cnt +=1
print(cnt)
| s =input()
cnt =0
a =len(s)
if a%2==0:
a = a/2
else:
a = a//2
for i in range(int(a)):
if s[i]!=s[-i-1]:
cnt +=1
print(cnt) | [
"expression.operation.binary.remove"
] | 639,995 | 639,996 | u656919695 | python |
p02836 |
s = input()
n = len(s)
nn = -(-n/2)
ans = 0
for i in range(nn):
if not s[i] == s[n-i-1]:
ans += 1
print(ans) |
s = input()
n = len(s)
nn = -(-n//2)
ans = 0
for i in range(nn):
if not s[i] == s[n-i-1]:
ans += 1
print(ans) | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 639,997 | 639,998 | u028014940 | python |
p02836 | s = input()
n = len(s)
n //= 2
ans = 0
for i in range(n):
if not s[i] == s[n-i-1]:
ans += 1
print(ans) | s = input()
n = len(s)
nn = n//2
ans = 0
for i in range(nn):
if not s[i] == s[n-i-1]:
ans += 1
print(ans) | [
"assignment.value.change",
"assignment.compound.arithmetic.replace.remove",
"expression.operator.arithmetic.replace.add",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 639,999 | 640,000 | u169350228 | python |
p02836 | s = input()
n = len(s)
n //= 2
ans = 0
for i in range(n):
if not s[i] == s[n-i]:
ans += 1
print(ans) | s = input()
n = len(s)
nn = n//2
ans = 0
for i in range(nn):
if not s[i] == s[n-i-1]:
ans += 1
print(ans) | [
"assignment.value.change",
"assignment.compound.arithmetic.replace.remove",
"expression.operator.arithmetic.replace.add",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
... | 640,001 | 640,000 | u169350228 | python |
p02836 | s = input();
if len(s) % 2 == 0:
harf = int(len(s) / 2 - 1);
else:
harf = int((len(s) - 1) / 2);
count = 0;
for i in range(harf):
if s[i] != s[:harf:-1][i]:
count += 1;
print(count); | s = input();
if len(s) % 2 == 0:
harf = int(len(s) / 2 - 1) + 1;
else:
harf = int((len(s) - 1) / 2);
count = 0;
for i in range(harf):
if s[i] != s[::-1][i]:
count += 1;
print(count); | [
"control_flow.branch.if.condition.change"
] | 640,004 | 640,005 | u508061226 | python |
p02836 | import sys
s = sys.stdin.readline().strip()
i = 0
k = -1
cnt = 0
while i < len(s):
if s[i] != s[k]:
cnt += 1
i += 1
k -= 1
print(cnt) | import sys
s = sys.stdin.readline().strip()
i = 0
k = -1
cnt = 0
while i < len(s)/2:
if s[i] != s[k]:
cnt += 1
i += 1
k -= 1
print(cnt)
| [
"control_flow.loop.condition.change"
] | 640,006 | 640,007 | u823885866 | python |
p02836 | s=input()
hug=0
for i in range(len(s)//2):
if s[i]!=s[n-1-i]:
hug=hug+1
print(hug) | s=input()
hug=0
for i in range(len(s)//2):
if s[i]!=s[len(s)-1-i]:
hug=hug+1
print(hug) | [
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.arguments.add"
] | 640,019 | 640,020 | u692498898 | python |
p02836 | S = input()
l = len(S)// 2
ans= 0
for i in range(l):
if S[i] != S[l-i]:
ans += 1
print(ans)
| S = input()
l = len(S)// 2
ans= 0
for i in range(l):
if S[i] != S[-(i+1)]:
ans += 1
print(ans)
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 640,028 | 640,029 | u798260206 | python |
p02836 | S = input()
count=0
for i in range(len(S) // 2):
if S[i] != RS[-1-i]:
count += 1
print(count)
| S = input()
count=0
for i in range(len(S) // 2):
if S[i] != S[-1-i]:
count += 1
print(count) | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 640,040 | 640,041 | u984989720 | python |
p02836 | S = input()
count=0
for i in range(len(S) // 2):
if S[i] != RS[-i-1]:
count += 1
print(count) | S = input()
count=0
for i in range(len(S) // 2):
if S[i] != S[-1-i]:
count += 1
print(count) | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 640,042 | 640,041 | u984989720 | python |
p02836 | s = str(input())
length = len(s)
n = length//2
m = 0
for i in range(n):
x = (i+1)*(-1)
if s[i]!=s[k]:
m += 1
print(m) | s = str(input())
length = len(s)
n = length//2
m = 0
for i in range(n):
x = (i+1)*(-1)
if s[i]!=s[x]:
m += 1
print(m) | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 640,043 | 640,044 | u566321790 | python |
p02836 | s = str(input())
length = len(s)
n = length//2
m = 0
for i in range(n):
x = (i+1)*(-1)
if s[i]==s[k]:
m += 1
print(m)
| s = str(input())
length = len(s)
n = length//2
m = 0
for i in range(n):
x = (i+1)*(-1)
if s[i]!=s[x]:
m += 1
print(m) | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 640,045 | 640,044 | u566321790 | python |
p02836 | s = str(input())
length = len(s)
n = length//2
m = 0
for i in range(length):
x = (i+1)*(-1)
if s[i]==s[k]:
m += 1
print(m)
| s = str(input())
length = len(s)
n = length//2
m = 0
for i in range(n):
x = (i+1)*(-1)
if s[i]!=s[x]:
m += 1
print(m) | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change"
] | 640,046 | 640,044 | u566321790 | python |
p02836 | s = list(input())
s1 = s[::-1]
count = 0
for i in range(len(s)):
if s[i]!=s1[i]:
count += 1
print(count)
| s = list(input())
s1 = s[::-1]
count = 0
for i in range(len(s)):
if s[i]!=s1[i]:
count += 1
print(count//2)
| [
"expression.operation.binary.add"
] | 640,049 | 640,050 | u472696272 | python |
p02836 | s = list(input())
if len(s)%2!=0:
point = int((len(s)-1)/2)
count = 0
for i in range(1,int((len(s)-1)/2+1)):
if s[point-i]!=s[point+i]:
count += 1
print(count)
exit()
elif len(s)%2==0:
point1 = int(len(s)/2-1)
point2 = int(len(s)/2)
count = 0
for i in range(1,int(len(s)/2)):
if s[point1... | s = list(input())
if len(s)%2!=0:
point = int((len(s)-1)/2)
count = 0
for i in range(0,int((len(s)-1)/2+1)):
if s[point-i]!=s[point+i]:
count += 1
print(count)
exit()
elif len(s)%2==0:
point1 = int(len(s)/2-1)
point2 = int(len(s)/2)
count = 0
for i in range(0,int(len(s)/2)):
if s[point1... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 640,051 | 640,052 | u472696272 | python |
p02836 | s = list(input())
if len(s)%2!=0:
point = int((len(s)-1)/2)
count = 0
for i in range(1,int((len(s)-1)/2+1)):
if s[point-i]!=s[point+i]:
count += 1
print(count)
exit()
elif len(s)%2==0:
point1 = int(len(s)/2-1)
point2 = int(len(s)/2)
count = 0
for i in range(1,int(len(s)/2)):
if s[point1... | s = list(input())
if len(s)%2!=0:
point = int((len(s)-1)/2)
count = 0
for i in range(0,int((len(s)-1)/2+1)):
if s[point-i]!=s[point+i]:
count += 1
print(count)
exit()
elif len(s)%2==0:
point1 = int(len(s)/2-1)
point2 = int(len(s)/2)
count = 0
for i in range(0,int(len(s)/2)):
if s[point1... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 640,053 | 640,052 | u472696272 | python |
p02836 | s = list(input())
if len(s)%2!=0:
point = int((len(s)-1)/2)
count = 0
for i in range(1,int((len(s)-1)/2+1)):
if s[point-i]!=s[point+i]:
count += 1
print(count)
exit()
elif len(s)%2==0:
point1 = int(len(s)/2-1)
point2 = int(len(s)/2)
count = 0
for i in range(1,int(len(s)/2-1)):
if s[poin... | s = list(input())
if len(s)%2!=0:
point = int((len(s)-1)/2)
count = 0
for i in range(0,int((len(s)-1)/2+1)):
if s[point-i]!=s[point+i]:
count += 1
print(count)
exit()
elif len(s)%2==0:
point1 = int(len(s)/2-1)
point2 = int(len(s)/2)
count = 0
for i in range(0,int(len(s)/2)):
if s[point1... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change",
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 640,054 | 640,052 | u472696272 | python |
p02835 | a1, a2, a3 = map(int, input().split())
if a2+a2+a3 >= 22:
print('bust')
else:
print('win') | a1, a2, a3 = map(int, input().split())
if a1+a2+a3 >= 22:
print('bust')
else:
print('win') | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 640,072 | 640,073 | u804733539 | python |
p02835 | print("bust") if sum(map(int, input().split()))>21 else ("win") | print("bust") if sum(map(int, input().split()))>21 else print("win") | [
"io.output.change",
"call.add"
] | 640,076 | 640,077 | u702786238 | python |
p02835 | a =list( map(int, input.split()) )
a = sum(a)
if(a>=22):
print("bust")
else:
print("win") | a =list( map(int, input().split()) )
a = sum(a)
if(a>=22):
print("bust")
else:
print("win")
| [
"call.add"
] | 640,081 | 640,082 | u693580433 | python |
p02835 | a =list( map(int, input.split()) )
a = sum(a)
if(a>=22):
print("bust")
else:
print("win")
| a =list( map(int, input().split()) )
a = sum(a)
if(a>=22):
print("bust")
else:
print("win")
| [
"call.add"
] | 640,083 | 640,082 | u693580433 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.