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

Fixed submission:
N, M = map(int,input().split())

L,R= map(int,input().split())

for i in range(M-1):
    x,y= map(int,input().split())
    L = max(L,x)
    R = min(R,y)

print(R-L+1 if L<=R else 0)

Buggy submission (verdict: Runtime Error):
N, M = map(int,input().split())

L,R= map(int,input().split())

for i in range(M):
    x,y= map(int,input().split())
    L = max(L,x)
    R = min(R,y)

print(R-L+1)
Problem p03086 (python)

Fixed submission:
S = list(input())

c = 0
ans = 0

for i in S:
    if i=='A' or i=='C' or i=='G' or i=='T':
        c += 1
        if ans < c:
            ans = c
    else:
        c = 0

print(ans)

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

c = 0
ans = 0

for i in S:
    if i=='A' or i=='C' or i=='G' or i=='T':
        c += 1
        if ans < c:
        ans = c
    else:
        c = 0

print(ans)
Problem p03261 (python)

Fixed submission:
N = int(input())
W =[ input()]
a = 'Yes'

for i in range(1,N):
    k = input()
    W.append(k)
    if W[-2][-1]!=k[0] or len(set(W))!=(i+1):
        a = 'No'
        break

print(a)

Buggy submission (verdict: Runtime Error):
N = int(input())
W = list(input())
a = 'Yes'

s = W[0]

for i in range(N-1):
    k = input()
    if s[-1]==k[0] and k not in W:
        W.append(k)
        s = W[-1]
    else:
        a = 'No'
        for j in range(N-i):
            k = input()
        break


print(a)
Problem p03067 (python)

