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

Fixed submission:
N = int(input())
W = [input() for _ in range(N)]

from collections import Counter

dic = Counter(W)
flg = 0
for i in range(N):
    if dic[W[i]]!=1:
        flg=1
        

for j in range(N-1):
    if W[j][-1]!=W[j+1][0]:
        flg = 1

if flg!=1:
    print('Yes')
else:
    print('No')

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

from collections import Counter

dic = Counter(W)
flg = 0
for i in range(N):
    if dic[W[i]]!=1:
        flg=1
        

for j in range(N-1):
    if W[j][-1]!=W[j+1][1]:
        flg = 1

if flg!=1:
    print('Yes')
else:
    print('No')

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

from collections import Counter

dic = Counter(W)
flg = 0
for i in range(N):
    if dic[W[i]]!=1:
        flg=1
        break

for j in range(N-1):
    if W[j][-1]!=W[j+1][1]:
        flg = 1
        break

if flg!=1:
    print('Yes')
else:
    print('No')
Problem p03263 (python)

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

arr = []
for i in range(H-1):
    for j in range(W):
        if A[i][j]%2!=0:
            A[i+1][j]+=1
            arr.append([i+1, j+1, i+2, j+1])
            
for k in range(W-1):
    if A[H-1][k]%2!=0:
        A[H-1][k+1]+=1
        arr.append([H, k+1, H, k+2])
        
N = len(arr)

print(N)

for i in range(N): 
    print(arr[i][0], arr[i][1], arr[i][2], arr[i][3])

Buggy submission (verdict: Runtime Error):
import numpy as np

H, W = map(int, input().split())
A = [np.array(list(map(int, input().split()))).astype("int64") for _ in range(H)]

odds = []
for i in range(H):
    for j in range(W):
        if A[i][j]%2!=0:
            odds.append([i+1, j+1])

