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

Fixed submission:
import sys
input = sys.stdin.readline
H,W,K =list(map(int,input().split()))
s = [input().rstrip() for _ in range(H)]
cut = [[0]*W for _ in range(H)]
cnt =0
for ih in range(H):
    if s[ih].count('#')==0:
        continue
    else:
        for iw in range(W):
            if s[ih][iw] == '#':
                cnt +=1
                cut[ih][iw]= cnt

for ih in range(H):
    for iw in range(W-1):
        if cut[ih][iw+1] ==0:
            cut[ih][iw+1]= cut[ih][iw]
    for iw in range(W-1,0,-1):
        if cut[ih][iw-1] ==0:
            cut[ih][iw-1]= cut[ih][iw]
        
for ih in range(H-1):
    if cut[ih+1][0]==0:
        for iw in range(W):
            cut[ih+1][iw] = cut[ih][iw]
for ih in range(H-1,0,-1):
    if cut[ih-1][0]==0:
        for iw in range(W):
            cut[ih-1][iw] = cut[ih][iw]
for i in range(H):
    print(*cut[i])

Buggy submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline
H,W,K =list(map(int,input().split()))
s = [input().rstrip() for _ in range(H)]
cut = []
cnt = 0
tmp_num=0
for ih in range(H):
    if s[ih].count('#')==0 and cut==[]:
        tmp_num +=1
        continue
    elif s[ih].count('#')==0 and cut!=[] and tmp_num == 0:
        cut.append(tmp)
        continue
    elif cut!=[] and tmp_num != 0:
        while tmp_num:
            cut.append(tmp)
            tmp_num -= 1
    tmp = []
    cnt +=1
    s[ih] = s[ih].replace('#','.',1)
    for iw in range(W):
        if s[ih][iw] == '#':
            cnt +=1
        tmp.append(cnt)
    cut.append(tmp)
for i in range(H):
    print(*cut[i])
Problem p02898 (python)

Fixed submission:
import bisect
N,K =list(map(int,input().split()))
H =sorted(list(map(int,input().split())))
i = bisect.bisect(H,K-1)
print(N-i)

Buggy submission (verdict: Runtime Error):
N,K = list(map(int,input().split()))
H  = list(map(int,input().split()))
counter = 0
for h in H:
  if h >= K:
    couter += 1
    
print(counter)
Problem p02903 (python)

Fixed submission:
H,W,A,B = list(map(int,input().split()))
M = [[0]*W for _ in range(H)]



for ih in range(H):
    for iw in range(W):
        if (ih<B and iw <A) or (ih>=B and iw >= A):
            M[ih][iw] = 1
for i in range(H):
    print(''.join(list(map(str,M[i]))))

Buggy submission (verdict: Runtime Error):
H,W,A,B = list(map(int,input().split()))
M = [[0]*W for _ in range(H)]



for ih in range(H):
    for iw in range(W):
        if (ih<B and iw <S) or (ih>=B and iw >= A):
            M[ih][iw] = 1
    for i in range(H):
        print(''.join(list(map(str,M[i]))))

Buggy submission (verdict: Runtime Error):
H,W,A,B = list(map(int,input().split()))
M = [[0]*W for _ in range(W)]

if H == 1 or W == 1:
    a = max(A,B)
    for i in range(H):
        for j in range(W):
            if a>0:
                M[i][j] = 1
                a-=1
    for i in range(H):
        print(''.join(list(map(str,M[i]))))
        
elif A == 0:
    a = B
    for i in range(H):
        for j in range(W):
            if a>0:
                M[i][j] = 1
        a -=1
    for i in range(H):
        print(''.join(list(map(str,M[i]))))

    
elif B == 0:
    a = A
    for i in range(W):
        for j in range(H):
            if a>0:
                M[i][j] = 1
        a -=1
    for i in range(H):
        print(''.join(list(map(str,M[i]))))

elif A == B and H == W:
    for i in range(H):
        for j in range(W):
            if (j+i)%W < A:
                M[i][j]=1

    for i in range(H):
        print(''.join(list(map(str,M[i]))))

