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 9
values |
|---|---|---|---|---|---|---|---|
p02833 | N = int(input())
num = 10
ans = 0
if N % 2 == 1:
print(0)
else:
while(num < N):
ans += N // num
num *= 5
print(ans) | N = int(input())
num = 10
ans = 0
if N % 2 == 1:
print(0)
else:
while(num <= N):
ans += N // num
num *= 5
print(ans) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 636,970 | 636,971 | u054856689 | python |
p02833 | n = int(input())
def f(num):
num = num - int(str(num)[-1])
count = 0
i = 1
while True:
if ((5 ** i) * (2)) > num:
break
count += (num // ((5 ** i) * (2)))
i += 1
return count
# 偶数 => 出てくる5の個数
# 奇数 => 0
if n % 2 == 1:
print(0)
exit()
else:
print(f(n)... | n = int(input())
def f(num):
num = num - int(str(num)[-1])
count = 0
i = 1
while True:
if ((5 ** i) * (2)) > num:
break
count += (num // ((5 ** i) * (2)))
i += 1
return count
# 偶数 => 出てくる5の個数
# 奇数 => 0
if n % 2 == 1:
print(0)
exit()
else:
print(f(n)... | [
"call.remove"
] | 636,980 | 636,979 | u652057333 | python |
p02833 | n=int(input())
if n%2==1:
print(0)
else:
n=n//2
i=0
while 5**i<n:
i=i+1
count=0
for j in range(1,i):
count+=n//(5**j)
print(count)
| n=int(input())
if n%2==1:
print(0)
else:
n=n//2
i=0
while 5**i<n:
i=i+1
count=0
for j in range(1,i+1):
count+=n//(5**j)
print(count) | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 636,981 | 636,982 | u652569315 | python |
p02833 | # -*- coding: utf-8 -*-
def solve():
N = int(input())
if N & 2:
res = 0
else:
q = 10
p5 = 0
while N // q:
p5 += N // q
q *= 5
q = 2
p2 = 0
while N // q:
p2 += N // q
q *= 2
res = min(p2, p5)
... | # -*- coding: utf-8 -*-
def solve():
N = int(input())
if N % 2:
res = 0
else:
q = 10
p5 = 0
while N // q:
p5 += N // q
q *= 5
q = 2
p2 = 0
while N // q:
p2 += N // q
q *= 2
res = min(p2, p5)
... | [
"control_flow.branch.if.condition.change"
] | 636,989 | 636,990 | u667469290 | python |
p02833 | #coding:utf-8
def cnt_five(n):
i = 1
cnt = 0
while 5 ** i < n:
cnt += n // (5 ** i)
i += 1
return cnt
n = int(input())
if n % 2 != 0:
print(0)
else:
n //= 2
print(cnt_five(n))
| #coding:utf-8
def cnt_five(n):
i = 1
cnt = 0
while 5 ** i <= n:
cnt += n // (5 ** i)
i += 1
return cnt
n = int(input())
if n % 2 != 0:
print(0)
else:
n //= 2
print(cnt_five(n))
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 637,006 | 637,007 | u724563664 | python |
p02833 | N=int(input())
if N<5 or N%2==1:
print(0)
else:
N=N/2
flag=0
while(N>=5):
N=int(N//5)
flag+=N//1
print(int(flag//1)) | N=int(input())
if N<5 or N%2==1:
print(0)
else:
N=N//2
flag=0
while(N>=5):
N=int(N//5)
flag+=N
print(int(flag//1)) | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 637,016 | 637,017 | u594477812 | python |
p02833 | n=int(input())
if n%2==0:
n=(n)//2
ans=0
f=5
while f<=n:
ans+=n//f
f*=5
print(ans) | n=int(input())
if n%2==0:
n=(n)//2
ans=0
f=5
while f<=n:
ans+=n//f
f*=5
print(ans)
else:
print(0) | [
"call.add"
] | 637,039 | 637,040 | u261843559 | python |
p02833 | from sys import exit
N = int(input())
if N % 2 == 1:
print(0)
exit()
result = 0
t = 10
while t < N:
result += N // t
t *= 5
print(result)
| from sys import exit
N = int(input())
if N % 2 == 1:
print(0)
exit()
result = 0
t = 10
while t <= N:
result += N // t
t *= 5
print(result)
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 637,043 | 637,044 | u347640436 | python |
p02833 | N = int(input())
ans = 0
if N%2 == 0:
for i in range(10**5):
if 5**(i+1) > N:
break
ans += int((N)//5**(i+1))
print(ans)
else:
print(0)
| N = int(input())
ans = 0
if N%2 == 0:
for i in range(10**5):
if 5**(i+1) > N:
break
ans += int(N//(5**(i+1)*2))
print(ans)
else:
print(0)
| [
"call.arguments.change"
] | 637,050 | 637,051 | u385244248 | python |
p02833 | import math
import random
from operator import itemgetter
import re
import sys
from itertools import accumulate
from collections import defaultdict
from collections import deque
from bisect import bisect_left,bisect
from heapq import heappop,heappush
from math import gcd
from copy import deepcopy
N = int(input())
ans =... | import math
import random
from operator import itemgetter
import re
import sys
from itertools import accumulate
from collections import defaultdict
from collections import deque
from bisect import bisect_left,bisect
from heapq import heappop,heappush
from math import gcd
from copy import deepcopy
N = int(input())
ans =... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 637,052 | 637,053 | u513900925 | python |
p02833 | n = int(input())
if n % 2 == 1:
out = 0
else:
n2 = n // 2
tmp5 = 5
out = 0
while tmp5 < n2:
out += (n2 // tmp5)
tmp5 *= 5
print(out) | n = int(input())
if n % 2 == 1:
out = 0
else:
n2 = n // 2
tmp5 = 5
out = 0
while tmp5 <= n2:
out += (n2 // tmp5)
tmp5 *= 5
print(out) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 637,063 | 637,064 | u496407619 | python |
p02833 | #import numpy as np
def cin():
return map(int, input().split())
n = int(input())
print(n)
cnt = 0
if n % 2 == 1:
print(0)
exit(0)
div = 1
n //= 2
for i in range(33):
div *= 5
cnt += n // div
print(cnt)
| #import numpy as np
def cin():
return map(int, input().split())
n = int(input())
cnt = 0
if n % 2 == 1:
print(0)
exit(0)
div = 1
n //= 2
for i in range(33):
div *= 5
cnt += n // div
print(cnt)
| [
"call.remove"
] | 637,067 | 637,068 | u771524928 | python |
p02833 | n=int(input())
if n%2==1:
print(0)
else:
f=0
i=1
while i<20:
f+=n//(10**i)
i+=1
print(f) | n=int(input())
if n%2==1:
print(0)
else:
f=0
i=1
while i<100:
f+=n//((5**i)*2)
i+=1
print(f)
| [
"literal.number.integer.change",
"control_flow.loop.condition.change",
"expression.operation.binary.change"
] | 637,071 | 637,072 | u223904637 | python |
p02833 | import math
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
def bitlist(x,digit):
res = [0 for i in range(digit)]
now... | import math
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
def bitlist(x,digit):
res = [0 for i in range(digit)]
now... | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 637,093 | 637,094 | u366541443 | python |
p02833 | #E
N = int(input())
if N%2 == 1:
print(0)
else:
m = 5
ans = 0
n = N//2
while m < n:
ans+=(n//m)
m*=5
print(ans)
| #E
N = int(input())
if N%2 == 1:
print(0)
else:
m = 5
ans = 0
n = N//2
while m <= n:
ans+=(n//m)
m*=5
print(ans)
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 637,103 | 637,104 | u533885955 | python |
p02833 | def main():
import sys
n=int(input())
if n%2==1:
print(0)
sys.exit()
i=10
ans=0
while i<n:
ans+=n//i
i*=5
print(ans)
if __name__ == '__main__':
main() | def main():
import sys
n=int(input())
if n%2==1:
print(0)
sys.exit()
i=10
ans=0
while i<=n:
ans+=n//i
i*=5
print(ans)
if __name__ == '__main__':
main() | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 637,107 | 637,108 | u197300773 | python |
p02833 | n=int(input())
if(n%2==1):
print(0)
else:
n=n/2
count=0
i=5
while(n//i>=1):
count+=int(n/(i))
i*=5
print(int(count)) | n=int(input())
if(n%2==1):
print(0)
else:
n=n//2
count=0
i=5
while(n//i>=1):
count+=n//(i)
i*=5
print(int(count)) | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.remove",
"call.arguments.change"
] | 637,122 | 637,123 | u597456301 | python |
p02833 | N = int(input())
a = 0
b = 0
n = 1
b = 2*5**(n)
if N % 2 == 1:
print(0)
else:
while b <= N:
print(b)
a += int(N // b)
n += 1
b = 2*5**(n)
print(a) | N = int(input())
a = 0
b = 0
n = 1
b = 2*5**(n)
if N % 2 == 1:
print(0)
else:
while b <= N:
a += int(N // b)
n += 1
b = 2*5**(n)
print(a) | [
"call.remove"
] | 637,126 | 637,127 | u025287757 | python |
p02833 | n = int(input())
res = 0
if n % 2 == 0:
m = n // 2
while m > 5:
res += m // 5
m //= 5
print(res) | n = int(input())
res = 0
if n % 2 == 0:
m = n // 2
while m >= 5:
res += m // 5
m //= 5
print(res) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 637,130 | 637,131 | u933341648 | python |
p02833 | N = int(input())
num = 10
ans = 0
if N%2 == 0:
for i in range(10**6):
if num<N:
ans += N//num
num = num*5
else:
print(ans)
break
else:
print(0) | N = int(input())
num = 10
ans = 0
if N%2 == 0:
for i in range(10**6):
if num<=N:
ans += N//num
num = num*5
else:
print(ans)
break
else:
print(0)
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 637,132 | 637,133 | u556589653 | python |
p02833 | N = int(input())
num = 10
ans = 0
if N%2 == 0:
for i in range(100):
if num<N:
ans += N//num
num = num*5
else:
print(ans)
break
else:
print(0) | N = int(input())
num = 10
ans = 0
if N%2 == 0:
for i in range(10**6):
if num<=N:
ans += N//num
num = num*5
else:
print(ans)
break
else:
print(0)
| [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 637,134 | 637,133 | u556589653 | python |
p02833 | N = int(input())
d = 2
count = 0
if N % 2 == 1:
print(0)
else:
for i in range(N+1):#n回回す 0~n-1まで
d *= 5
if d > N:
break
count += int(N/d)
print(count)
| N = int(input())
d = 2
count = 0
if N % 2 == 1:
print(0)
else:
for i in range(N+1):#n回回す 0~n-1まで
d *= 5
if d > N:
break
count += N//d
print(count)
| [
"call.remove",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 637,141 | 637,142 | u334703235 | python |
p02833 | '''
sekai_no_owari
愛
'''
def findTrailingZeros(n):
# Initialize result
count = 0
# Keep dividing n by
# powers of 5 and
# update Count
i=10
while (n/i>=1):
count += int(n/i)
i *= 5
return int(count)
n = int(input())
if n%2 != 0:
print(0)
els... | '''
sekai_no_owari
愛
'''
def findTrailingZeros(n):
# Initialize result
count = 0
# Keep dividing n by
# powers of 5 and
# update Count
i=10
while (n/i>0):
count += n//i
i *= 5
return int(count)
n = int(input())
if n%2 != 0:
print(0)
else:
... | [
"call.remove",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 637,163 | 637,164 | u539850805 | python |
p02833 | #e
n = int(input())
#f(n) = 1 (n < 2)
#f(n) = n*f(n - 2) (n>=2)
#def f(n):
# if n < 2: return 1
# else: return n * f(n - 2)
#n * (n-2) * ... * 3 if n is odd
#n * (n-2) * ... * 2 if n is even
# 2,4,6,8,10,...50,...,250,...,1250
# 10
# 20 * 50
# 40 * 250
# 60 * 500
if n % 2 == 1: ans = 0
else:
ans = 0
... | #e
n = int(input())
#f(n) = 1 (n < 2)
#f(n) = n*f(n - 2) (n>=2)
#def f(n):
# if n < 2: return 1
# else: return n * f(n - 2)
#n * (n-2) * ... * 3 if n is odd
#n * (n-2) * ... * 2 if n is even
# 2,4,6,8,10,...50,...,250,...,1250
# 10
# 20 * 50
# 40 * 250
# 60 * 500
if n % 2 == 1: ans = 0
else:
ans = 0
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 637,166 | 637,167 | u055529891 | python |
p02833 | #e
n = int(input())
#f(n) = 1 (n < 2)
#f(n) = n*f(n - 2) (n>=2)
#def f(n):
# if n < 2: return 1
# else: return n * f(n - 2)
#n * (n-2) * ... * 3 if n is odd
#n * (n-2) * ... * 2 if n is even
# 2,4,6,8,10,...50,...,250,...,1250
# 10
# 20 * 50
# 40 * 250
# 60 * 500
if n % 2 == 1: ans = 0
else:
ans = 0
... | #e
n = int(input())
#f(n) = 1 (n < 2)
#f(n) = n*f(n - 2) (n>=2)
#def f(n):
# if n < 2: return 1
# else: return n * f(n - 2)
#n * (n-2) * ... * 3 if n is odd
#n * (n-2) * ... * 2 if n is even
# 2,4,6,8,10,...50,...,250,...,1250
# 10
# 20 * 50
# 40 * 250
# 60 * 500
if n % 2 == 1: ans = 0
else:
ans = 0
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"call.add",
"call.arguments.change"
] | 637,168 | 637,167 | u055529891 | python |
p02833 | N=int(input())
def fact(N,k):
t=0
c=0
while(k**t<N):
t=t+1
for i in range(1,t+1):
c+=N//(k**i)
return c
if N%2!=0:
print(0)
else:
c2=fact(N,2)
c5=fact(N,5)
print(min(c2,c5))
| N=int(input())
def fact(N,k):
t=0
c=0
while(k**t<N):
t=t+1
for i in range(1,t+1):
c+=N//(k**i)
return c
if N%2!=0:
print(0)
else:
c2=fact(N//2,2)
c5=fact(N//2,5)
print(min(c2,c5)) | [
"assignment.change"
] | 637,169 | 637,170 | u692311686 | python |
p02833 | def trail(N):
if N&1:
return 0
cnt=0
x=1
while x*10 < N:
cnt+=(N//(x*10))
x=5*x
return cnt
print(trail(int(input()))) | def trail(N):
if N&1:
return 0
cnt=0
x=1
while x < N:
cnt+=(N//(x*10))
x=5*x
return cnt
print(trail(int(input())))
# print(trail(400)) | [
"expression.operation.binary.remove"
] | 637,177 | 637,178 | u859773831 | python |
p02833 | N = int(input())
f = 5
ans = 0
if(N % 2 == 1):
print(0)
else:
while N >= f:
ans += int(N / (f * 2))
f *= 5
print(ans) | N = int(input())
f = 5
ans = 0
if(N % 2 == 1):
print(0)
else:
while N >= f:
ans += int(N // (f * 2))
f *= 5
print(ans) | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 637,190 | 637,191 | u580073714 | python |
p02833 | N = int(input())
f = 5
ans = 0
if(N % 2 == 1):
print(0)
else:
while N > f:
ans += int(N / (f * 2))
f *= 5
print(ans) | N = int(input())
f = 5
ans = 0
if(N % 2 == 1):
print(0)
else:
while N >= f:
ans += int(N // (f * 2))
f *= 5
print(ans) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 637,192 | 637,191 | u580073714 | python |
p02833 | n = int(input())
m = n//2
list = []
ans = 0
if n%2==1:
print(0)
else:
for j in range(1,10000):
ans += m//(5**j)
print(ans)
| n = int(input())
m = n//2
ans = 0
if n%2==1:
print(0)
else:
for j in range(1,100):
ans += m//(5**j)
print(ans)
| [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 637,209 | 637,210 | u970082363 | python |
p02833 | n=int(input())
if n%2==1:
print(0)
else:
c=0
i=0
while True:
i+=1
c+=int(n/((5**i)*2))
if int(n/(5**i))==0:
break
#i+=1
print(c) | n=int(input())
if n%2==1:
print(0)
else:
c=0
i=0
while True:
i+=1
c+=int(n//((5**i)*2))
#print((5**i)*2,c)
if int(n//(5**i))==0:
break
#i+=1
print(c) | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 637,219 | 637,220 | u811132356 | python |
p02833 | n=int(input())
if n%2==1:
print(0)
else:
c=0
i=0
while True:
i+=1
c+=int(n/((5**i)*2))
if int(n/((5**i)*2))==0:
break
#i+=1
print(c) | n=int(input())
if n%2==1:
print(0)
else:
c=0
i=0
while True:
i+=1
c+=int(n//((5**i)*2))
#print((5**i)*2,c)
if int(n//(5**i))==0:
break
#i+=1
print(c) | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 637,221 | 637,220 | u811132356 | python |
p02833 | n = int(input())
if n%2==1:
print(0)
else:
ans = n//10
k = 1
n = n//10
while 5**k < n:
ans += n//(5**k)
k+=1
print(ans) | n = int(input())
if n%2==1:
print(0)
else:
ans = n//10
k = 1
n = n//10
while 5**k <= n:
ans += n//(5**k)
k+=1
print(ans) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 637,226 | 637,227 | u202570162 | python |
p02833 | from math import log
n = int(input(n))
if n % 2 == 1:
print(0)
else:
m = n // 2
total = 0
for p in range(1, int(log(m, 5)) + 1):
total += m // (5 ** p)
print(total) | from math import log
n = int(input())
if n % 2 == 1 or n == 0:
print(0)
else:
m = n // 2
total = 0
for p in range(1, int(log(m, 5)) + 1):
total += m // (5 ** p)
print(total) | [
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 637,234 | 637,233 | u401830498 | python |
p02834 | from collections import defaultdict
N, u, v = map(int, input().split())
d = defaultdict(list)
for _ in range(N-1):
A, B = map(int, input().split())
d[A].append(B)
d[B].append(A)
def get_dist(s):
dist = [-1]*(N+1)
dist[s] = 0
q = [s]
while q:
a = q.pop()
for b in d[a]:
... | from collections import defaultdict
N, u, v = map(int, input().split())
d = defaultdict(list)
for _ in range(N-1):
A, B = map(int, input().split())
d[A].append(B)
d[B].append(A)
def get_dist(s):
dist = [-1]*(N+1)
dist[s] = 0
q = [s]
while q:
a = q.pop()
for b in d[a]:
... | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 637,260 | 637,261 | u690536347 | python |
p02834 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
from collections import deque
n, u, v = map(int, readline().split())
graph = [[] for _ in range(n + 1)]
for i in range(n - 1):
a, b = map(int, readline().split())
... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
from collections import deque
n, u, v = map(int, readline().split())
graph = [[] for _ in range(n + 1)]
for i in range(n - 1):
a, b = map(int, readline().split())
... | [
"call.remove"
] | 637,264 | 637,265 | u691018832 | python |
p02834 | import sys
sys.setrecursionlimit(2*10**5)
n, u, v = map(int, input().split())
edge = [tuple(map(int, input().split())) for _ in range(n-1)]
u -= 1
v -= 1
connect = [set() for _ in range(n)]
for a, b in edge:
connect[a-1].add(b-1)
connect[b-1].add(a-1)
du = [0] * n
dv = [0] * n
def dfs(v, dis, ng, d):
d[... | import sys
sys.setrecursionlimit(2*10**5)
n, u, v = map(int, input().split())
edge = [tuple(map(int, input().split())) for _ in range(n-1)]
u -= 1
v -= 1
connect = [set() for _ in range(n)]
for a, b in edge:
connect[a-1].add(b-1)
connect[b-1].add(a-1)
du = [0] * n
dv = [0] * n
def dfs(v, dis, ng, d):
d[... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change"
] | 637,278 | 637,279 | u955251526 | python |
p02834 | import sys
sys.setrecursionlimit(10**9)
N, u, v = map(int, input().split())
u, v = u-1, v-1
edge = [[] for _ in range(N)]
for i in range(N-1):
a, b = map(int, input().split())
a, b = a-1, b-1
edge[a].append(b)
edge[b].append(a)
taka = [0] * N
aoki = [0] * N
def dfs(v, pre, cost, i):
for e in edge... | import sys
sys.setrecursionlimit(10**9)
N, u, v = map(int, input().split())
u, v = u-1, v-1
edge = [[] for _ in range(N)]
for i in range(N-1):
a, b = map(int, input().split())
a, b = a-1, b-1
edge[a].append(b)
edge[b].append(a)
taka = [0] * N
aoki = [0] * N
def dfs(v, pre, cost, i):
for e in edge... | [
"expression.operation.binary.add"
] | 637,282 | 637,283 | u814781830 | python |
p02834 | import sys
sys.setrecursionlimit(10**9)
N, u, v = map(int, input().split())
u, v = u-1, v-1
edge = [[] for _ in range(N)]
for i in range(N-1):
a, b = map(int, input().split())
a, b = a-1, b-1
edge[a].append(b)
edge[b].append(a)
taka = [0] * N
aoki = [0] * N
def dfs(v, pre, cost, i):
for e in edge... | import sys
sys.setrecursionlimit(10**9)
N, u, v = map(int, input().split())
u, v = u-1, v-1
edge = [[] for _ in range(N)]
for i in range(N-1):
a, b = map(int, input().split())
a, b = a-1, b-1
edge[a].append(b)
edge[b].append(a)
taka = [0] * N
aoki = [0] * N
def dfs(v, pre, cost, i):
for e in edge... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 637,284 | 637,283 | u814781830 | python |
p02834 | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
minans = inf ;ans = 0 ;count = 0 ;pro = 1
sys.setrecursionlimit(10**7)
n,u,v=map(int,input().split())
u-=1;v-=1
G=[[] for i in range(n)]
for i i... | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
minans = inf ;ans = 0 ;count = 0 ;pro = 1
sys.setrecursionlimit(10**7)
n,u,v=map(int,input().split())
u-=1;v-=1
G=[[] for i in range(n)]
for i i... | [
"call.arguments.change"
] | 637,289 | 637,290 | u716530146 | python |
p02834 | N,u,v = map(int,input().split())
E = [[] for _ in range(N + 1)]
for i in range(N-1):
a,b = map(int,input().split())
E[a].append(b)
E[b].append(a)
#print(E)
def bfs(start,N):
d = [-1]*(N+1)
d[start] = 0
q = [start]
while q:
#print(d,q)
v = q.pop()
cnt = d[v]+1
... | N,u,v = map(int,input().split())
E = [[] for _ in range(N + 1)]
for i in range(N-1):
a,b = map(int,input().split())
E[a].append(b)
E[b].append(a)
#print(E)
def bfs(start,N):
d = [-1]*(N+1)
d[start] = 0
q = [start]
while q:
#print(d,q)
v = q.pop()
cnt = d[v]+1
... | [
"assignment.add"
] | 637,295 | 637,296 | u557282438 | python |
p02834 | import heapq
import sys
input = sys.stdin.readline
def dijkstra_heap(s,edge,n):
#始点sから各頂点への最短距離
d = [10**20] * n
used = [True] * n #True:未確定
d[s] = 0
used[s] = False
edgelist = []
for a,b in edge[s]:
heapq.heappush(edgelist,a*(10**6)+b)
while len(edgelist):
minedge = he... | import heapq
import sys
input = sys.stdin.readline
def dijkstra_heap(s,edge,n):
#始点sから各頂点への最短距離
d = [10**20] * n
used = [True] * n #True:未確定
d[s] = 0
used[s] = False
edgelist = []
for a,b in edge[s]:
heapq.heappush(edgelist,a*(10**6)+b)
while len(edgelist):
minedge = he... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 637,297 | 637,298 | u761529120 | python |
p02834 | def main():
from functools import lru_cache
import sys
input=sys.stdin.readline
sys.setrecursionlimit(100000000)
n,u,v=map(int,input().split())
u-=1
v-=1
tree=[[] for i in range(n)]
for i in range(n-1):
a,b=map(int,input().split())
a-=1
b-=1
tree[a].a... | def main():
from functools import lru_cache
import sys
input=sys.stdin.readline
sys.setrecursionlimit(100000000)
n,u,v=map(int,input().split())
u-=1
v-=1
tree=[[] for i in range(n)]
for i in range(n-1):
a,b=map(int,input().split())
a-=1
b-=1
tree[a].a... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 637,301 | 637,302 | u561231954 | python |
p02834 | from collections import deque
n, u, v = map(int, input().split())
u-=1; v-=1;
a = []; b = [];
dist = [[] for i in range(n)]
for i in range(n-1):
a, b = map(int, input().split())
a -= 1; b -= 1
dist[a].append(b)
dist[b].append(a)
def bfs(u):
d = [-1]*n
stack = deque([u])
d[u] = 0
while l... | from collections import deque
n, u, v = map(int, input().split())
u-=1; v-=1;
a = []; b = [];
dist = [[] for i in range(n)]
for i in range(n-1):
a, b = map(int, input().split())
a -= 1; b -= 1
dist[a].append(b)
dist[b].append(a)
def bfs(u):
d = [-1]*n
stack = deque([u])
d[u] = 0
while l... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 637,303 | 637,304 | u056801547 | python |
p02834 | n,u,v = map(int,input().split())
inf = 10 ** 6
u -= 1
v -= 1
peer = [[] for _ in range(n)]
for _ in range(n-1):
a,b = map(int,input().split())
a -= 1
b -= 1
peer[a].append(b)
peer[b].append(a)
seen = [0 for _ in range(n)]
rank = [0 for _ in range(n)]
seen[v] = 1
now = [v]
pst = [[] for _ in range(n)]
pre = [i... | n,u,v = map(int,input().split())
inf = 10 ** 6
u -= 1
v -= 1
peer = [[] for _ in range(n)]
for _ in range(n-1):
a,b = map(int,input().split())
a -= 1
b -= 1
peer[a].append(b)
peer[b].append(a)
seen = [0 for _ in range(n)]
rank = [0 for _ in range(n)]
seen[v] = 1
now = [v]
pst = [[] for _ in range(n)]
pre = [i... | [
"call.remove"
] | 637,312 | 637,313 | u111365362 | python |
p02834 | import sys
sys.setrecursionlimit(200000)
def dfs(array, current, count):
array[current - 1] = count
for neighbour in graph[current]:
if array[neighbour - 1] == -1:
array = dfs(array, neighbour, count + 1)
else:
return array
T = [-1 for x in range(100000)]
A = [-1 for x in range(100000)]
graph = {... | import sys
sys.setrecursionlimit(200000)
def dfs(array, current, count):
array[current - 1] = count
for neighbour in graph[current]:
if array[neighbour - 1] == -1:
array = dfs(array, neighbour, count + 1)
else:
return array
T = [-1 for x in range(100000)]
A = [-1 for x in range(100000)]
graph = {... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 637,326 | 637,327 | u638057737 | python |
p02834 | n,u,v=map(int,input().split())
u-=1;v-=1
edge=[[]*n for _ in range(n)]
for _ in range(n-1):
a,b=map(int,input().split())
a-=1;b-=1
edge[a].append(b)
edge[b].append(a)
# from u 逃げる
# uはvからみた距離が大きい方に進むのかな
# from v 追う
# v始点でBFSして各頂点への距離を持つ
dist=[-1]*n
from collections import deque
q=deque()
q.append(v)
dist... | n,u,v=map(int,input().split())
u-=1;v-=1
edge=[[]*n for _ in range(n)]
for _ in range(n-1):
a,b=map(int,input().split())
a-=1;b-=1
edge[a].append(b)
edge[b].append(a)
# from u 逃げる
# uはvからみた距離が大きい方に進むのかな
# from v 追う
# v始点でBFSして各頂点への距離を持つ
dist=[-1]*n
from collections import deque
q=deque()
q.append(v)
dist... | [
"expression.operation.unary.add"
] | 637,359 | 637,360 | u130900604 | python |
p02834 | #!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify
import itertools
import math, fractions
import sys, copy
def L(): return sys.stdin.readline().split()... | #!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify
import itertools
import math, fractions
import sys, copy
def L(): return sys.stdin.readline().split()... | [
"assignment.value.change",
"call.arguments.change"
] | 637,366 | 637,367 | u481187938 | python |
p02834 | #!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify
import itertools
import math, fractions
import sys, copy
def L(): return sys.stdin.readline().split()... | #!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify
import itertools
import math, fractions
import sys, copy
def L(): return sys.stdin.readline().split()... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 637,368 | 637,369 | u481187938 | python |
p02834 | from collections import deque
def nearlist(N, LIST): # 隣接リスト
NEAR = [set() for _ in range(N)]
for a, b in LIST:
NEAR[a - 1].add(b - 1)
NEAR[b - 1].add(a - 1)
return NEAR
def bfs(NEAR, S, N): # 幅優先探索 # キュー
dist = [-1 for _ in range(N)] # 前処理
dist[S] = 0
que, frag = deque([... | from collections import deque
def nearlist(N, LIST): # 隣接リスト
NEAR = [set() for _ in range(N)]
for a, b in LIST:
NEAR[a - 1].add(b - 1)
NEAR[b - 1].add(a - 1)
return NEAR
def bfs(NEAR, S, N): # 幅優先探索 # キュー
dist = [-1 for _ in range(N)] # 前処理
dist[S] = 0
que, frag = deque([... | [] | 637,381 | 637,382 | u222668979 | python |
p02834 | from collections import deque
n, u, v = map(int,input().split())
tree = [[] for _ in range(n+1)]
for _i in range(n-1):
a, b = map(int, input().split())
tree[a].append(b)
tree[b].append(a)
def solve(x):
visit = [-1 for _ in range(n+1)]
visit[x] = 0
q = deque([x])
while q:
p = q.popl... | from collections import deque
n, u, v = map(int,input().split())
tree = [[] for _ in range(n+1)]
for _i in range(n-1):
a, b = map(int, input().split())
tree[a].append(b)
tree[b].append(a)
def solve(x):
visit = [-1 for _ in range(n+1)]
visit[x] = 0
q = deque([x])
while q:
p = q.popl... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 637,444 | 637,445 | u413165887 | python |
p02834 | import sys
sys.setrecursionlimit(10**9)
from collections import deque
class LCA1():
def __init__(self, l, start):
self.n = len(l)
self.dep=[0]*self.n
self.par=[[-1]*self.n for i in range(18)]
def bfs(start):
is_leaf = [0]*n
que = deque()
que.app... | import sys
sys.setrecursionlimit(10**9)
from collections import deque
class LCA1():
def __init__(self, l, start):
self.n = len(l)
self.dep=[0]*self.n
self.par=[[-1]*self.n for i in range(18)]
def bfs(start):
is_leaf = [0]*n
que = deque()
que.app... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 637,464 | 637,465 | u803848678 | python |
p02834 | from collections import deque
def solve(n, u, v, edge_list):
# graph
g = [[] for i in range(n)]
for a, b in edge_list:
g[a].append(b)
g[b].append(a)
# root at v
parent = [0] * n
depth = [0] * n
parent[v] = -1
queue = deque([v])
while len(queue) > 0:
p = que... | from collections import deque
def solve(n, u, v, edge_list):
# graph
g = [[] for i in range(n)]
for a, b in edge_list:
g[a].append(b)
g[b].append(a)
# root at v
parent = [0] * n
depth = [0] * n
parent[v] = -1
queue = deque([v])
while len(queue) > 0:
p = que... | [
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 637,472 | 637,473 | u104282757 | python |
p02834 | import sys
sys.setrecursionlimit(1000000)
def dfs(cur, par, g, d):
pars[cur] = par
for to in g[cur]:
if to == par:
continue
d[to] = d[cur]+1
md[cur] = max(md[cur], dfs(to, cur, g, d)+1)
return md[cur]
n, u, v = map(int, input().split())
u -= 1
v -= 1
g = []
for i in ... | import sys
sys.setrecursionlimit(1000000)
def dfs(cur, par, g, d):
pars[cur] = par
for to in g[cur]:
if to == par:
continue
d[to] = d[cur]+1
md[cur] = max(md[cur], dfs(to, cur, g, d)+1)
return md[cur]
n, u, v = map(int, input().split())
u -= 1
v -= 1
g = []
for i in ... | [] | 637,474 | 637,475 | u591717585 | python |
p02834 | from collections import deque
N,u,v=map(int,input().split())
u-=1
v-=1
L=[list() for _ in range(N)]
for _ in range(N-1):
a,b=map(int,input().split())
a-=1
b-=1
L[a].append(b)
L[b].append(a)
q=deque([(v,0)])
T=[-1]*N
A=[-1]*N
while q:
p,x=q.pop()
A[p]=x
for to in L[p]:
if A[to... | from collections import deque
N,u,v=map(int,input().split())
u-=1
v-=1
L=[list() for _ in range(N)]
for _ in range(N-1):
a,b=map(int,input().split())
a-=1
b-=1
L[a].append(b)
L[b].append(a)
q=deque([(v,0)])
T=[-1]*N
A=[-1]*N
while q:
p,x=q.pop()
A[p]=x
for to in L[p]:
if A[to... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 637,505 | 637,506 | u722535636 | python |
p02834 | import heapq;
n, u, v = [int(v) for v in input().split()]
vert = []
for i in range(n):
vert.append([])
for i in range(n - 1):
a, b = [int(v) - 1 for v in input().split()]
vert[a].append(b)
vert[b].append(a)
taka = u-1
aoki = v-1
if taka == aoki:
print(0)
exit()
q = [(0, aoki)]
aoki_dist =... | import heapq;
n, u, v = [int(v) for v in input().split()]
vert = []
for i in range(n):
vert.append([])
for i in range(n - 1):
a, b = [int(v) - 1 for v in input().split()]
vert[a].append(b)
vert[b].append(a)
taka = u-1
aoki = v-1
if taka == aoki:
print(0)
exit()
q = [(0, aoki)]
aoki_dist =... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 637,595 | 637,596 | u006883624 | python |
p02834 | import sys
sys.setrecursionlimit(10 ** 5)
def dfs(v, parent, depth):
parents[v] = parent
self_depths[v] = depth
sd = 0
for u in links[v]:
if u == parent:
continue
res = dfs(u, v, depth + 1)
sd = max(sd, res + 1)
subtree_depths[v] = sd
return sd
def solve... | import sys
sys.setrecursionlimit(10 ** 5)
def dfs(v, parent, depth):
parents[v] = parent
self_depths[v] = depth
sd = 0
for u in links[v]:
if u == parent:
continue
res = dfs(u, v, depth + 1)
sd = max(sd, res + 1)
subtree_depths[v] = sd
return sd
def solve... | [
"control_flow.loop.condition.change"
] | 637,599 | 637,600 | u340781749 | python |
p02834 | import sys
import collections
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n, u, v = list(map(int, readline().split()))
tmd = collections.defaultdict(list)
for i in range(n-1):
tma, tmb = list(map(int, readline().split()))
tmd[tma-1] += [tmb-1]
tmd[tm... | import sys
import collections
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n, u, v = list(map(int, readline().split()))
tmd = collections.defaultdict(list)
for i in range(n-1):
tma, tmb = list(map(int, readline().split()))
tmd[tma-1] += [tmb-1]
tmd[tm... | [
"expression.operation.binary.add"
] | 637,605 | 637,606 | u753803401 | python |
p02834 | import sys
from collections import deque
input = sys.stdin.readline
n, u, v = map(int, input().split())
E = [[] for i in range(n)]
for i in range(n - 1):
a, b = map(int, input().split())
E[a-1].append(b-1)
E[b-1].append(a-1)
memo = [[0, 0] for i in range(n)]
def dfs(cur, pre, p):
stack = deque([[cur... | import sys
from collections import deque
input = sys.stdin.readline
n, u, v = map(int, input().split())
E = [[] for i in range(n)]
for i in range(n - 1):
a, b = map(int, input().split())
E[a-1].append(b-1)
E[b-1].append(a-1)
memo = [[0, 0] for i in range(n)]
def dfs(cur, pre, p):
stack = deque([[cur... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 637,624 | 637,625 | u711539583 | python |
p02834 | import sys
from collections import deque
input = sys.stdin.readline
n, u, v = map(int, input().split())
E = [[] for i in range(n)]
for i in range(n - 1):
a, b = map(int, input().split())
E[a-1].append(b-1)
E[b-1].append(a-1)
memo = [[0, 0] for i in range(n)]
def dfs(cur, pre, p):
stack = deque([[cur... | import sys
from collections import deque
input = sys.stdin.readline
n, u, v = map(int, input().split())
E = [[] for i in range(n)]
for i in range(n - 1):
a, b = map(int, input().split())
E[a-1].append(b-1)
E[b-1].append(a-1)
memo = [[0, 0] for i in range(n)]
def dfs(cur, pre, p):
stack = deque([[cur... | [
"control_flow.branch.if.add"
] | 637,626 | 637,625 | u711539583 | python |
p02835 | print('bust' if sum(list(map,input().split()))>=22 else 'win') | print('bust' if sum(list(map(int,input().split())))>=22 else 'win')
| [
"call.arguments.add",
"call.arguments.change"
] | 637,646 | 637,647 | u539367121 | 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') | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 637,658 | 637,659 | u363421241 | python |
p02835 | a1, a2, a3 = map(int,input().split())
if a1 + 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') | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 637,664 | 637,665 | u418826171 | python |
p02835 | print('win' if sum(map(int, input().split())) < 21 else 'bust') | print('win' if sum(map(int, input().split())) < 22 else 'bust') | [
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 637,666 | 637,667 | u682672120 | python |
p02835 | p = list(map(int, input().split()))
if sum(p) >= 22:
print('bust')
else:
print('Win')
| p = list(map(int, input().split()))
if sum(p) >= 22:
print('bust')
else:
print('win')
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 637,668 | 637,669 | u162612857 | python |
p02835 | A = list(map(int, input().split()))
if sum(A) >= 22:
print('bust')
else:
print('Yes')
| A = list(map(int, input().split()))
if sum(A) >= 22:
print('bust')
else:
print('win')
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 637,674 | 637,675 | u819910751 | python |
p02835 | print("win" if sun(map(int,input().split()))<=21 else "bust") | print("win" if sum(map(int,input().split()))<=21 else "bust")
| [
"identifier.change",
"call.function.change",
"call.arguments.change",
"io.output.change"
] | 637,678 | 637,679 | u556594202 | python |
p02835 | print(['bust','win'][sum(map(int,input.split()))<22]) | print(['bust','win'][sum(map(int,input().split()))<22]) | [
"call.add"
] | 637,682 | 637,683 | u179169725 | 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 > 21:
print('bust')
else:
print('win')
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 637,700 | 637,702 | u506910932 | python |
p02835 | def main():
A = list(map(int, input().split()))
if sum(A) <= 22:
print('win')
else:
print('bust')
main() | def main():
A = list(map(int, input().split()))
if sum(A) <= 21:
print('win')
else:
print('bust')
main() | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 637,705 | 637,706 | u690833702 | python |
p02835 | def main():
A = list(map(int, input().split()))
if sum(A) <= 22:
print('win')
else:
print('dust')
main() | def main():
A = list(map(int, input().split()))
if sum(A) <= 21:
print('win')
else:
print('bust')
main() | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 637,707 | 637,706 | u690833702 | python |
p02835 | A = list(map(int, input().split()))
if sum(A) >= 22:
print("burst")
else:
print("win") | A = list(map(int, input().split()))
if sum(A) >= 22:
print("bust")
else:
print("win")
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 637,722 | 637,723 | u870518235 | python |
p02835 | print("win" if sum(list(map(int,input().split())))<21 else "bust") | print("win" if sum(list(map(int,input().split())))<=21 else "bust") | [
"expression.operator.compare.change",
"call.arguments.change",
"io.output.change"
] | 637,724 | 637,725 | u519968172 | python |
p02835 | a, b, c = map(int, input())
if a + b + c >= 22:
print('bust')
else:
print('win') | a, b, c = map(int, input().split())
if a + b + c >= 22:
print('bust')
else:
print('win') | [
"call.add"
] | 637,759 | 637,760 | u841021102 | python |
p02835 | lst = list(map(int, input().split()))
total = 0
for i in lst:
total += 1
if total>= 22:
print('bust')
else:
print('win') | lst = list(map(int, input().split()))
total = 0
for i in lst:
total += i
if total>= 22:
print('bust')
else:
print('win') | [
"identifier.replace.add",
"literal.replace.remove"
] | 637,773 | 637,774 | u004233621 | python |
p02835 | a,b,c=map(int,input().split())
if a+b+c >= 22:
print('burst')
else:
print('win') | a,b,c=map(int,input().split())
if a+b+c >= 22:
print('bust')
else:
print('win') | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 637,775 | 637,776 | u640800355 | python |
p02835 | L,M,N = map(int,input().split())
print("win" if L+M+N >= 22 else "bust") | L,M,N = map(int,input().split())
print("bust" if L+M+N >= 22 else "win")
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 637,777 | 637,778 | u626228246 | python |
p02835 | a1, a2, a3 = map(int, input())
if a1+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') | [
"call.add"
] | 637,779 | 637,780 | u920694585 | python |
p02835 | a = list(map(int,input().split()))
ans = sum(a)
if ans >= 22:
ans = "burst"
else:
ans = "win"
print(ans) | a = list(map(int,input().split()))
ans = sum(a)
if ans >= 22:
ans = "bust"
else:
ans = "win"
print(ans) | [
"literal.string.change",
"assignment.value.change"
] | 637,781 | 637,782 | u624613992 | python |
p02835 | a = list(map(int,input().split()))
ans = sum(a)
if a >= 22:
ans = "burst"
else:
ans = "win"
print(ans) | a = list(map(int,input().split()))
ans = sum(a)
if ans >= 22:
ans = "bust"
else:
ans = "win"
print(ans) | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"assignment.value.change"
] | 637,783 | 637,782 | u624613992 | python |
p02834 | import sys
input=sys.stdin.readline
n,u,v=map(int,input().split())
Edge=[[] for i in range(n)]
for i in range(n-1):
a,b=map(int,input().split())
Edge[a-1].append(b-1)
Edge[b-1].append(a-1)
from collections import deque
def BFS(s):
dist=[-1]*n
que=deque([s-1])
dist[s-1]=0
while que:
v=que.popleft()
... | import sys
input=sys.stdin.readline
n,u,v=map(int,input().split())
Edge=[[] for i in range(n)]
for i in range(n-1):
a,b=map(int,input().split())
Edge[a-1].append(b-1)
Edge[b-1].append(a-1)
from collections import deque
def BFS(s):
dist=[-1]*n
que=deque([s-1])
dist[s-1]=0
while que:
v=que.popleft()
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 637,794 | 637,795 | u969190727 | python |
p02835 | import sys
stdin=sys.stdin
ip=lambda: int(sp())
lp=lambda:list(map(int,stdin.readline().split()))
sp=lambda:stdin.readline().rstrip()
a,b,c=lp()
if a+b+c>=22:
print('burst')
else:
print('win') | import sys
stdin=sys.stdin
ip=lambda: int(sp())
lp=lambda:list(map(int,stdin.readline().split()))
sp=lambda:stdin.readline().rstrip()
a,b,c=lp()
if a+b+c>=22:
print('bust')
else:
print('win')
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 637,822 | 637,823 | u516554284 | python |
p02835 | from sys import stdin, stdout
def print(x):
stdout.write(str(x))
def solve():
A = [int(x) for x in stdin.readline().split()]
sum = 0
for a in A:
sum += a
if sum <= 22 :
print("win")
else:
print("bust")
def main():
solve()
if __name__ == "__main__":
main() | from sys import stdin, stdout
def print(x):
stdout.write(str(x))
def solve():
A = [int(x) for x in stdin.readline().split()]
sum = 0
for a in A:
sum += a
if sum < 22 :
print("win")
else:
print("bust")
def main():
solve()
if __name__ == "__main__":
main() | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 637,830 | 637,831 | u161190523 | python |
p02835 | if sum(list(map(int,input().split())))>21:
print("burst")
else:
print("win")
| if sum(list(map(int,input().split())))>21:
print("bust")
else:
print("win")
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 637,902 | 637,903 | u630211216 | python |
p02835 | #ABC147
a = [map(int,input().split())]
print("bust" if sum(a)>=22 else "win") | #ABC147
a = list(map(int,input().split()))
print("bust" if sum(a)>=22 else "win") | [
"assignment.value.change",
"call.arguments.change"
] | 637,908 | 637,909 | u904995051 | python |
p02835 | a=list(input().split())
if sum(a)>=22:
print("bust")
elif sum(a)<=21:
print("win") | a=list(map(int,input().split()))
if sum(a)>=22:
print("bust")
elif sum(a)<=21:
print("win") | [
"call.add",
"call.arguments.change"
] | 637,912 | 637,913 | u886902015 | python |
p02834 | from collections import defaultdict
# def find_distances(edge_dict, node, distances):
# for end in edge_dict[node]:
# if distances[end] < 0:
# distances[end] = distances[node] + 1
# distances = find_distances(edge_dict, end, distances)
# return distances
def find_distances(ed... | from collections import defaultdict
# def find_distances(edge_dict, node, distances):
# for end in edge_dict[node]:
# if distances[end] < 0:
# distances[end] = distances[node] + 1
# distances = find_distances(edge_dict, end, distances)
# return distances
def find_distances(ed... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 637,926 | 637,927 | u314585898 | python |
p02834 | N, U, V = map(int, input().split())
A = [[] for _ in range(N)]
import sys
sys.setrecursionlimit(10**8)
for _ in range(N - 1):
a, b = map(int, input().split())
A[a - 1].append(b - 1)
A[b - 1].append(a - 1)
C = [0] * N
D = [0] * N
def DFS(x, pre, cnt, C):
C[x] = cnt
cnt += 1
for a in A[x]:
... | N, U, V = map(int, input().split())
A = [[] for _ in range(N)]
import sys
sys.setrecursionlimit(10**8)
for _ in range(N - 1):
a, b = map(int, input().split())
A[a - 1].append(b - 1)
A[b - 1].append(a - 1)
C = [0] * N
D = [0] * N
def DFS(x, pre, cnt, C):
C[x] = cnt
cnt += 1
for a in A[x]:
... | [
"assignment.add"
] | 637,962 | 637,963 | u223904637 | python |
p02834 | import sys
sys.setrecursionlimit(1000000)
N, u, v = map(int, input().split())
u -= 1
v -= 1
G = [[] for _ in range(N)]
elens = [0] * N
for _ in range(N - 1):
a, b = map(int, input().split())
a -= 1
b -= 1
G[a].append(b)
G[b].append(a)
elens[a] += 1
elens[b] += 1
depths = [0] * N
dists = [0... | import sys
sys.setrecursionlimit(1000000)
N, u, v = map(int, input().split())
u -= 1
v -= 1
G = [[] for _ in range(N)]
elens = [0] * N
for _ in range(N - 1):
a, b = map(int, input().split())
a -= 1
b -= 1
G[a].append(b)
G[b].append(a)
elens[a] += 1
elens[b] += 1
depths = [0] * N
dists = [0... | [
"identifier.change",
"call.function.change"
] | 637,973 | 637,974 | u726872801 | python |
p02834 | sys.setrecursionlimit(1000000)
class Tree:
C, RL = {}, {}
R, N, D, S, P = None, None, None, None, None
def __init__(s, num):
s.N = num
def setC(s, a, b):
if a in s.C: s.C[a].append(b)
else: s.C[a] = [b]
if b in s.C: s.C[b].append(a)
else: s.C[b] = [a]
def makeRank(s, root):
s.R = [0] ... | import sys
sys.setrecursionlimit(1000000)
class Tree:
C, RL = {}, {}
R, N, D, S, P = None, None, None, None, None
def __init__(s, num):
s.N = num
def setC(s, a, b):
if a in s.C: s.C[a].append(b)
else: s.C[a] = [b]
if b in s.C: s.C[b].append(a)
else: s.C[b] = [a]
def makeRank(s, root):
... | [] | 637,986 | 637,987 | u456353530 | python |
p02834 | sys.setrecursionlimit(100000)
class Tree:
C, RL = {}, {}
R, N, D, S, P = None, None, None, None, None
def __init__(s, num):
s.N = num
def setC(s, a, b):
if a in s.C: s.C[a].append(b)
else: s.C[a] = [b]
if b in s.C: s.C[b].append(a)
else: s.C[b] = [a]
def makeRank(s, root):
s.R = [0] *... | import sys
sys.setrecursionlimit(1000000)
class Tree:
C, RL = {}, {}
R, N, D, S, P = None, None, None, None, None
def __init__(s, num):
s.N = num
def setC(s, a, b):
if a in s.C: s.C[a].append(b)
else: s.C[a] = [b]
if b in s.C: s.C[b].append(a)
else: s.C[b] = [a]
def makeRank(s, root):
... | [
"literal.number.integer.change",
"call.arguments.change"
] | 637,988 | 637,987 | u456353530 | python |
p02834 | N, u, v = map(int, input().split())
u -= 1
v -= 1
table = [[] for i in range(N)]
for i in range(N-1):
A, B = map(int, input().split())
A -= 1
B -= 1
table[A].append(B)
table[B].append(A)
dist_u = [-1]*N
dist_v = [-1]*N
dist_u[u] = 0
dist_v[v] = 0
from collections import deque
H = deque()
H.append... | N, u, v = map(int, input().split())
u -= 1
v -= 1
table = [[] for i in range(N)]
for i in range(N-1):
A, B = map(int, input().split())
A -= 1
B -= 1
table[A].append(B)
table[B].append(A)
dist_u = [-1]*N
dist_v = [-1]*N
dist_u[u] = 0
dist_v[v] = 0
from collections import deque
H = deque()
H.append... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"assignment.value.change"
] | 637,995 | 637,996 | u285443936 | python |
p02834 | n, uplus, vplus = map(int, input().split())
u, v = uplus-1, vplus-1
adj = [[] for _ in range(n)]
for _ in range(n-1):
aplus, bplus = map(int, input().split())
a, b = aplus-1, bplus-1
adj[a].append(b)
adj[b].append(a)
u_dist = [n] * n
u_dist[u] = 0
stack = [u]
while stack:
vertex = stack.pop()
for nxt in ad... | n, uplus, vplus = map(int, input().split())
u, v = uplus-1, vplus-1
adj = [[] for _ in range(n)]
for _ in range(n-1):
aplus, bplus = map(int, input().split())
a, b = aplus-1, bplus-1
adj[a].append(b)
adj[b].append(a)
u_dist = [n] * n
u_dist[u] = 0
stack = [u]
while stack:
vertex = stack.pop()
for nxt in ad... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 637,997 | 637,998 | u686230543 | python |
p02834 | n,u,v = map(int, input().split( ))
u-=1
v-=1
Tr = [[] for _ in range(n)]
for i in range(n-1):
ai,bi = map(int, input().split( ))
ai -=1
bi-=1
Tr[ai].append(bi)
Tr[bi].append(ai)
Dep_u = [-1] *n
Dep_v = [-1] *n
Dep_u[u] = 0
Dep_v[v] = 0
from collections import deque
##bfs2回が簡明
def bfs(L,x):
Q... | n,u,v = map(int, input().split( ))
u-=1
v-=1
Tr = [[] for _ in range(n)]
for i in range(n-1):
ai,bi = map(int, input().split( ))
ai -=1
bi-=1
Tr[ai].append(bi)
Tr[bi].append(ai)
Dep_u = [-1] *n
Dep_v = [-1] *n
Dep_u[u] = 0
Dep_v[v] = 0
from collections import deque
##bfs2回が簡明
def bfs(L,x):
Q... | [
"literal.number.integer.change",
"assignment.value.change"
] | 638,004 | 638,005 | u520276780 | python |
p02834 | n,u,v = map(int, input().split( ))
u-=1
v-=1
Tr = [[] for _ in range(n)]
for i in range(n-1):
ai,bi = map(int, input().split( ))
ai -=1
bi-=1
Tr[ai].append(bi)
Tr[bi].append(ai)
Dep_u = [-1] *n
Dep_v = [-1] *n
Dep_u[u] = 0
Dep_v[v] = 0
from collections import deque
##bfs2回が簡明
def bfs(L,x):
Q... | n,u,v = map(int, input().split( ))
u-=1
v-=1
Tr = [[] for _ in range(n)]
for i in range(n-1):
ai,bi = map(int, input().split( ))
ai -=1
bi-=1
Tr[ai].append(bi)
Tr[bi].append(ai)
Dep_u = [-1] *n
Dep_v = [-1] *n
Dep_u[u] = 0
Dep_v[v] = 0
from collections import deque
##bfs2回が簡明
def bfs(L,x):
Q... | [
"literal.number.integer.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 638,006 | 638,005 | u520276780 | python |
p02835 | a = list(map(int, input().split()))
if sum(a) >= 22:
print('bust')
else:
printt('win') | a = list(map(int, input().split()))
if sum(a) >= 22:
print('bust')
else:
print('win') | [
"identifier.change",
"call.function.change",
"io.output.change"
] | 638,047 | 638,048 | u471503862 | python |
p02835 | a1,a2,a3 = map(int,input().split())
if a1+a2+a3>=22:
print("burst")
else:
print("win") | a1,a2,a3=map(int,input().split())
if a1+a2+a3>=22:
print("bust")
else:
print("win") | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 638,051 | 638,052 | u287930276 | python |
p02835 | As = list(map(int, input().split()))
print("bust" if sum(As) >22 else "win") | As = list(map(int, input().split()))
print("bust" if sum(As) >= 22 else "win") | [
"expression.operator.compare.change",
"call.arguments.change",
"io.output.change"
] | 638,053 | 638,054 | u655663334 | python |
p02835 | print('win' if sum(list(map(int,input().split())))<22 else 'burst') | print('win' if sum(list(map(int,input().split())))<22 else 'bust') | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 638,059 | 638,060 | u480264129 | python |
p02835 | # coding: utf-8
a = list(map(int, input().split()))
if sum(a) > 21:
print("bust")
else:
print(win) | # coding: utf-8
a = list(map(int, input().split()))
if sum(a) > 21:
print("bust")
else:
print("win") | [
"call.arguments.change"
] | 638,067 | 638,068 | u502247093 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.