diff = []
for k in range(len(odds)//2):
    d_x = odds[2*k+1][0]-odds[2*k][0]
    d_y = odds[2*k+1][1]-odds[2*k][1]
    diff.append([d_x, d_y])

odds = np.array(odds)
diff = np.array(diff)

N = sum(sum(diff))

print(N)

for i in range(len(odds)//2):
    j = 0
    k = 0
    temp = odds[2*i]
    if diff[i][0]!=0:
        x_unit = (diff[i]-diff[i][1]*np.array([0, 1]))//diff[i][0]
        while j<diff[i][0]:
            print(temp[0], temp[1], (temp+x_unit)[0], temp[1])
            temp += x_unit
            j+=1
    if diff[i][1]!=0:
        y_unit = (diff[i]-diff[i][0]*np.array([1, 0]))//diff[i][1]
        while k<diff[i][1]:
            print(temp[0], temp[1], temp[0], (temp+y_unit)[1])
            temp += y_unit
            k+=1

Buggy submission (verdict: Runtime Error):
import numpy as np

H, W = map(int, input().split())
A = [np.array(list(map(int, input().split()))).astype("int64") for _ in range(H)]

odds = []
for i in range(H):
    for j in range(W):
        if A[i][j]%2!=0:
            odds.append([i+1, j+1])

diff = []
for k in range(n//2):
    d_x = odds[2*k+1][0]-odds[2*k][0]
    d_y = odds[2*k+1][1]-odds[2*k][1]
    diff.append([d_x, d_y])

odds = np.array(odds)
diff = np.array(diff)

N = sum(sum(diff))

print(N)

for i in range(len(odds)//2):
    j = 0
    k = 0
    temp = odds[2*i]
    if diff[i][0]!=0:
        x_unit = (diff[i]-diff[i][1])//diff[i][0]
        while j<diff[i][0]:
            print(temp[0], temp[1], (temp+x_unit)[0], temp[1])
            temp += x_unit
            j+=1
    if diff[i][1]!=0:
        y_unit = (diff[i]-diff[i][0])//diff[i][1]
        while k<diff[i][1]:
            print(temp[0], temp[1], temp[0], (temp+y_unit)[1])
            temp += y_unit
            k+=1
Problem p03282 (python)

Fixed submission:
S = input()
K = int(input())

if len(S)==1:
    print(S[0])
    
else:
    lst = []
    for i in range(len(S)):
        if S[i]!='1':
            lst.append(i)
        
    if lst==[]:
        print('1')
    else:
        if K<lst[0]+1:
            print('1')
        else:
            print(S[lst[0]])

Buggy submission (verdict: Runtime Error):
S = input()
K = int(input())

if len(S)==1:
    print(S[0])
    
else:
    lst = []
    for i in range(len(S)):
        if S[i]!='1':
            lst.append(i)
        
    if lst==[]:
        print('1')
    else    
        if K<lst[0]:
            print('1')
        else:
            print(S[lst[0]])

Buggy submission (verdict: Runtime Error):
S = input()
K = int(input())

if len(S)==1:
    print(S[0])
    
else:
    lst = []
    for i in range(len(S)):
        if S[i]!='1':
            lst.append(i)
        
    if K<lst[0]:
        print('1')
    else:
        print(S[lst[0]])
Problem p03293 (python)

Fixed submission:
S = input()
T = input()

length = len(S)
lst = []

for i in range(length):
    lst.append(S[i: length]+S[0: i])
    
if T in lst:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
S = input()
T = input()

lengt = len(S)
lst = []

for i in range(length):
    lst.append(S[i: length]+S[0: i])
    
if T in lst:
    print('Yes')
else:
    print('No')
Problem p03361 (python)

Fixed submission:
H, W = map(int, input().split())
S = ['.'+input()+'. ' for _ in range(H)]

S.insert(0, '.'*(W+2))
S.insert(H+1, '.'*(W+2))

flg = 0
for i in range(1, H+1):
    for j in range(1, W+1):
        if S[i][j]=='#':
            if S[i+1][j]=='.' and S[i-1][j]=='.' and S[i][j+1]=='.' and S[i][j-1]=='.':
                flg = 1
                break
    else:
        continue
    break
    
if flg==0:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
H, W = map(int, input().split())
S = ['.'+input()+'. ' for _ in range(H)]

S.insert(0, '.'*(W+2))
S.insert(H+1, '.'*(W+2))

flg = 0
for i in range(1, W+1):
    for j in range(1, H+1):
        if S[i][j]=='#':
            if S[i+1][j]=='.' and S[i-1][j]=='.' and S[i][j+1]=='.' and S[i][j-1]=='.':
                flg = 1
                break
    else:
        continue
    break
    
if flg==0:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
H, W = map(int, input().split())
S = ['.'+input()+'. ' for _ in range(H)]

S.insert(0, '.'*(W+2))
S.insert(H+1, '.'*(W+2))

flg = 0
for i in range(1, W+1):
    for j in range(1, H+1):
        if S[i][j]=='#':
            if S[i+1][j]=='.' and S[i-1][j]=='.' and S[i][j+1]=='.' and S[i][j-1]=='.':
                flg = 1

if flg==0:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
H, W = map(int, input().split())
S = ['.'+input()+'. ' for _ in range(H)]

S.insert(0, '.'*(W+2))
S.insert(H+1, '.'*(W+2))

flg = 0
for i in range(1, W):
    for j in range(1, H):
        if S[i][j]=='#':
            if S[i+1][j]=='.' and S[i-1][j]=='.' and S[i][j+1]=='.' and S[i][j-1]=='.':
                flg = 1
                break

if flg==0:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
H, W = map(int, input().split())
S = ['.'+input()+'. ' for _ in range(H)]

S.insert(0, '.'*(W+2))
S.insert(H+1, '.'*(W+2))

flg = 0
for i in range(1, W+1):
    for j in range(1, H+1):
        if S[i][j]=='#':
            if S[i+1][j]=='.' and S[i-1][j]=='.' and S[i][j+1]=='.' and S[i][j-1]=='.':
                flg = 1
                break

if flg==0:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
H, W = map(int, input().split())
S = ['.'+input()+'. ' for _ in range(H)]

S.insert(0, '.'*(W+2))
S.insert(H+1, '.'*(W+2))

for i in range(1, W+1):
    for j in range(1, H+1):
        if S[i][j]=='#':
            if S[i+1][j]=='.' and S[i-1][j]=='.' and S[i][j+1]=='.' and S[i][j-1]=='.':
                print('No')
                break
            
print('Yes')
Problem p03362 (python)

Fixed submission:
N = int(input())
 
from itertools import combinations
 
def get_sieve_of_eratosthenes(n):
    prime = [2]
    limit = int(n**0.5)
    data = [i + 1 for i in range(2, n, 2)]
    while True:
        p = data[0]
        if limit <= p:
            return prime + data
        prime.append(p)
        data = [e for e in data if e % p != 0]

primes = get_sieve_of_eratosthenes(55555)

lst = []
for p in primes:
    if p%5==1:
        lst.append(p)

for i in range(N):
    print(lst[i], end=' ')

Buggy submission (verdict: Runtime Error):
N = int(input())

from itertools import combinations

def get_sieve_of_eratosthenes(n):
    prime = [2]
    limit = int(n**0.5)
    data = [i + 1 for i in range(2, n, 2)]
    while True:
        p = data[0]
        if limit <= p:
            return prime + data
        prime.append(p)
        data = [e for e in data if e % p != 0]
    
def is_prime(n):
    import math
    for i in range(2, int(math.sqrt(n))+1):  
        if n % i == 0:
            return False

    return True

lst = get_sieve_of_eratosthenes(55555)

base = [11, 3, 7, 5, 31]
i = 5
cnt = 5
while cnt<N:
    flg = 0
    tmp = lst[i]
    comb = list(combinations(base, 4))
    for j in range(len(comb)):
        if is_prime(sum(comb[j])+tmp):
            flg = 1
            
    if flg==0:
        base.append(tmp)   
        cnt+=1
    i+=1
    
for k in range(N):
    print(base[k], end=' ')
Problem p02921 (python)

Fixed submission:
S = input()
T = input()

c = 0
for i in range(3):
  if S[i] == T[i]:
    c += 1
  else:
    next
    
print(c)

Buggy submission (verdict: Runtime Error):
S = input()
T = input()

c = 0
for i range(3):
  if S[i] == T[i]:
    c += 1
  else:
    next
    
print(c)
Problem p02922 (python)

Fixed submission:
list1 = [int(i) for i in input().split()];

A = list1[0];   #A個口の電源タップ
B = list1[1];   #未使用の差込口を B口以上に拡張したい
#print(list1)
#print(list1[1])
addSupply = 1;
lack   = (B-A); #足りない個数
if lack >0:
    addSupply = 1;
    addSupply += lack / (A-1); #残りの個数 
 
    if lack % (A-1) >0:
        addSupply +=1;
elif B==1 :
    addSupply = 0;

print(int(addSupply));

Buggy submission (verdict: Runtime Error):
A = list1[0];   #A個口の電源タップ
B = list1[1];   #未使用の差込口を B口以上に拡張したい
#print(list1)
#print(list1[1])
addSupply = 1;
lack   = (B-A); #足りない個数
if lack >0 & B !=1 :
    addSupply = 1;
    addSupply += lack / (A-1); #残りの個数 

    if lack % (A-1) >0:
        addSupply +=1;
else :
    addSupply = 0;
print(int(addSupply));
Problem p03795 (python)

Fixed submission:
N=int(input())
x=N*800
y=N//15*200
S=x-y
print(S)

Buggy submission (verdict: Runtime Error):
N=int(input())
x=N*800
y=N//15*200
S=x-y
print(S)v
Problem p03962 (python)

Fixed submission:
a,b,c=map(int,input().split())
if a==b and b==c and a==c: #全部一緒のとき
    print("1")
elif a!=b and b!=c and a!=c: #全部違うとき
    print("3")
elif a==b and b!=c:
    print("2")
elif a==c and c!=b:
    print("2")
elif c==b and a!=c:
    print("2")

Buggy submission (verdict: Runtime Error):
a=int(input())
b=int(input())
c=int(input())
if a==b and b==c and a==c: #全部一緒のとき
    print("1")
elif a!=b and b!=c and a!=c: #全部違うとき
    print("3")
elif a==b and b!=c:
    print("2")
elif a==c and c!=b:
    print("2")
elif c==b and a!=c:
    print("2")
Problem p03633 (python)

Fixed submission:
import fractions
N = int(input())

Numbers = list(int(input()) for _ in range(N))
ans = Numbers[0]
for i in range(1, N):
    ans = ans * Numbers[i] // fractions.gcd(ans, Numbers[i])
print(ans)

Buggy submission (verdict: Runtime Error):
import fractions
N = int(input())

Numbers = list(int(input()) for _ in range(N):
ans = T[0]
for i in range(1, N):
    ans = ans * T[i] // fractions.gcd(ans, T[i])
print(ans)
Problem p03575 (python)

Fixed submission:
import sys
sys.setrecursionlimit(10**6)  

N, M = map(int, input().split())
G = {k:[] for k in range(N)}
for _ in range(M):
  a, b = map(int, input().split())
  G[a-1].append(b-1)
  G[b-1].append(a-1)


def rel_side(v, G):  # 任意の頂点から、他のすべての頂点を訪問したかどうかを確認する関数
  if all(vis):
    return 1
  r = 0
  for side in G[v]:
    if not vis[side]:
      vis[side] = True
      r += rel_side(side, G)
  return r


bridge = 0
for i in range(N):
  for j, k in enumerate(G[i]):
    vis = [False] * N
    vis[i] = True
    pop1 = G[i].pop(j)
    idx = G[pop1].index(i)
    pop2 = G[pop1].pop(idx)
    if not rel_side(i, G):
      bridge += 1
    # print(vis, rel_side(i, G))
    G[i].insert(j, pop1)
    G[pop1].insert(idx, pop2)
    

print(bridge // 2)

Buggy submission (verdict: Runtime Error):
import sys
sys.setrecursionlimit(10**6)  

N, M = map(int, input().split())
G = {k:[] for k in range(N)}
for _ in range(M):
  a, b = map(int, input().split())
  G[a-1].append(b-1)
  G[b-1].append(a-1)


def rel_side(v, G):  # 任意の頂点から、他のすべての頂点を訪問したかどうかを確認する関数
  if all(vis):
    return 1
  r = 0
  for side in G[v]:
    if not vis[side]:
      vis[side] = True)
      r += rel_side(side, G)
  return r


bridge = 0
for i in range(N):
  for j, k in enumerate(G[i]):
    vis = [False] * N
    vis[i] = True
    pop1 = G[i].pop(j)
    idx = G[pop1].index(i)
    pop2 = G[pop1].pop(idx)
    if not rel_side(i, G):
      bridge += 1
    # print(vis, rel_side(i, G))
    G[i].insert(j, pop1)
    G[pop1].insert(idx, pop2)
    

print(bridge // 2)
Problem p02861 (python)

Fixed submission:
import sys
import math


def len(lhs, rhs):
    return math.sqrt((lhs[0] - rhs[0]) ** 2 + (lhs[1] - rhs[1]) ** 2)


def solve(n: int, cities):
    sum = 0
    for i1, city1 in enumerate(cities):
        for i2, city2 in enumerate(cities):
            if i1 != i2:
                sum += len(city1, city2)
    return sum / n


def main():
    inputs = list(sys.stdin)
    n = int(inputs.pop(0))
    cities = [[int(n) for n in s.split(" ")] for s in inputs]
    print(solve(n, cities))


main()

Buggy submission (verdict: Runtime Error):
import sys
import math
from typing import List, Tuple


def len(lhs: Tuple[int, int], rhs: Tuple[int, int]):
    return math.sqrt((lhs[0] - rhs[0]) ** 2 + (lhs[1] - rhs[1]) ** 2)


def solve(n: int, cities: List[Tuple[int, int]]):
    sum = 0
    for i1, city1 in enumerate(cities):
        for i2, city2 in enumerate(cities):
            if i1 != i2:
                sum += len(city1, city2)
    return sum / n


def main():
    inputs = list(sys.stdin)
    n = int(inputs.pop(0))
    cities = [[int(n) for n in s.split(" ")] for s in inputs]
    print(solve(n, cities))


main()
Problem p02958 (python)

Fixed submission:
n = int(input())
P = list(map(int, input().split()))
sorted = sorted(P)
count = 0

for i in range(n):
  if P[i] == sorted[i]:
    count += 1

if count == n or count == n-2:
  print("YES")
else:
  print("NO")

Buggy submission (verdict: Runtime Error):
n = int(input())
P = [int(input()) for a in range(n)]
sorted = sorted(P)
count = 0

for i in range(n):
  if P[i] == sorted[i]:
    count += 1

if count == n or count == n-2:
  print("YES")
else:
  print("NO")

Buggy submission (verdict: Runtime Error):
n = int(input())
P = [int(input()) for _ in range(n)]
sorted = sorted(P)
count = 0

for i in range(n):
  if P[i] == sorted[i]:
    count += 1

if count == n or count == n-2:
  print("YES")
else:
  print("NO")
Problem p02969 (python)

Fixed submission:
a = int(input())
s = a**2 * 3
print(s)

Buggy submission (verdict: Runtime Error):
n = int(input())
A = [int(input()) for i in range(n)]
  
for i in range(n):
  Ai = A[:]
  Ai.pop(i)
  print(max(Ai))

Buggy submission (verdict: Runtime Error):
n, d = map(int, input().split())
a = n // (2*d + 1) + 1
print(a)

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

pritn(a**3 * 2)
Problem p02971 (python)

Fixed submission:
n = int(input())
A = [int(input()) for _ in range(n)]

sort = sorted(A)

max = sort[-1]
maxx = sort[-2]

for i in range(n):
  if max == A[i]:
    print(maxx)
  else:
    print(max)

Buggy submission (verdict: Runtime Error):
n = int(input())
A = [int(input()) for i in range(n)]
for i in range(n):
  Ai = A
  Ai.pop(i)
  print(max(Ai))

Buggy submission (verdict: Runtime Error):
n = int(input())
A = [int(a) for input() in range(n)]
for i in range(n):
  Ai = A
  Ai.pop(i)
  print(max(Ai))

Buggy submission (verdict: Runtime Error):
n = int(input())
A = []
for i in range(n):
  A.append(int(input()))
  
for i in range(n):
  Ai = A
  Ai.pop(i)
  print(max(Ai))

Buggy submission (verdict: Runtime Error):
n = int(input())
A = []
for a in range(n):
  A.append(int(input()))
  
for a in range(n):
  Ai = A.pop(a)
  print(max(Ai))
Problem p02981 (python)

Fixed submission:
n, a, b = map(int, input().split())
if a*n < b:
  print(a*n)
else:
  print(b)

Buggy submission (verdict: Runtime Error):
n, a, b = int(input().split())
if a*n > b:
  print(a*n)
else:
  print(b)

Buggy submission (verdict: Runtime Error):
n, a, b = int(input())
if a*n > b:
  print(a*n)
else:
  print(b)
Problem p03469 (python)

Fixed submission:
s = input()
print(s.replace("2017", "2018"))

Buggy submission (verdict: Runtime Error):
s = input()
s[:4] = "2018"
print(s)
Problem p02922 (python)

Fixed submission:
A,B = map(int, input().split())
 
cnt = 1
num = A
 
if num < B:
  while num < B:
    num = num + (A - 1)
    cnt += 1
elif B == 1:
  cnt = 0
  
print(cnt)

Buggy submission (verdict: Runtime Error):
A,B = input().split()

cnt = 1
num = A

if num < B:
  while num < B:
    num = num + (A -1)
    cnt += 1
elif B == 1:
  cnt = 0
  
print(cnt)
Problem p02945 (python)

Fixed submission:
a,b = map(int,input().split())

plus = a + b 

mai = a - b

kake = a * b 

print(max(plus,mai,kake))

Buggy submission (verdict: Runtime Error):
a,b = input().split()
plus = a + b
mai  = a - b
kake = a * b

print(max(plus,mai,kake))
Problem p02969 (python)

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

Buggy submission (verdict: Runtime Error):
r = int(input())
print(3 * r**)

Buggy submission (verdict: Runtime Error):
r = input()
print(3 * r**3)

Buggy submission (verdict: Runtime Error):
r = input()
print(3 * r^3)
Problem p03136 (python)

Fixed submission:
N = input()
L = list(map(int,input().split()))
Ma1 = max(L)
 
Su1 = sum(L)
 
hikaku = Su1 - Ma1
 
if hikaku > Ma1:
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
N = input()
L = list(map(int,input().split()))
Ma1 = max(L)

Su1 = sum(L)

hikaku = Su1 - Ma1

if hikaku > ma1:
  print('Yes')
else:
  print('No')
Problem p03493 (python)

Fixed submission:
sum = input()
cnt = 0
  
if sum[0] == '1' :
  cnt += 1
 
if sum[1] == '1':
  cnt += 1
 
if sum[2] == '1':
  cnt += 1

print(cnt)

Buggy submission (verdict: Runtime Error):
sum = input()
cnt = 0
  
if sum[1] == '1' :
  cnt =+ 1
 
if sum[2] == '1':
  cnt =+ 1
 
if sum[3] == '1':
  cnt =+ 1

print(cnt)

Buggy submission (verdict: Runtime Error):
sum = input()

if sum[0] == 1:
  cnt += 1:
endif

if sum[1] == 1:
  cnt += 1:
endif

if sum[2] == 1:
  cnt += 1:
endif

print(cnt)
Problem p02909 (python)

Fixed submission:
s = input()
if s == "Sunny":
    print("Cloudy")
elif s == "Cloudy":
    print("Rainy")
elif s == "Rainy":
    print("Sunny")

Buggy submission (verdict: Runtime Error):
s = input()
if s == 'Sunny':
    print('Cloudy')
elif s == 'Cloudy':
    print('Rainy')
eise:
    print('Sunny')

Buggy submission (verdict: Runtime Error):
s=input()
if s == 'Sunny':
    print('Cloudy')
elif s == 'Cloudy':
    print('Rainy')
eise:
    print('Sunny')

Buggy submission (verdict: Runtime Error):
S=input()
if s=Sunny:
    print('Cloudy')
if s=Cloudy:
    print('Rainy')
eise:
    print('Sunny')

Buggy submission (verdict: Runtime Error):
s = input()
if s == "Sunny":
　print("Cloudy")
elif s == "Cloudy":
　print("Rainy")
elif s == "Rainy":
　print("Sunny")

Buggy submission (verdict: Runtime Error):
s = input()
if s == "Sunny"
print("Cloudy")
elif s == "Cloudy"
print("Rainy")
elif s == "Rainy"
print("Sunny")

Buggy submission (verdict: Runtime Error):
s=input
if s == "Sunny"
print("Cloudy")
if s == "Cloudy"
print("Rainy")
if s == "Rainy"
print("Sunny")

Buggy submission (verdict: Runtime Error):
s=inout
if s == "Sunny"
print("Cloudy")
if s == "Cloudy"
print("Rainy")
if s == "Rainy"
print("Sunny")
Problem p02921 (python)

Fixed submission:
S = input()
T = input()

count = 0
#iを３回数えてもらう
for i in range(3):
#数えてｓとｔが同じならカウント１とする
    if S[i]==T[i]:
        count += 1
print(count)

Buggy submission (verdict: Runtime Error):
S = input()
T = input()

count = 0
#iを３回数えてもらう
for i in range(3):
#数えてｓとｔが同じならカウント１とする
    if S[i]==T[i]:
    count += 1
print(count)

Buggy submission (verdict: Runtime Error):
S = imput()
T = imput()

count = 0
#iを３回数えてもらう
for i in range(3):
#数えてｓとｔが同じならカウント１とする
    if S[i]==T[i] 
    count += 1
print(count)

Buggy submission (verdict: Runtime Error):
S = input()
T = input()

count = 0
#iを３回数えてもらう
for i in range(3):
#数えてｓとｔが同じならカウント１とする
    if S[i]==T[i] 
    count += 1
print(count)

Buggy submission (verdict: Runtime Error):
S = input()
T = input()

count = 0
#iを３回数えてもらう
for i in range(3):
#数えてｓとｔが同じならカウント１とする
    if S[i]==T[i] 
    print(I)
count(I)

Buggy submission (verdict: Runtime Error):
S = input()
T = input()

count = 0
#iを３回数えてもらう
for i in range(3):
#数えてｓとｔが同じならカウント１とする
    if S[i] == T[i] 
    print(I)
count(I)

Buggy submission (verdict: Runtime Error):
S = print()
T = print()
count = 0
#iを３回数えてもらう
for i in range(3):
#数えてｓとｔが同じならカウント１とする
    if S[i] == T[i] 
    print(I)
count(I)

Buggy submission (verdict: Runtime Error):
S = print()
T = print()
count == 0
#iを３回数えてもらう
for i in range(3)
#数えてｓとｔが同じならカウント１とする
if S[i] == T[i] 
    print(I)
count(I,num)

Buggy submission (verdict: Runtime Error):
S = print()
#SがS,C,Rとなるようにする
print(s | c | r)
T = print()
#TがS,C,Rとなるようにする
print((s | c | r))
S == T
Problem p02945 (python)

Fixed submission:
A,B = map(int,input().split())
print(max(A+B,A-B,A*B))

Buggy submission (verdict: Runtime Error):
A=int(input())
B=int(input())

a = A + B
b = A - B
C = A * B
number = [a,b,c]
print(max(number))
Problem p02993 (python)

Fixed submission:
s=input()

if s[0] == s[1]:
    print('Bad')
    exit()
if s[1] == s[2]:
    print('Bad')   
    exit()
if s[2] == s[3]:
    print('Bad')
    exit()
else:
    print('Good')

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

if s[0] == s[1] and s[1] == s[2] and s[2] == s[3]
    print('Bad')    
else:
    print('Good')

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

if s[0] == s[1] and s[1] == s[2] and s[2] == s[3]
    print('Bad')    
else:
    print('Good')

Buggy submission (verdict: Runtime Error):
#s[0]ってするとsの1つ目を示すらしい・・・だから
s=input()

if s[0] == s[1]:
    print('Bad')
if s[1] == s[2]:
    print('Bad')    
if s[2] == s[3]:
    print('Bad')
else:
    print(Good')

Buggy submission (verdict: Runtime Error):
#s[0]ってするとsの1つ目を示すらしい・・・だから
ｓ=input()

if s[0] == s[1]:
    print('Bad')
if s[1] == s[2]:
    print('Bad')    
if s[2] == s[3]:
    print('Bad')
else:
    print(Good')

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

S=[a,b,c,d]
if num=(a=b,b=c,c=d):
    print('Bad')
else:
    print('Good')
Problem p02999 (python)

Fixed submission:
X,A=map(int, input().split())

if X<A:
    print(0)
else:
    print(10)

Buggy submission (verdict: Runtime Error):
A=int(input())
X=int(input())

if X<A:
    print(0)
else:
    print(10)

Buggy submission (verdict: Runtime Error):
A=int(input())
X=int(input())

if X < A:
    print('0')
else:
    print('10')
Problem p03029 (python)

Fixed submission:
A,P= map(int, input().split())
print((3*A+P)//2)

Buggy submission (verdict: Runtime Error):
A=int(input())
P=int(input())
print((3*A+P)//2)

Buggy submission (verdict: Runtime Error):
#printがpaiはおかしいのかな・・・
A,B= map(int, input().split())
print((3*A+P)//2)

Buggy submission (verdict: Runtime Error):
#まさかまたこの分けわからん式入れたらいいんか・・・？
A,B= map(int, input().split())

pai=int((3*A+P)//2)
print(pai)

Buggy submission (verdict: Runtime Error):
A=int(inport())
P=int(inport())

pai=int((3 * A + P) // 2)
print(pai)

Buggy submission (verdict: Runtime Error):
A=int(inport())
P=int(inport())

pai=int((3*A+P)/2)
print(pai)

Buggy submission (verdict: Runtime Error):
A=int(inport())
P=int(inport())

pai=(3*A+P)/2
print(pai)

Buggy submission (verdict: Runtime Error):
#欠片は３Aに加えPもあるから３A+Pだ
import math
A=int(inport())
P=int(inport())

pai=(3*A+P)/2
print(math.floor(pai))

Buggy submission (verdict: Runtime Error):
import math
A=int(inport())
P=int(inport())

#3A/2=pai
P=3*A
pai=P/2
print(math.floor(pai))