else:
    print('No')

Buggy submission (verdict: Runtime Error):
H,W,A,B = list(map(int,input().split()))
M = [[0]*W for _ in range(W)]

if H == 1 or W == 1:
    a = max(A,B)
    for i in range(H):
        for j in range(W):
            if a>0:
                M[i][j] = 1
                a-=1
    for i in range(H):
        print(*M[i])
        
elif A == 0:
    a = B
    for i in range(H):
        for j in range(W):
            if a>0:
                M[i][j] = 1
        a -=1
    for i in range(H):
        print(*M[i])

    
elif B == 0:
    a = A
    for i in range(W):
        for j in range(H):
            if a>0:
                M[i][j] = 1
        a -=1
    for i in range(H):
        print(*M[i])

elif A == B and H == W:
    for i in range(H):
        for j in range(W):
            if (j+i)%W < A:
                M[i][j]=1

    for i in range(H):
        print(*M[i])

else:
    print('No')
Problem p02922 (python)

Fixed submission:
import math
A,B= list(map(int,input().split()))
#for i in range(1,22):
#    if (A-1)*(i-1)+A >=B:
#        print(i)
#        break
print(math.ceil((B-A)/(A-1))+1)

Buggy submission (verdict: Runtime Error):
min_tap = 0
if B <= A:
    min_tap = 1
else:
    min_tap =math.ceil((B-A)/(A-1))+1
print(int(min_tap))
Problem p02946 (python)

Fixed submission:
K,X = map(int,input().split())
x = " ".join(map(str,list(range(X-K+1,X+K))))
print(x)

Buggy submission (verdict: Runtime Error):
K,X = map(int,input().split())
print(*range(X-K-+1,X+K)))
Problem p02947 (python)

Fixed submission:
import math
def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

N = int(input())
dic_s = {}
for i in range(N):
    s = "".join(sorted(input()))
    if s in dic_s:
        dic_s[s] += 1
    else:
        dic_s[s] = 1
counter = 0
for key,value in dic_s.items():
    if value >1:
        counter += combinations_count(value,2)
print(counter)

Buggy submission (verdict: Runtime Error):
import math
def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

N = int(input())
dic_s = {}
for i in range(N):
    s = "".join(sorted(input()))
    if s in dic_s:
        dic_s[s] += 1
    else:
        dic_s[s] = 1
counter = 0
for key,value in dic_s.items():
    counter += combinations_count(value,2)
print(counter)
Problem p02969 (python)

Fixed submission:
print(3*int(input())**2)

Buggy submission (verdict: Runtime Error):
print(3*a**2)
Problem p02975 (python)

Fixed submission:
import sys,collections
input = sys.stdin.readline

N = int(input())
a =list(map(int,input().split()))

if sum(a) == 0:
    print('Yes')
    exit()

if N%3 != 0:
    print('No')
    exit()    

ac = collections.Counter(a)

if len(ac) == 2 and ac[0] ==N/3:
    print('Yes')
    exit()


if len(ac) != 3 :
    print('No')
    exit()
else:
    lk1,lk2,lk3 = ac.keys()
    lv1,lv2,lv3 = ac.values()
if lv1 == lv2 ==lv3:
    if lk1^lk2 == lk3:
        print('Yes')
    else:
        print('No')
else:
    print('No')
    exit()

Buggy submission (verdict: Runtime Error):
N,A,B,C,D =list(map(int,input().split()))
s = input()
flag = 0
if C<D:
    if (s[B-1:D].count('##') == 0) and (s[A-1:C].count('##') == 0):
        print('Yes')
    else:
        print('No')
else:
    if (s[B-1:C].count('...')>=1) and (s[A-1:C].count('##')==0):
        print('Yes')
    else:
        print('No')
Problem p02811 (python)

Fixed submission:
k,x=map(int,input().split())

if 500*k>=x:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
k,x=map(int,input().split())

if 500*k=>x:
  print("Yes")
