Harryxun/GPT-100-sft-dataset huggingface dataset:
Problem p02760 (python)

Fixed submission:
import sys
bingo = [list(map(int, input().split())) for i in range(3)]
N = int(input())

for i in range(N):
    b = int(input())
    for j in range(len(bingo)):
      for k in range(len(bingo[j])):
            if b == bingo[j][k]:
                bingo[j][k] = 0

for i in range(len(bingo)):
    if sum(bingo[i]) == 0:
        print('Yes')
        sys.exit()
    if (bingo[0][i] + bingo[1][i] + bingo[2][i]) == 0:
        print('Yes')
        sys.exit()

for i in [0]:
  if (bingo[i][i] + bingo[i+1][i+1] + bingo[i+2][i+2]) == 0:
    print('Yes')
    sys.exit()
  if (bingo[i][i+2] + bingo[i+1][i+1] + bingo[i+2][i]) == 0:
    print('Yes')
    sys.exit()
  else:
    print("No")

Buggy submission (verdict: Runtime Error):
# B problem
inp = [int(x) for x in input().rstrip('\n').split()]

bingo = inp[0:9]
b = inp[10:]

for i in b:
    for j in range(len(bingo)):
            if i == bingo[j]:
                bingo[j] = 0

true_list = list()
for i in [0, 3, 6]:
    if (bingo[i] + bingo[i+1] + bingo[i+2]) == 0:
        true_list.append(0)
for i in [0, 1, 2]:
    if (bingo[i] + bingo[i+3] + bingo[i+6]) == 0:
        true_list.append(0)
if (bingo[0] + bingo[4] + bingo[8]) == 0:
    true_list.append(0)
if (bingo[2] + bingo[4] + bingo[6]) == 0:
    true_list.append(0)

if not all(true_list):
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
inp = [int(x) for x in input().split()]

bingo = inp[0:9]
b = inp[10:]

for i in b:
    for j in range(len(bingo)):
            if i == bingo[j]:
                bingo[j] = 0

true_list = list()
for i in [0, 3, 6]:
    if (bingo[i] + bingo[i+1] + bingo[i+2]) == 0:
        true_list.append(0)
for i in [0, 1, 2]:
    if (bingo[i] + bingo[i+3] + bingo[i+6]) == 0:
        true_list.append(0)
if (bingo[0] + bingo[4] + bingo[8]) == 0:
    true_list.append(0)
if (bingo[2] + bingo[4] + bingo[6]) == 0:
    true_list.append(0)

if not all(true_list):
    print('Yes')
else:
    print('No')
Problem p02760 (python)

Fixed submission:

a,b,c= map(int,input().rstrip().split())
d,e,f= map(int,input().rstrip().split())
g,h,i= map(int,input().rstrip().split())

mylist=[a,b,c,d,e,f,g,h,i]
num = int(input())

for i in range(num):
    x = int(input())
    k=0
    for j in mylist:
      if j==x:
        mylist[k]=0
      k+=1

x=0
def bingo(a,b,c):
  global x
  if mylist[a]==0 and mylist[b]==0 and mylist[c]==0:
    x=1
      
      
bingo(0,1,2)
bingo(3,4,5)
bingo(6,7,8)
bingo(0,3,6)
bingo(1,4,7)
bingo(2,5,8)
bingo(0,4,8)
bingo(2,4,6)


if x==1:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
mylist=[]

mylist= map(int,input().rstrip().split())
mylist= map(int,input().rstrip().split())
mylist = map(int,input().rstrip().split())

num = int(input())

for i in range(num):
    x = map(int,input().rstrip().split())
    k=0
    for j in mylist:
      if j==x:
        mylist[k]=0
      k+=1
            
bingo(0,1,2)
bingo(3,4,5)
bingo(6,7,8)
bingo(0,3,6)
bingo(1,4,7)
bingo(2,5,8)
bingo(0,4,8)
bingo(2,4,6)

      
def bingo(x,y,z):
  if mylist[a]==0 and mylist[b]==0 mylist[c]==0:
    print("Yes")
  else:
    print("No")