Fixed submission:
l = [int(i) for i in input().split(' ')]
if ((l[0] < l[2]) and (l[2] < l[1])) or ((l[1] < l[2]) and (l[2] < l[0])):
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
l = [int(i) for i in input().split(' ')]
if (l[0] < l[2]) && ((l[1] > l[2]):
    print('Yes')
else:
    print('No')
Problem p03845 (python)

Fixed submission:
N = int(raw_input())
line = map(int,raw_input().split(' '))
M = int(raw_input())
for i in range(M):
    x = map(int,raw_input().split(' '))
    s = sum(line)-(line[x[0]-1]-x[1])
    print s

Buggy submission (verdict: Runtime Error):
N = int(raw_input())
line = map(int,raw_input().split(' '))
M = int(raw_input())
for i in range(M):
    x = map(int,raw_input().split(' ')
    print sum(line)-(line[x[0]]-x[1])

Buggy submission (verdict: Runtime Error):
N = int(raw_input())
line = raw_input().split(' ')
M = int(raw_input())
for i in range(M):
    x = map(int,raw_input().split(' ')
    print sum(line)-(line[x[0]]-x[1])
Problem p03852 (python)

Fixed submission:
a = raw_input()
if a == 'a' or a=='i' or a=='u' or a=='e' or a=='o':
    print 'vowel'
else:
    print 'consonant'

Buggy submission (verdict: Runtime Error):
a = raw_input()
a.split(' ')
for i in range(a[0]):
    a = raw_input()
    print a
    print a

Buggy submission (verdict: Runtime Error):
while 1:
    a = raw_input()
    if a == '':
        break
    if a == 'a' or a=='i' or a=='u' or a=='e' or a=='o':
        print 'vowel'
    else:
        print 'consonant'
Problem p02681 (python)

Fixed submission:
import sys
from random import choice,randint
inp=sys.stdin.readline
out=sys.stdout.write
flsh=sys.stdout.flush
 
sys.setrecursionlimit(10**9)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
 
def MI(): return map(int, inp().strip().split())
def LI(): return list(map(int, inp().strip().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines().strip()]
def LI_(): return [int(x)-1 for x in inp().strip().split()]
def LF(): return [float(x) for x in inp().strip().split()]
def LS(): return inp().strip().split()
def I(): return int(inp().strip())
def F(): return float(inp().strip())
def S(): return inp().strip()
def pf(s): return out(s+'\n')
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)

def main():
    s = S()
    t = S()
    if s == t[:len(t)-1]:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()

Buggy submission (verdict: Runtime Error):
import sys
from random import choice,randint
inp=sys.stdin.readline
out=sys.stdout.write
flsh=sys.stdout.flush
 
sys.setrecursionlimit(10**9)
inf = 10**20
eps = 1.0 / 10**10
mod = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
 
def MI(): return map(int, inp().strip().split())
def LI(): return list(map(int, inp().strip().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines().strip()]
def LI_(): return [int(x)-1 for x in inp().strip().split()]
def LF(): return [float(x) for x in inp().strip().split()]
def LS(): return inp().strip().split()
def I(): return int(inp().strip())
def F(): return float(inp().strip())
def S(): return inp().strip()
def pf(s): return out(s+'\n')
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)

def main():
    f = [0]*2000000
    inv = [0]*2000000
    def fast_exponentiation(base, exp):
        res = 1
        while exp:
            if exp & 1:
                res = (res * base) % mod
            base = (base * base) % mod
            exp >>=1
        return res % mod 
    
    def ncr(n,r):
        if n<r or n<0 or r<0:
            return 0
        cur = f[n]
        p = inv[r]
        p = (p*(inv[n-r]))%mod
        return (cur*p)%mod

    n,m,k=MI()
    f[0]=1
    inv[0]=1
    for i in range(1,200007):
        f[i]=(f[i-1]*i)%mod
        inv[i]= fast_exponentiation(f[i],-1)
    ans =0
    for i in range(1,k+2):
        p1 = fast_exponentiation(m,i)
        q1 = fast_exponentiation(m-1,n-i)
        cur = (p1*q1)%mod
        ans+=cur%mod
        ans%=mod
    print(ans)
    

if __name__ == "__main__":
    main()
Problem p02678 (python)

Fixed submission:
from collections import defaultdict
n,m = map(int,input().split())
graph = defaultdict(list)
for i in range(m):
    a,b = map(int,input().split())
    graph[a].append(b)
    graph[b].append(a)

ans = defaultdict(int)
next_list = []
for j in graph[1]:
    ans[j] = 1
    next_list.append(j)

target_list = next_list[:]
while True:
    next_list = []
    if len(target_list) == 0:
        break

    for i in target_list:
        for j in graph[i]:
            if j not in ans:
                ans[j] = i
                next_list.append(j)
    target_list = next_list[:]


print('Yes')
for i in range(2,n+1):
    print(ans[i])

Buggy submission (verdict: Runtime Error):
from collections import defaultdict
n,m = map(int,input().split())
graph = defaultdict(list)
for i in range(m):
    a,b = map(int,input().split())
    graph[a].append(b)
    graph[b].append(a)

ans = [None]*(n-1)
check = [i for i in range(2,n+1)]
tmp = []
for j in graph[1]:
    ans[j-2] = 1
    check.remove(j)
    tmp.append(j)

count = 0
while check != [] and count < n:
    new_tmp = []
    for i in tmp:
        for j in graph[i]:
            if ans[j-2] == None and j in check:
                ans[j-2] = i
                check.remove(j)
                new_tmp.append(j)
    tmp = new_tmp
    count += 1
if None in ans:
    print('No')
else:
    print('Yes')
    for i in ans:
        print(i)

Buggy submission (verdict: Runtime Error):
from collections import defaultdict
n,m = map(int,input().split())
graph = defaultdict(list)
for i in range(m):
    a,b = map(int,input().split())
    graph[a].append(b)
    graph[b].append(a)

ans = [None]*(n-1)
check = [i for i in range(2,n+1)]
tmp = []
for j in graph[1]:
    ans[j-2] = 1
    check.remove(j)
    tmp.append(j)

while check != []:
    new_tmp = []
    for i in tmp:
        for j in graph[i]:
            if ans[j-2] == None and j != 1:
                ans[j-2] = i
                check.remove(j)
                new_tmp.append(j)
    tmp = new_tmp
if None in ans:
    print('No')
else:
    print('Yes')
    for i in ans:
        print(i)

Buggy submission (verdict: Runtime Error):
from collections import defaultdict
n,m = map(int,input().split())
graph = defaultdict(list)
for i in range(m):
    a,b = map(int,input().split())
    graph[a].append(b)
    graph[b].append(a)

ans = [None]*(n-1)
check = [i for i in range(2,n+1)]
tmp = []
for j in graph[1]:
    ans[j-2] = 1
    check.remove(j)
    tmp.append(j)

while check != []:
    new_tmp = []
    for i in tmp:
        for j in graph[i]:
            if ans[j-2] == None and j != 1:
                ans[j-2] = i
                check.remove(j)
                new_tmp.append(j)
    tmp = new_tmp
print(ans)
Problem p02971 (python)

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

b = sorted(a)
m = b[-1]
m1 = b[-2]

for i in a:
    if m != i:
        print(m)
    else:
        print(m1)

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

m = max(a)
b = a[:]
for idx,i in enumerate(a):
    if m != i:
        print(m)
    else:
        del b[idx]
        print(max(b))
Problem p02993 (python)

Fixed submission:
s = ''
for i in input():
    if s == i:
        print("Bad")
        exit()
    s = i
print("Good")

Buggy submission (verdict: Runtime Error):
from fractions import gcd
a,b,c,d = map(int,input().split())
l = (c*d) // fractions.gcd(c,d)
 
x = b//c - (a-1)//c
y = b//d - (a-1)//d
z = b//l - (a-1)//l
s = int(x+y-z)
 
print(b-a+1-s)

Buggy submission (verdict: Runtime Error):
from fractions import gcd
a,b,c,d = map(int,input().split())
l = (c*d) // gcd(c,d)
 
x = b//c - (a-1)//c
y = b//d - (a-1)//d
z = b//l - (a-1)//l
s = int(x+y-z)
 
print(b-a+1-s)

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

x = b//c - (a-1)//c
y = b//d - (a-1)//d
z = b//l - (a-1)//l

s = (x+y-z)
print(b-a+1-s)

Buggy submission (verdict: Runtime Error):
from fractions import gcd
a,b,c,d = map(int,input().split())
l = (c*d) // gcd(c,d)

x = b//c - (a-1)//c
y = b//d - (a-1)//d
z = b//l - (a-1)//l

s = (x+y-z)
print(b-a+1-s)
Problem p03105 (python)

Fixed submission:
A,B,C = input().split(' ')
d = int(int(B)/int(A))
if d > int(C):
    print(int(C))
else:
    print(d)

Buggy submission (verdict: Runtime Error):
A,B,C = input().split(' ')
d = int(A/B)
if d > C:
    print(C)
else:
    print(d)
Problem p02821 (python)

Fixed submission:
import os
import sys

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353


N, M = list(map(int, sys.stdin.buffer.readline().split()))
A = list(map(int, sys.stdin.buffer.readline().split()))

A.sort()
A = np.array(A, dtype=int)
cs = A[::-1].cumsum()[::-1]


def test(k):
    # 幸福度が k 以上になる握手を採用する
    counts = N - np.searchsorted(A, k - A)
    return counts.sum() >= M


def count(k):
    counts = N - np.searchsorted(A, k - A)
    cnt = counts.sum()

    pos = np.searchsorted(A, k - A)
    ret = ((A * counts)[pos < N] + cs[pos[pos < N]]).sum()
    ret -= abs(M - cnt) * k
    return ret


ok = 0
ng = max(A) * 2 + 1
while abs(ok - ng) > 1:
    mid = (ok + ng) // 2
    if test(mid):
        ok = mid
    else:
        ng = mid

ans = count(ok)
print(ans)

Buggy submission (verdict: Runtime Error):
n,m = input().split()
n = int(n)
m = int(m)

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

import itertools
l = A
p = itertools.permutations(A,2)

permlist = []
for perm in p:
    permlist.append(perm)

permsumlist = []

for perm in permlist:
    permsumlist.append(sum(perm))

new_list_reverse = sorted(permsumlist, reverse=True)

answer = max(A) + max(A)

for i in range(m-1):
    answer += new_list_reverse[i]

print(answer)
Problem p02778 (python)

Fixed submission:
s = input()
c = ''
for i in range(len(s)):
  c += 'x'
  

print(c)

Buggy submission (verdict: Runtime Error):
color = input().split()
num = input().split()
choice = input()

for i in range(2):
  if choice == color[i]:
    num[i] = int(num[i]) - 1 
    
print(num)
Problem p02945 (python)

Fixed submission:
num = input().split()
n1 = int(num[0])
n2 = int(num[1])
plus = n1 + n2
minus = n1 - n2
mul = n1 * n2
max = max(max(plus,minus), mul)
print(max)

Buggy submission (verdict: Runtime Error):
str = input().split()
plus = str[0] + str[1]
minus = str[0] - str[1]
mul = str[0] * str[1]
if(plus > minus):
  if(plus > mul):
    max = plus
  else:
    max = mul
if(minus > plus):
  if(minus > mul):
    max = minus
  else:
    max = mul
if(plus > minus):
  if(plus > mul):
    max = plus
  else:
    max = mul
Problem p02946 (python)

Fixed submission:
src = input().split()
k = int(src[0])
x = int(src[1])
a = ''
min = x-k+1
max = x+k-1
pos = list(range(min,max+1))
for i in pos:
  a = a + str(i) + ' '
print(a)

Buggy submission (verdict: Runtime Error):
src = input().split()
k = int(src[0])
x = int(src[1])
min = x-k+1
max = x+k-1
print(list(range(min,max+1)
Problem p03001 (python)

Fixed submission:
W,H,x,y = map(int, input().split())
if 2*x==W and 2*y==H:
    ans = 1
else:
    ans = 0
print(W*H/2, ans)

Buggy submission (verdict: Runtime Error):
#include <stdio.h>
int main(){
    long int W, H, x, y, ans;
    scanf("%ld %ld %ld %ld",&W,&H,&x,&y);
    if(2*x==W && 2*y==H){
        ans = 1;
    }
    else{
        ans = 0;
    }
    printf("%lf %ld\n", W*H/2.0, ans);

    return 0;
}
Problem p03101 (python)

Fixed submission:
HW = list(map(int, input().split()))
hw = list(map(int, input().split()))
a = (HW[0]-hw[0])*(HW[1]-hw[1])
print(a)

Buggy submission (verdict: Runtime Error):
HW = input().split()
hw = input().split
print((HW[0]-hw[0])*(HW[1]-hw[1]))
Problem p03102 (python)

Fixed submission:
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A = [list(map(int, input().split())) for i in range(N)]
count = 0
for i in range(N):
    s = C
    for j in range(M):
        s += A[i][j] * B[j]
    if s > 0:
        count += 1
print(count)

Buggy submission (verdict: Runtime Error):
N, M, C = map(int input().split())
B = list(map(int input().split()))
A = [list(map(int input().split())) for i in range(N)]
M = list(range(N))
x = 0
for i in M:
    M[i] = A[i] * B[I] + C
    if M[i] > 0:
        x +=
print(x)
Problem p03210 (python)

Fixed submission:
X = int(input())
if X==7 or X==5 or X==3:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
x = int(input())
if X==7 or X==5 or X==3:
    print("YES")
else:
    print("NO")
Problem p02690 (python)

Fixed submission:
x = int(input())
a = 2
b = 0
A = []
A.append(1 ** 5 - x)

while True:
    if (a + 1) ** 5 - a ** 5 > 10 ** 10:
        break
    A.append(a ** 5 - x)
    a = a + 1

while True:
    if b ** 5 in A:
        break
    elif -b ** 5 in A:
        b = -b
        break
    b = b + 1

a = int((x + b ** 5) ** 0.2)

print(a, b)

Buggy submission (verdict: Runtime Error):
x = int(input())
a = 1
b = 0
A = []

while True:
    if A[-1] > 10 ** 9:
        break
    A.append(a ** 5 - x)
    a = a + 1

while True:
    if b ** 5 in A:
        break
    elif -b ** 5 in A:
        b = -b
        break
    b = b + 1

a = int((x + b ** 5) ** 0.2)

print(a, b)
Problem p02741 (python)

Fixed submission:
k = int(input())

A = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]

print(A[k - 1])

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

A = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]

print(A[k + 1])
Problem p02742 (python)

Fixed submission:
h, w = map(int, input().split())

if h == 1 or w == 1:
  print(1)
else:
  a = h * w
  if a % 2 == 0:
    print(int(a / 2))
  else:
    print(int((a + 1) / 2))

Buggy submission (verdict: Runtime Error):
h, w = map(int, input().split())

a = h * w
if a % 2 == 0:
  print(int(a / 2))
else:
  print(int;((a + 1) / 2))

Buggy submission (verdict: Runtime Error):
h, w = map(long, input().split())

a = h * w
if a % 2 == 0:
  print(long(a / 2))
else:
  print(long((a - 1) / 2))
Problem p02761 (python)

Fixed submission:
N, M = map(int,(input().split()))
table = [input().split() for l in range(M)]
ans = 0
array1 = []
array2 = []
array3 = []
keta1 = -1
keta2 = -1
keta3 = -1
s1 = 0
s2 = 0
s3 = 0
for k in range(M):
    for j in range(2):
        table[k][j] = int(table[k][j])

for k in range(M):
    if table[k][0] == 1:
        if (N != 1 and table[k][1] == 0) or (not(table[k][1] in array1) and s1 == 1):
            keta1 = -1
        else:
            keta1 = table[k][1]
        s1 = 1
        array1.append(table[k][1])

    elif table[k][0] == 2:
        if not(table[k][1] in array2) and s2 == 1:
            keta2 = -1
        else:
            keta2 = table[k][1]
        s2 = 1
        array2.append(table[k][1])
    else:
        if not(table[k][1] in array3) and s3 == 1:
            keta3 = -1
        else:
            keta3 = table[k][1]
        s3 = 1
        array3.append(table[k][1])

if s1 != 1:
    keta1 = 1
if s2 != 1 or M == 0:
    keta2 = 0
if s3 != 1 or M == 0:
    keta3 = 0
if N == 1 and M == 0:
    keta1 = 0

if keta1 == -1 or keta2 == -1 or keta3 == -1:
    ans = -1
elif N == 3:
    ans = keta1 * 100 + keta2 * 10 + keta3
elif N == 2:
    ans = keta1 * 10 + keta2
else:
    ans = keta1
    
print(ans)

Buggy submission (verdict: Runtime Error):
n, m = map(int, input().split())
T = [list(map(int, input().split())) for i in range(m)]

for i in range(10 ** (n - 1), 10 ** n):
    for j in range(m):
        ans = 0
        if (str(i))[(T[j][0] - 1)] != str(T[j][1]):
            ans = -1
            break
    if ans == 0:
        ans = i
        break

print(ans)

Buggy submission (verdict: Runtime Error):
n, m = map(int, input().split())
T = [list(map(int, input().split())) for i in range(m)]

#for i in range(10 ** (n - 1), 10 ** n):
for i in range(700, 710):
    for j in range(m):
        ans = 0
        if (str(i))[(T[j][0] - 1)] != str(T[j][1]):
            ans = -1
            break
    if ans == 0:
        ans = i
        break

print(ans)
Problem p03944 (python)

Fixed submission:
w, h, n = map(int, input().split())
T = [list(map(int, input().split())) for i in range(n)]

xr = w
xl = 0
yu = h
yl = 0

for i in range(n):
    if T[i][2] == 2:
        xr = min(xr, T[i][0])
    elif T[i][2] == 1:
        xl = max(xl, T[i][0])
    elif T[i][2] == 4:
        yu = min(yu, T[i][1])
    else:
        yl = max(yl, T[i][1])

if (xr - xl) <= 0 or (yu - yl) <= 0:
    print(0)
else:
    print((xr - xl) * (yu - yl))

Buggy submission (verdict: Runtime Error):
w, h, n = map(int, input().split())
T = [list(map(int, input().split())) for i in range(n)]

xr = w
xl = 0
yu = h
yl = 0

for i in range(n):
    if T[i][2] == 2:
        xr = min(xr, T[i][0])
    elif T[i][2] == 1:
        xl = max(xl, T[i][0])
    elif T[i][2] == 4:
        yu = min(yu, T[i][1])
    else:
        yl = max(yl, T[i][1])

print(max((xr - xl) * (yu - yl), 0)
Problem p02801 (python)

Fixed submission:
print(chr(ord(input())+1))

Buggy submission (verdict: Runtime Error):
print(input() + 1)
Problem p02811 (python)

Fixed submission:
K, X = map(int, input().split())
print("Yes" if K * 500 >= X else "No")

Buggy submission (verdict: Runtime Error):
K = int(input())
X = int(input())
if 500 * K >= X:
  print(Yes)
else:
  print(Yes)
Problem p02817 (python)

Fixed submission:
S, T = input().split()
print(T + S)

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

print(S, end='')
print(T)

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

print(T, end='')
print(S)
Problem p03146 (python)

Fixed submission:
s = int(input())
a = []

while(s not in a):
    a.append(s)
    if s % 2 == 0:
        s //= 2
    else:
        s = 3 * s + 1

print(len(a) + 1)

Buggy submission (verdict: Runtime Error):
#include <bits/stdc++.h>

#define mod 1000000007

#define rep(i, n) for(int i=1; i<=n; ++i)

using namespace std;
typedef long long ll; 
 
int main(void){
	
	int a[100000];
	
	cin >> a[0];
	
	rep(i, 100000){
		if(a[i-1] % 2 == 0)
			a[i] = a[i-1] / 2;
		else
			a[i] = 3 * a[i-1] + 1;
		rep(j, i){
			if(a[j] == a[i]){
				cout << i;
				return 0;
			}
		}
	}
}
Problem p03210 (python)

Fixed submission:
X = int(input())
if X == 3 or X == 5 or X == 7:
  print("YES")
else:
  print("NO")

Buggy submission (verdict: Runtime Error):
X = int(input())
if X == 3 or X == 5 or X == 7:
  print("YES)
else:
  print("NO")
Problem p03238 (python)

Fixed submission:
N = int(input())

if N == 1:
  print("Hello World")
else:
  A = int(input())
  B = int(input())
  print(A + B)

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

if N == 1:
  print("Hello World")
else:
  A, B = map(int, input().split())
  print(A + B)
Problem p03260 (python)

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

if A == 2 or B == 2:
  print("No")
else:
  print("Yes")

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

if A == 2 || B == 2:
  print("No")
else:
  print("Yes")
Problem p03385 (python)

Fixed submission:
s = input()

s = set(s)

if len(s) == 3:
  print("Yes")
else:
  print("No")

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

s = set(s)

if s.len() == 3:
  print("Yes")
else:
  print("No")

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

s = s.sort()

if s == "abc":
  print("Yes")
else:
  print("No")
Problem p03399 (python)

Fixed submission:
A, B, C, D = [int(input()) for i in range(4)]

print(min(A, B) + min(C, D))

Buggy submission (verdict: Runtime Error):
A, B, C, D = map(int, input().split())

print(min(A, B) + min(C, D))
Problem p03547 (python)

Fixed submission:
X, Y = input().split()

if X > Y:
  print(">")
elif X < Y:
  print("<")
else:
  print("=")

Buggy submission (verdict: Runtime Error):
X, Y = map(input().split())

if X > Y:
  print(">")
elif X < Y:
  print("<")
else:
  print("=")
Problem p03555 (python)

Fixed submission:
c1 = input()
c2 = input()

if c1[0] == c2[2] and c1[1] == c2[1] and c1[2] == c2[0]:
  print("YES")
else:
  print("NO")

Buggy submission (verdict: Runtime Error):
c1 = input()
c2 = input()
c2.reverse()

if c1 == c2:
  print("YES")
else:
  print("NO")
Problem p03671 (python)

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

ans = min(a + b, b + c)
ans = min(ans, c + a)
print(ans)

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

ans = min(a + b, b + c)
ans = min(ans, c + a)
print(ans)
Problem p03719 (python)

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

if C >= A and C <= B:
  print("Yes")
else:
  print("No")

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

if C >= A and C <= b:
  print("Yes")
else:
  print("No")
Problem p03737 (python)

Fixed submission:
s1, s2, s3 = input().split()
print((s1[0]+s2[0]+s3[0]).upper())

Buggy submission (verdict: Runtime Error):
s1 = input()
s2 = input()
s3 = input()

s1.upper()
s2.upper()
s3.upper()

print(s1[0] + s2[0] + s3[0])

Buggy submission (verdict: Runtime Error):
s1 = input()
s2 = input()
s3 = input()

print(s1.upper()[0] + s2.upper()[0] + s3.upper()[0])
Problem p03760 (python)

Fixed submission:
O = input()
E = input()

for i in range(len(E)):
  print(O[i], end='')
  print(E[i], end='')
  
if not(len(E) == len(O)):
  print(O[len(O) - 1])

Buggy submission (verdict: Runtime Error):
O = input()
E = input()

for i in range(E.length()):
  print(O[i], end='')
  print(E[i], end='')
  
if not(E.length() == O.length()):
  print(O[O.length() - 1])
Problem p03844 (python)

Fixed submission:
a = input().split()
if a[1] == '+':
    print(int(a[0])+int(a[2]))
else:
    print(int(a[0])-int(a[-1]))

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

if op == '+':
  print(A + B)
else:
  print(A - B)

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

if op == '+':
  print(A + B)
else:
  print(A - B)
Problem p03997 (python)

Fixed submission:
a = int(input())
b = int(input())
h = int(input())
print((a + b) * h // 2)

Buggy submission (verdict: Runtime Error):
a, b, h = map(int, input().split())

print((a + b) * h / 2)

Buggy submission (verdict: Runtime Error):
a, b, h = map(int, imput().split())

print((a + b) * h / 2)