else:
  print("No")
Problem p02909 (python)

Fixed submission:
s = str(input())

if s == "Sunny":
    print("Cloudy")
elif s == "Cloudy":
    print("Rainy")
else:
    print("Sunny")

Buggy submission (verdict: Runtime Error):
s = str(input())

if s == "Sunny":
    print(Cloudy)
elif s == "Cloudy":
    print(Rainy)
else:
    print(Sunny)
Problem p02923 (python)

Fixed submission:
import sys
n = int(input())
h = list(map(int,input().split()))
result = []
c = 0
if n == 1:
    print(0)
    sys.exit()
for i in range(n-1):
    if h[i] >= h[i+1]:
        c += 1
    else:
        result.append(c)
        c = 0
    if i == n-2:
        result.append(c)

print(max(result))

Buggy submission (verdict: Runtime Error):
n = int(input())
h = list(map(int,input().split()))
result = []
c = 0
for i in range(n-1):
    if h[i] >= h[i+1]:
        c += 1
    else:
        result.append(c)
        c = 0
    if i == n-2:
        result.append(c)

print(max(result))
Problem p02946 (python)

Fixed submission:
k,x = map(int,input().split())
p = [x-k+1+i for i in range(2*k-1)]
q = [str(j) for j in p]
r = " ".join(q)
print(r)

Buggy submission (verdict: Runtime Error):
k,x = map(int,input().split())
p = [x-k+1+i for i in range(2*k-1)]
print(q)
Problem p02971 (python)

Fixed submission:
import copy
n = int(input())
a = []
for _ in range(n):
    a.append(int(input()))
b = copy.copy(a)
a.sort(reverse=True)
for i in range(n):
    if b[i] == a[0]:
        print(a[1])
    else:
        print(a[0])

Buggy submission (verdict: Runtime Error):
import copy
n = int(input())
a = [int(input()) for _ in range(n)]
b = (copy.copy(a)).sort(reverse=True)
m = max(a)

for i in range(n):
    if a[i] != max(a):
        print(max(a))
    else:
        print(b[1])
Problem p02993 (python)

Fixed submission:
import sys
s = list(input())

for i in range(1,4):
    if s[i-1] == s[i]:
        print("Bad")
        sys.exit()

print("Good")

Buggy submission (verdict: Runtime Error):
import math
import sys
a,b,c,d = map(int,input().split())

if (c == 1) or (d == 1):
    print(0)
    sys.exit()