print(result)
Problem p03469 (python)

Fixed submission:
s = input()

b = s.split('/')

b[0] = b[0].replace('7','8')

print('/'.join(b))

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
s = row_input()

b = s.split('/')

b[0].replace('7','8')


# 出力
print('/'.join(b))
Problem p03799 (python)

Fixed submission:
def main():
    s, c = map(int, raw_input().split())
    count = 0
    if s > c/2:
        return c/2
    elif s == c/2:
        return s
    elif s < c/2:
        return s + ((c-2*s)/4)
print main()

Buggy submission (verdict: Runtime Error):
def main():
    s, c = map(int, raw_input().split())
    count = 0
    for i in range(s):
        if(c >= 2):
            count += 1
            c -= 2
        else:
            break
    for i in range(c):
        if(c >= 4):
            count += 1
            c -= 4
        else:
            break
    return count

print main()

Buggy submission (verdict: Runtime Error):
def main():
    s, c = map(int, input.row().split())
    count = 0
    for i in range(s):
        if(c >= 2):
            count += 1
            c -= 2
        else:
            break
    for i in range(c):
        if(c >= 4):
            count += 1
            c -= 4
        else:
            break
    return count

print main()
Problem p03817 (python)

Fixed submission:
def main():
    x = int(raw_input())
    if x > 6:
       if (x - 6) % 11 == 0:
           op1 = (x - 6)/11
           op2 = x/11 + 1
       elif x % 11 == 0 :
           op1 = (x - 6)/11 + 1
           op2 = x/11
       else:
           op1 = (x - 6)/11 + 1
           op2 = x/11 + 1
       return op1+op2
    else:
        return 1
print main()

Buggy submission (verdict: Runtime Error):
def main():
    N = int(raw_input())
    x = map(int, raw_input().split())
    #-1:remove , 0:singe , 1~:label 
    check= [0] * N
    flag = False
    label = 1
    c = 0
    x.sort()

    #labeling
    for i in range(N):
        for j in range(N):
            if(i != j):
                if(x[i] == x[j]):
                    flag = True
        if flag:
            if i > 0:
                if(x[i] != x[i-1]):
                    label += 1
                    check[i] = label
                else:
                    check[i] = label
            else:
                check[i] = label
        flag = False
    
    #removing
    for i in range(N-1):
        if(check[i] > 0 and check[i+1] == check[i]):
            for j in range(N):
                if(check[i] != check[j] and check[j] > 0 and flag == False):
                     check[i] = -1
                     check[j] = -1
                     if j < N-2:
                         check[j+1] != check[j+2]
                         check[j+1] = 0
                     else:
                         check[j+1] = 0
                     flag = True
            if flag == False:     
                check[check.index(0)] = -1
                check[i] = -1
            else:
                flag = False
        elif check[i] != -1:
            check[i] = 0
    for i in range(N):
        if check[i] == 0:
            c += 1
    return c
print main()
Problem p03493 (python)

Fixed submission:
string = input()
counter = 0
for ele in string:
    if ele == "1":
        counter += 1
print(counter)

Buggy submission (verdict: Runtime Error):
n = int(input())
array = [int(input()) for i in range(n)]
def shift_only(array):
    tmp = []
    counter = 0
    while True:
        flag = True
        for num in array:
            if num%2 != 0:
                flag = False
        if flag == False:
            break
        array = [i/2 for i in array]
        counter +=1
    print(counter)
shift_only(array)

Buggy submission (verdict: Runtime Error):
n = int(input())
array = [int(input()) for i in range(n)]
def shift_only(array):
    tmp = []
    counter = 0
    while True:
        flag = True
        # 全て偶数かを確認
        for num in array:
            if num%2 != 0:
                flag = False
        if flag == False:
            break
        array = [i/2 for i in array]
        counter +=1
    print(counter)
shift_only(array)

Buggy submission (verdict: Runtime Error):
def how_many_times_divisible(n):
	ans = 0
	while n % 2 == 0:
		n /= 2
		ans += 1
	return ans
 