c_all  = b//c
d_all  = b//d
cd_all = int(b//(c*d/math.gcd(c,d)))
count_all = b + cd_all - c_all - d_all

c_a  = (a-1)//c
d_a  = (a-1)//d
cd_a = int((a-1)//(c*d/math.gcd(c,d)))
count_a = a - 1 + cd_a - c_a - d_a

print(count_all - count_a)
Problem p03086 (python)

Fixed submission:
s = list(input())
ans = 0
x = ["A","T","G","C"]
c = 0
for i in range(len(s)):
    if (s[i] in x) == True:
        c += 1
        if ans < c:
            ans = c
    else:
        c = 0
print(ans)

Buggy submission (verdict: Runtime Error):
s = list(input())
count = []
x = ["A","T","G","C"]
c = 0
for i in range(len(s)):
    if (s[i] in x) == True:
        c += 1
    else:
        count.append(c)
        c = 0

print(max(count))
Problem p03106 (python)

Fixed submission:
import sys
a,b,k = map(int,input().split())
c = 0
if a > b:    
    for i in range(b,0,-1):
        if (b%i == 0) and (a%i == 0):
            c += 1
            if c == k:
                print(i)
                sys.exit()
else:
    for i in range(a,0,-1):
        if (b%i == 0) and (a%i == 0):
            c += 1
            if c == k:
                print(i)
                sys.exit()

Buggy submission (verdict: Runtime Error):
a,b,k = map(int,input().split())
def cf(x1,x2):
    cf=[]
    for i in range(2,min(x1,x2)+1):
        if x1 % i == 0 and x2 % i == 0:
            cf.append(i)
    return cf

l = cf(a,b)

print(l[-k])
Problem p03238 (python)

Fixed submission:
n = int(input())

if n == 1:
    print("Hello World")
else:
    print(int(input())+int(input()))

Buggy submission (verdict: Runtime Error):
x = int(input())
a = input()
b = input()

if x == 1:
    print("Hello World")
else:
    print(int(a)+int(b))
Problem p03288 (python)

Fixed submission:
r = int(input())
if r <= 1199:
    print("ABC")
elif r <= 2799:
    print("ARC")
else:
    print("AGC")

Buggy submission (verdict: Runtime Error):
r = map(int,input().split())
if r <= 1999:
    print("ABC")
elif r <= 2799:
    print("ARC")
else:
    print("AGC")
Problem p03427 (python)

Fixed submission:
n = list(input())
l = len(n)

for i in range(l):
    n[i] = int(n[i])

score = 0

if l == 1:
    print(n[0])
else:
    if n.count(9) == l:
        score = sum(n)
    elif n.count(9) == l-1:
        if n[0] != 9:
            score += sum(n)
        else:
            score += 8 + 9*(l-1)
    else:
        if n[0] != 9:
            score += n[0]-1 + 9*(l-1)
        else:
            for j in range(l):
                if n[j] != 9:
                    n[j-1] = 8
                    score += 8 + 9*(l-1)
                    break
    print(score)

Buggy submission (verdict: Runtime Error):
n = list(input())
l = len(n)

for i in range(l):
    n[i] = int(n[i])

score = 0

if l == 1:
    print(n[0])
else:
    if n.count(9) == l-1:
        if n[0] != 9:
            score += sum(n)
        else:
            score += 8 + 9*(l-1)
    else:
        if n[0] != 9:
            score += n[0]-1 + 9*(l-1)
        else:
            for j in range(n):
                if n[j] != 9:
                    n[j-1] = 8
                    score += 8 + 9*(l-1)
                    break
    print(score)

Buggy submission (verdict: Runtime Error):
n = list(input())
l = len(n)

for i in range(l):
    n[i] = int(n[i])

score = 0

if l == 1:
    print(n[0])
else:
    if n.count(9) == l-1:
        if n[0] != 9:
            score += sum(n)
        else:
            score += 8 + 9*(l-1)
    else:
        if n[0] != 9:
            score += n[0]-1 + 9*(l-1)
        else:
            for j in range(n):
                if n[j] != 9:
                    n[j-1] = 8
                    score += 8 + 9*(n-1)
                    break
    print(score)
Problem p03957 (python)

Fixed submission:
s = list(input())

sc = -1
sf = -1

for i in range(len(s)):
    if s[i] == "C":
        sc = i
    elif s[i] == "F":
        sf = i

if (sc == -1) or (sf == -1):
    print("No")
elif sc < sf:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
s = list(input())

if s.index("C") < s.index("F"):
    print("Yes")
else:
    print("No")
Problem p03262 (python)

Fixed submission:
import fractions

N, X = map(int, input().split())
cities = list(map(int, input().split()))
cities.append(X)
cities.sort()
distances = list(map(lambda x: cities[x + 1] - cities[x], range(len(cities) - 1)))
ans = distances[0]
for distance in distances:
    ans = fractions.gcd(ans, distance)
print(ans)

Buggy submission (verdict: Runtime Error):
import math

N, X = map(int, input().split())
cities = list(map(int, input().split()))
cities.append(X)
cities.sort()
distances = list(map(lambda x: cities[x + 1] - cities[x], range(len(cities) - 1)))
ans = distances[0]
for distance in distances:
    ans = math.gcd(ans, distance)
print(ans)
Problem p03695 (python)

Fixed submission:
colors = [0 for i in range(9)]

N = int(input())
A = list(map(int, input().split()))

for a in A:
    color = a // 400 if a < 3600 else 8
    colors[color] += 1

min_color = 0
for i in range(8):
    if colors[i] > 0:
        min_color += 1

if min_color > 0:
    print("{} {}".format(min_color, min_color + colors[8]))
else:
    print("{} {}".format(1, colors[8]))

Buggy submission (verdict: Runtime Error):
colors = { 0: 0, 1: 0, 2: 0, 3: 0, 4: 0, 5: 0, 6: 0, 7: 0, 8: 0 }

N = int(input())
A = list(map(int, input().split()))

for a in A:
    colors[a // 400] += 1

min_clr = 0
for i in range(0, 8):
    if colors[i] > 0:
        min_clr += 1

print("{} {}".format(min_clr, min_clr + colors[8]))
Problem p04013 (python)

Fixed submission:
N, A = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(lambda n:n-A, x))

X = max(x)
dp = [[0 for i in range(2*X*N + 1)] for j in range(N + 1)]

for i in range(1, N + 1):
    dp[i][y[i - 1] + X*N] += 1
    for j in range(len(dp[0])):
        dp[i][j] += dp[i - 1][j]
        diff = j + y[i - 1]
        if 0 <= diff and diff <= 2*X*N:
            dp[i][diff] += dp[i - 1][j]

print(dp[N][X*N])

Buggy submission (verdict: Runtime Error):
N, A = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(lambda n:n-A, x))

X = max(x)
dp = [[0 for i in range(2*X*N + 1)] for j in range(N + 1)]

for i in range(1, N + 1):
    dp[i][y[i - 1] + N*X] += 1
    for j in range(len(dp[0])):
        dp[i][j] += dp[i - 1][j]
        if dp[i - 1][j] > 0:
            dp[i][j + y[i - 1]] += dp[i - 1][j]

print(dp[N][N*X])
Problem p02818 (python)

Fixed submission:
A,B,K=map(int,input().split())
if A>=K:
  print (A-K, B)
elif A+B>=K:
  print(0, B+A-K)
else:
  print(0, 0)

Buggy submission (verdict: Runtime Error):
A,B,K=map(int,input().split())
if A>=K:
  print (A-K, B)
elif A+B>=K:
  print(0, B+A-K)
else:
  print(O, O)

Buggy submission (verdict: Runtime Error):
A,B,K=map(int,input().split())
if A>=K:
  print (A-K,B)
elif A+B>=K:
  print(0,B+A-K)
else:
  print(O,O)
Problem p03563 (python)

Fixed submission:
R = int(input())
G = int(input())

print (2*G-R)

Buggy submission (verdict: Runtime Error):
R,G = map (int, input(). split())
print (2*G-R)

Buggy submission (verdict: Runtime Error):
R,G = map (int, input(). split())
print (2*G-R)
Problem p02887 (python)

Fixed submission:
n=int(input())
a=input()
s=list(a)
b=list(a)
j=0
for i in range(0,n-1):
    if s[i]==s[i+1]:
        b.pop(i-j)
        j=j+1
    else:
        pass
print(len(b))

Buggy submission (verdict: Runtime Error):
x=int(input())
s=list(input())
su=s
for i in range(len(s)-1):
    if s[i]==s[i+1]:
        su.pop(i)
    else:
        pass
print(len(su))
Problem p02888 (python)

Fixed submission:

def findnumberofTriangles(arr): 
	n = len(arr) 
	arr.sort() 
	count = 0
	for i in range(0, n-2):  
		k = i + 2 
		for j in range(i + 1, n):  
			while (k < n and arr[i] + arr[j] > arr[k]): 
				k += 1
			if(k>j): 
				count += k - j - 1

	return count 

n = int(input())
arr=[int(x) for x in input().split()]
print(findnumberofTriangles(arr))

Buggy submission (verdict: Runtime Error):

def findnumberofTriangles(arr): 
	n = len(arr) 
	arr.sort() 
	count = 0
	for i in range(0, n-2):  
		k = i + 2 
		for j in range(i + 1, n):  
			while (k < n and arr[i] + arr[j] > arr[k]): 
				k += 1
			if(k>j): 
				count += k - j - 1

	return count 

n = int(input())
arr=[int(x) for x in input().split()]
print(findnumberoftriangles(arr))
Problem p02705 (python)

Fixed submission:
x = int(input())
print(2*x*3.14)

Buggy submission (verdict: Runtime Error):
x = map(int, input())
print(2*x*3.14)

Buggy submission (verdict: Runtime Error):
x = map(int, input())
print(2*x*3.14)

Buggy submission (verdict: Runtime Error):
x = input()
print(2*x*3.14)

Buggy submission (verdict: Runtime Error):
x = map(int, input().split())
print(2*x*3.14)

Buggy submission (verdict: Runtime Error):
x = map(int, input().split())
print(2*π*x)
Problem p02818 (python)

Fixed submission:
A,B,K = map(int, input().split())
if A >= K:
  	print(A-K,B)
elif A+B >= K:
  	print(0,B-(K-A))
else:
	print(0,0)

Buggy submission (verdict: Runtime Error):
A,B,K = map(int, input().split())
if A >= K:
  print(A-K,B)
  else:
  print(0,B-(K-A))
Problem p03085 (python)

Fixed submission:
X = input()
if X == "A":
  	print("T")
elif X == "T":
  	print("A")
elif X == "C":
  	print("G")
elif X == "G":
	print("C")

Buggy submission (verdict: Runtime Error):
X = input()
if X == "A":
  	print("T")
elif X == "T":
  	print("A")
elif X == "C":
  	print("G")
else
	print("C")

Buggy submission (verdict: Runtime Error):
X = int(input())
if X == "A":
  	print("T")
elif X == "T":
  	print("A")
elif X == "C":
  	print("G")
elif X == "G":
	print("C")

Buggy submission (verdict: Runtime Error):
X = int(input())
if X == "A":
  	print("T")
elif X == "T":
  	print("A")
elif X == "C":
  	print("G")
else:
	print("C")

Buggy submission (verdict: Runtime Error):
X = int(input())
if X = "A":
  	print("T")
elif X = "T":
  	print("A")
elif X = "C":
  	print("G")
else:
	print("C")
Problem p03101 (python)

Fixed submission:
x,y = map(int, input().split())
a,b = map(int, input().split())
print((x-a)*(y-b))

Buggy submission (verdict: Runtime Error):
x = int(input())
print(2*x*3.14)

Buggy submission (verdict: Runtime Error):
x = map(int, input().split())
print(2*x*3.14)
Problem p03447 (python)

Fixed submission:
X = int(input())
A = int(input())
B = int(input())
print((X-A)%B)

Buggy submission (verdict: Runtime Error):
X,A,B = int(input()) for i in range(3)
print((X-A)%B)
Problem p03485 (python)

Fixed submission:
x,y = map(int, input().split())
z =x+y
import math
print(math.ceil(z/2))

Buggy submission (verdict: Runtime Error):
x,y = map(int, input().split())
import math
print(math.celi((x+y)/2))
Problem p03597 (python)

Fixed submission:
N = int(input())
A = int(input())
print(N*N-A)

Buggy submission (verdict: Runtime Error):
N,A = int(input()) for i in range(2)
print(N*N-A)

Buggy submission (verdict: Runtime Error):
N,A = map(int, input()) for i in range(2)
print(N*N-A)

Buggy submission (verdict: Runtime Error):
N,A = map(int, input().split())
print(N*N - A)
Problem p03605 (python)

Fixed submission:
N = input()
if "9" in N:
	print("Yes")
else:
	print("No")

Buggy submission (verdict: Runtime Error):
N = input()
if N in "9":
  print("Yes")
else print("No")

Buggy submission (verdict: Runtime Error):
N = input()
if N in 9:
  print("Yes")
else print("No")
Problem p03635 (python)

Fixed submission:
x,y = map(int, input().split())
print((x-1)*(y-1))

Buggy submission (verdict: Runtime Error):
x,y = input().split()
a = x-1
b = y-1
print(a*b)

Buggy submission (verdict: Runtime Error):
x,y = input().split()
print((x-1)*(y-1))

Buggy submission (verdict: Runtime Error):
x, y = int(input().split())
a = x-1
b = y-1
print(a*b)

Buggy submission (verdict: Runtime Error):
x,y = int(input().split())
print((x-1)*(y-1))

Buggy submission (verdict: Runtime Error):
x,y = int(input().split)
print((x-1)*(y-1))
Problem p03796 (python)

Fixed submission:
import math
x = int(input())
a = 10*10*10*10*10*10*10*10*10+7
print(math.factorial(x) % a)

Buggy submission (verdict: Runtime Error):
import math
x = int(input())
a = 10*10*10*10*10*10*10*10*10+7
print(math.fanctional(x) % a)

Buggy submission (verdict: Runtime Error):
import math
x = int(input())
a = 10*10*10*10*10*10*10*10*10+7
print(math.fanctional(x)%a)

Buggy submission (verdict: Runtime Error):
import math
x = int(input())
a = 10*10*10*10*10*10*10*10*10+7
print(math.functional(x)%a)

Buggy submission (verdict: Runtime Error):
import math
x = int(input())
y = 10*10*10*10*10*10*10*10*10 +7
print(math.functional(x)%y)
Problem p03852 (python)

Fixed submission:
N = input()
if N in "aiueo":
	print("vowel")
else:
	print("consonant")

Buggy submission (verdict: Runtime Error):
N = input()
if N in "aiueo"
	print("vowel")
else
	print("consonant")

Buggy submission (verdict: Runtime Error):
N = input()
if "a","e","i","o","u" in N
	print("vowel")
else
	print("consonant")

Buggy submission (verdict: Runtime Error):
N = input()
if a,e,i,o,u in N
	print("vowel")
else
	print("consonant")
Problem p02760 (python)

Fixed submission:
import numpy as np
A = [list(map(int, input().split())) for _ in range(3)]
N = int(input())
B = []
for j in range(N):
    b = int(input())
    B.append(b)
A = np.array(A)
B = np.array(B)
boolean_matrix = np.isin(A, B)
if boolean_matrix.sum(axis=1).max() >= 3 or \
   boolean_matrix.sum(axis=0).max() >= 3 or \
   np.diag(boolean_matrix).sum() >= 3 or \
   np.diag(np.fliplr(boolean_matrix)).sum() >= 3:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
A = [list(map(int, input().split())) for _ in range(3)]
N = int(input())
B = []
for j in range(N):
    b = int(input())
    B.append(b)
A = np.array(A)
B = np.array(B)
boolean_matrix = np.isin(A, B)
if boolean_matrix.sum(axis=1).max() >= 3 or \
boolean_matrix.sum(axis=0).max() >= 3 or \
np.diag(boolean_matrix).sum() >= 3 or \
np.diag(np.fliplr(boolean_matrix)).sum() >= 3:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
A = [list(map(int, input().split())) for _ in range(3)]
N = int(input())
B = []
for j in range(N):
    b = int(input())
    B.append(b)
A = np.array(A)
B = np.array(B)
boolean_matrix = np.isin(A, B)
if boolean_matrix.sum(axis=1).max() >= 3 or boolean_matrix.sum(axis=0).max() >= 3 or np.diag(boolean_matrix).sum() >= 3 or np.diag(np.fliplr(boolean_matrix)).sum() >= 3:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
A = [list(map(int, input().split())) for _ in range(3)]
N = int(input())
B = []
for j in range(N):
    b = int(input())
    B.append(b)
A = np.array(A)
B = np.array(B)
boolean_matrix = np.isin(A, B)
if boolean_matrix.sum(axis=1).max() >= 3 or \
   boolean_matrix.sum(axis=0).max() >= 3 or \
   np.diag(boolean_matrix).sum() >= 3 or \
   np.diag(np.fliplr(boolean_matrix)).sum() >= 3:
    print('Yes')
else:
    print('No')