n = int(raw_input())
a = map(int, raw_input().split())
ans = min(map(how_many_times_divisible, a))
 
print ans
Problem p03494 (python)

Fixed submission:
def shift_only(array):
    tmp = []
    counter = 0
    while True:
        flag = True
        # 全て偶数かを確認
        for num in array:
            if num%2 != 0:
                flag = False
        if flag == False:
            break
        array = [i/2 for i in array]
        counter +=1
    print(counter)
    
n = int(input())
a = list(map(int, input().split()))
shift_only(a)

Buggy submission (verdict: Runtime Error):
n = int(input())
array = mat(int, input().split)
def shift_only(array):
    tmp = []
    counter = 0
    while True:
        flag = True
        # 全て偶数かを確認
        for num in array:
            if num%2 != 0:
                flag = False
        if flag == False:
            break
        array = [i/2 for i in array]
        counter +=1
    print(counter)
shift_only(array)

Buggy submission (verdict: Runtime Error):
n = int(input())
array = [int(input()) for i in range(n)]
def shift_only(array):
    tmp = []
    counter = 0
    while True:
        flag = True
        # 全て偶数かを確認
        for num in array:
            if num%2 != 0:
                flag = False
        if flag == False:
            break
        array = [i/2 for i in array]
        counter +=1
    print(counter)
shift_only(array)

Buggy submission (verdict: Runtime Error):
n = int(input())
array = [int(input()) for i in range(n)]
def shift_only(array):
    tmp = []
    counter = 0
    while True:
        flag = True
        # 全て偶数かを確認
        for num in array:
            if num%2 != 0:
                flag = False
        if flag == False:
            break
        array = [i/2 for i in array]
        counter +=1
    print(counter)
Problem p02761 (python)

Fixed submission:
n,m = list(map(int,input().split()))
ans = [-1]*n
for i in range(m):
    s,c = list(map(int,input().split()))
    if ans[s-1] != -1 and ans[s-1] != c:
        ans = -1
        break
    ans[s-1] = c
    if s == 1 and n != 1 and c == 0:
        ans = -1
        break    

if ans != -1:
    if ans[0] == -1 and n != 1:
        ans[0] = 1
    for i in range(n):
        if ans[i] == -1:
            ans[i] = '0'
        else:
            ans[i] = str(ans[i])
    print(''.join(ans))
else:
    print(ans)

Buggy submission (verdict: Runtime Error):
n,m = list(map(int,input().split()))
ans = [-1]*n
for i in range(m):
    s,c = list(map(int,input().split()))
    if ans[s-1] != -1 and ans[s-1] != c:
        ans = -1
        break
    ans[s-1] = c
    if s == 1 and n != 1 and c == 0:
        ans = -1
        break    
if ans[0] == -1 and n != 1:
    ans[0] = 1
if ans != -1:
    for i in range(n):
        if ans[i] == -1:
            ans[i] = '0'
        else:
            ans[i] = str(ans[i])
    print(''.join(ans))
else:
    print(ans)

Buggy submission (verdict: Runtime Error):
n,m = list(map(int,input().split()))
ans = [-1]*n
if m == 0:
    print(0)
else:
    for i in range(m):
        s,c = list(map(int,input().split()))
        if ans[s-1] != -1 and ans[s-1] != c:
            ans = -1
            break
        ans[s-1] = c
        if s == 1 and n != 1 and c == 0:
            ans = -1
            break    
    if ans[0] == -1:
        print(-1)
    elif ans != -1:
        for i in range(n):
            if ans[i] == -1:
                ans[i] = '0'
            else:
                ans[i] = str(ans[i])
        print(''.join(ans))
    else:
        print(ans)
Problem p02768 (python)

Fixed submission:
n,a,b = list(map(int,input().split()))
mod = 10**9 + 7

ans = (pow(2,n,mod) - 1) %mod
numerator = 1%mod
denominator = 1%mod
for i in range(1,b+1):
    numerator = (numerator*(n+1-i))%mod
    denominator = (denominator*pow(i,mod-2,mod))%mod
    if i == a or i == b:
        ans = (ans - (numerator*denominator))%mod

print(ans)

Buggy submission (verdict: Runtime Error):
n,a,b = list(map(int,input().split()))
mod = 10**9 + 7
ans = (pow(2,n,mod) - 1
numerator = 1
denominator = 1

for i in range(1,n+1):
    numerator = (numerator*(n-i+1))%mod
    denominator = (denominator*i)%mod
    if i == a or i == b:
        ans = ans - (numerator*pow(denominator,mod-2,mod))%mod
        if i == b:
            break

print(ans%mod)
Problem p02882 (python)

Fixed submission:
import math
a,b,x = list(map(int,input().split()))
if a*b*0.5*a > x:
    c = (2*x) / (a*b)
    ans = 90 - math.degrees(math.atan(c/b))
    print(ans)
else:
    c = (2*x) / a**2 - b
    if b-c == 0:
        ans = 0
    else:
        ans = 90 - math.degrees(math.atan(a/(b-c)))
    print(ans)

Buggy submission (verdict: Runtime Error):
import math
a,b,x = list(map(int,input().split()))
if a*b*0.5*a > x:
    c = (2*x) / (a*b)
    ans = 90 - math.degrees(math.atan(c/b))
    print(ans)
else:
    c = (2*x) / a**2 - b
    ans = 90 - math.degrees(math.atan(a/(b-c)))
    print(ans)

Buggy submission (verdict: Runtime Error):
import math
a,b,x = list(map(int,input().split()))
# b*c*1/2 * a = x
if a*b*0.5*a > x:
    c = (2*x) / (a*b)
    ans = 90 - math.degrees(math.atan(c/b))
    print(ans)
else:
    c = (2*x) / a**2 - b
# (b+c)*a *1/2 *a = x
    ans = 90 - math.degrees(math.atan(a/(b-c)))
    print(ans)
Problem p02889 (python)

Fixed submission:
import numpy as np
from scipy.sparse.csgraph import floyd_warshall

N,M,L = map(int,input().split())
gurahu = np.zeros((N,N))

for k in range(M):
    a,b,c = map(int,input().split())
    gurahu[a-1,b-1] = c
    gurahu[b-1,a-1] = c

gurahu = floyd_warshall(gurahu, directed=False)
gurahu = np.where((gurahu <= L) & (gurahu > 0), 1, 0)
gurahu = floyd_warshall(gurahu) - np.ones((N, N))

Q = int(input())

for k in range(Q):
    s,t = map(int,input().split())
    ans = gurahu[s-1,t-1]
    if ans == float('inf'):
        print(-1)
    else:
        print(int(ans))

Buggy submission (verdict: Runtime Error):
import numpy as numpy
from scipy.sparse.csgraph import floyd_warshall

N,M,L = map(int,input().split())
gurahu = np.zeros((N,N))

for k in range(M):
    a,b,c = map(int,input().split())
    gurahu[a-1,b-1] = c
    gurahu[b-1,a-1] = c

gurahu = floyd_warshall(gurahu, directed=False)
gurahu = np.where(gurahu <= L and gurahu > 0, 1, 0)
gurahu = floyd_warshall(gurahu) - np.ones((N, N))

Q = int(input())

for k in range(Q):
    s,t = map(int,input().split())
    print(gurahu[s-1,t-1])

Buggy submission (verdict: Runtime Error):
import numpy as numpy
from scipy.sparse.csgraph import floyd_warshall

N,M,L = map(int,input().split())
gurahu = np.zeros(N,N)

for k in range(M):
    a,b,c = map(int,input().split())
    gurahu[a-1][b-1] = c
    gurahu[b-1][a-1] = c

gurahu = floyd_warshall(gurahu, directed=False)
for s in range(N):
    for t in range(N):
        if gurahu[s][t] <= L:
            gurahu[s][t] = 0
        else:
            gurahu[s][t] = 1
gurahu = floyd_warshall(gurahu)

Q = int(input())

for k in range(Q):
    s,t = map(int,input().split())
    print(gurahu[s-1][t-1])
Problem p03044 (python)

Fixed submission:
import sys
sys.setrecursionlimit(10**9)
n = int(input())
graph = [[]for i in range(n)]
for i in range(n-1):
    pre = list(map(int,input().split()))
    graph[pre[0]-1].extend([pre[1]-1,pre[2]])
    graph[pre[1]-1].extend([pre[0]-1,pre[2]])
seen = [0 for i in range(n)]
color = [-1 for i in range(n)]

def DFS(x):
    if seen[x] == 1:
        return 0
    else:
        pass
    seen[x] = 1
    for i in range(len((graph[x]))//2):
        if graph[x][2*i+1] % 2 == 0:
            color[graph[x][2*i]] = color[x]
        else:
            color[graph[x][2*i]] = not color[x]

    for i in range(len((graph[x]))//2):
        DFS(graph[x][2*i])

color[0] = True
DFS(0)
for i in range(n):
    print(int(color[i]))

Buggy submission (verdict: Runtime Error):
n = int(input())
graph = [[]for i in range(n)]
for i in range(n-1):
    pre = list(map(int,input().split()))
    graph[pre[0]-1].extend([pre[1]-1,pre[2]])
    graph[pre[1]-1].extend([pre[0]-1,pre[2]])
seen = [0 for i in range(n)]
color = [-1 for i in range(n)]

def DFS(x):
    if seen[x] == 1:
        return 0
    else:
        pass
    seen[x] = 1
    for i in range(len((graph[x]))//2):
        if graph[x][2*i+1] % 2 == 0:
            color[graph[x][2*i]] = color[x]
        else:
            color[graph[x][2*i]] = not color[x]

    for i in range(len((graph[x]))//2):
        DFS(graph[x][2*i])

color[0] = True
DFS(0)
for i in range(n):
    print(int(color[i]))
Problem p02765 (python)

Fixed submission:
inp = input().split()
N = int(inp[0])
R = int(inp[1])
#print(N)
if N >= 10:
  print(R)
else:
  col = R + 100*(10-N)
  print(col)

Buggy submission (verdict: Runtime Error):
import math
inp = input().split()
N = int(inp[0])
K = int(inp[1])
S = 0
while N > 0:
	N = math.floor(N / K)
	S += 1

print(S)
Problem p02999 (python)

Fixed submission:
X,A = map(int, input().split())
if X < A:
  print(0)
else:
  print(10)

Buggy submission (verdict: Runtime Error):
N,X = map(int, input().split())
L = [x for x in map(int, input().split())]
accumL = [sum(L[:x]) <= X for x in range(len(L)+1)]
if accumL[-1] == True:
  print(N + 1)
else:
  print(accumL.index(False))
Problem p03000 (python)

Fixed submission:
N,X = map(int, input().split())
L = [x for x in map(int, input().split())]
accumL = [sum(L[:x]) <= X for x in range(len(L)+1)]
if accumL[-1] == True:
  print(N + 1)
else:
  print(accumL.index(False))

Buggy submission (verdict: Runtime Error):
N,X = map(int, input().split())
L = [x for x in map(int, input().split())]
accumL = [sum(L[:x]) <= X for x in range(len(L)+1)]
print(accumL.index(False))

Buggy submission (verdict: Runtime Error):
N,X = map(int, input().split())
L = [x for x in map(int, input().split())]
accumL = [sum(L[:x]) for x in range(len(L)+1)]
TF = [i <= X for i in accumL]
print(TF.index(False))

Buggy submission (verdict: Runtime Error):
N,X = map(int, input().split())
L = [x for x in map(int, input().split())]
accumL = [sum(L[:x]) for x in range(len(L)+1)]
TF = [i < X for i in accumL]
print(str(TF.index(False)+ 1))

Buggy submission (verdict: Runtime Error):
N,X = map(int, input().split())
L = [x for x in map(int, input().split())]
accumL = [sum(L[:x]) for x in range(len(L)+1)]
TF = [i < X for i in accumL]
print(TF.index(False) + 1)

Buggy submission (verdict: Runtime Error):
N,X = map(int, input().split())
L = [x for x in map(int, input().split())]
accumL = [sum(L[:x]) for x in range(len(L)+1)]
TF = [i < X for i in accumL]
print(TF.index(False))

Buggy submission (verdict: Runtime Error):
N,X = map(int, input().split())
L = [map(int,input().split())]
accumL = []
for n in range(len(L)):
  accumL.append(sum(L[:n+1])
s = [x < 4 for x in accumL]
print(str(s.index(False) + 1))
Problem p03220 (python)

Fixed submission:
N = int(input())
T, A = map(int, input().split())
s = [abs(A - (T - 0.006 * x)) for x in map(int, input().split())]
print(s.index(min(s))+1)

Buggy submission (verdict: Runtime Error):
N = int(input())
T, A = map(int, input().split())
s = [abs(A - (T - 0.006 * x)) for x in map(int, input().split())]
print(s.index(min(s) + 1))
Problem p03455 (python)

Fixed submission:
A,B = map(int, input().split())
if A * B % 2 == 0:
  print('Even')
else:
  print('Odd')

Buggy submission (verdict: Runtime Error):
N = int(input())
points = [tuple(map(int, input().split())) for i in range(N)]
points = [(0,0,0)] + points
for idx in range(1,N):
  time_diff = points[idx][0] - points[idx-1][0]
  x_diff = abs(points[idx][1] - points[idx-1][1])
  y_diff = abs(points[idx][2] - points[idx-1][2])
  
  if time_diff < x_diff + y_diff or (time_diff - x_diff - y_diff) % 2 == 1:
    print('No')
    exit()
    
print('Yes')
Problem p03493 (python)

Fixed submission:
print(input().count('1'))

Buggy submission (verdict: Runtime Error):
N = int(input())
numbers = [x for x in map(int, input().split())]
count = 0
on = True
while on:
  val = [x % 2 == 0 for x in numbers]
  if False in val:
    print(count)
    break
  else:
    numbers = [x//2 for x in numbers]
    count += 1
Problem p02760 (python)

Fixed submission:
# coding: utf-8
import sys

A = []
A.append(list(map(int, input().split())))
A.append(list(map(int, input().split())))
A.append(list(map(int, input().split())))

a = [[0,0,0],[0,0,0],[0,0,0]]

N = int(input())
for i in range(N):
    b = int(input())
    for j in range(3):
        if b in A[j]:
            a[j][A[j].index(b)] = 1

flag = False

for i in range(3):
    if 0 not in a[i]: flag = True
    if a[0][i]*a[1][i]*a[2][i] == 1: flag = True
    
if a[0][0]*a[1][1]*a[2][2] == 1: flag = True
if a[0][2]*a[1][1]*a[2][0] == 1: flag = True

print('Yes') if flag == True else print('No')

Buggy submission (verdict: Runtime Error):
# coding: utf-8
import sys
A = []
A.append(map(int, raw_input().split()))
A.append(map(int, raw_input().split()))
A.append(map(int, raw_input().split()))

a = [[0,0,0],[0,0,0],[0,0,0]]

N = int(raw_input())
for i in range(N):
    b = int(raw_input())
    for j in range(3):
        if b in A[j]:
            a[j][A[j].index(b)] = 1

if 0 not in a[0]:
    print 'Yes'    
    sys.exit()
if 0 not in a[1]:
    print 'Yes'
    sys.exit()
if 0 not in a[2]:
	print 'Yes'
    sys.exit()
if a[0][0]*a[1][0]*a[2][0] == 1:
    print 'Yes'
    sys.exit()
if a[0][1]*a[1][1]*a[2][1] == 1:
    print 'Yes'
    sys.exit()
if a[0][2]*a[1][2]*a[2][2] == 1:
    print 'Yes'
    sys.exit()

if a[0][0]*a[1][1]*a[2][2] == 1:
    print 'Yes'
    sys.exit()
if a[0][2]*a[1][1]*a[2][0] == 1:
    print 'Yes'
    sys.exit()
Problem p02761 (python)

Fixed submission:
# coding: utf-8

N, M = list(map(int, input().split()))
begin = 0 if N == 1 else 10**(N-1)

sc = [[i for i in map(int, input().split())] for j in range(M)]

for i in range(begin, 10**N):
    flag = True
    for j in range(M):
        if str(i)[sc[j][0]-1] != str(sc[j][1]):
            flag = False
            break

    if flag == True:
        print(i)
        break

if flag == False: print(-1)

Buggy submission (verdict: Runtime Error):
 coding: utf-8

N, M = list(map(int, input().split()))
begin = 0 if N == 1 else 10**(N-1)

sc = [[i for i in map(int, input().split())] for j in range(M)]

for i in range(begin, 10**N):
    flag = True
    for j in range(M):
        if str(i)[sc[j][0]-1] != str(sc[j][1]):
            flag = False
            break

    if flag == True:
        print(i)
        break

if flag == False: print(-1)
Problem p02882 (python)

Fixed submission:
import sys
import math

a, b, x = map(int, input().split())


if(x > a*a*b):
    sys.exit()

if (a*a*b/2 >= x):
    s = math.degrees(math.atan(a*b*b/2/x))
else:
    s = math.degrees(math.atan(2*(a*a*b-x)/a/a/a))

print (s)

Buggy submission (verdict: Runtime Error):
import sys

a, b, x = map(int(), input().split())

if(x > a*a*b):
    sys.exit()

suito = a * a * b

wariai = 0

wariai = x / suito

kakudo = 0
kakudo =90 * wariai
print(90-kakudo)
Problem p04043 (python)

Fixed submission:
List = input().split()
if List.count("5")==2 and List.count("7")==1:
  	print("YES")
else:
	print("NO")

Buggy submission (verdict: Runtime Error):
List = map(int, input().split())
if List.count("5")==2 and List.count("7")==1:
  	print("YES")
else:
	print("NO")
Problem p02760 (python)

Fixed submission:
a = [list(map(int, input().split())) for l in range(3)]

N = int(input()) 
s = [int(input()) for i in range(N)] 

for nu in range(len(s)):
	for i in range(3):
		for j in range(3):
			if a[i][j] == s[nu]:
				a[i][j] = 0
for r in range(3):
	if a[r][0]==a[r][1]==a[r][2]==0:
		print('Yes')
		exit()
	if a[0][r]==a[1][r]==a[2][r]==0:
		print('Yes')
		exit()

if a[0][0]==a[1][1]==a[2][2]==0	or a[0][2]==a[1][1]==a[2][0]==0:	
		print('Yes')
		exit() 
print('No')

Buggy submission (verdict: Runtime Error):
N = int(input()) 
s = [int(input()) for i in range(N)] 

for nu in range(len(s)):
	for i in range(3):
		for j in range(3):
			if a[i][j] == s[nu]:
				a[i][j] = 0
#縦横斜めチェック
for r in range(3):
	if a[i][0]==a[i][1]==a[i][2]==0:
		print('Yes')
		exit()
	if a[0][i]==a[1][i]==a[2][i]==0:
		print('Yes')
		exit()

if a[0][0]==a[1][1]==a[2][2]==0	or a[0][2]==a[1][1]==a[2][0]==0:	
		print('Yes')
		exit() 
print('No')
Problem p03035 (python)

Fixed submission:
a,b = map(int,input().split())
 
if a >= 13:
    print(b)
elif a>= 6:
    print(int(b/2))
else:
    print(0)

Buggy submission (verdict: Runtime Error):
n,m = map(int,input().split())
l = []
r = []

for i in range(m):
    a,b = map(int,input().split())
    l.append(a)
    r.append(b)


if min(r) < max(l):
    print(min(r) - max(l) + 1)
else:
    print(0)