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

Fixed submission:
n=input()

if n=="AAA" or n=="BBB":
  print("No")
else:
  print("Yes")

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

if n="AAA" or n="BBB":
  print("No")
else:
  print("Yes")
Problem p02771 (python)

Fixed submission:
x = list(map(int,input().split()))
if len(set(x))== 2:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
    x = list(map(int,input().split()))
    if len(set(x))== 2:
        print("Yes")
    else:
        print("No")
Problem p02659 (python)

Fixed submission:
import math
from decimal import *

sa, sb = input().split()
a = Decimal(sa)
b = Decimal(sb)
lb = Decimal(b * Decimal(100))

ans = Decimal(Decimal(a * lb) // Decimal(100))
print(int(ans))

Buggy submission (verdict: Runtime Error):
import math

a,b = map(int, input().split())
print(math.fsum([b] * a))

Buggy submission (verdict: Runtime Error):
import math
from decimal import *

sa, sb = input().split()
a = Decimal(sa)
b = float(sb)
lb = Decimal(b * 100)

ans = Decimalc(Decimal(a * lb) // Decimal(100))
print(int(ans))
Problem p02622 (python)

Fixed submission:
s = input()
t = input()

count = 0
for i in range(len(s)):
  if s[i] != t[i]:
    count += 1
print(count)

Buggy submission (verdict: Runtime Error):
s,t = input()
if s == t:
  print(0)
count = 0
for i in range(len(s)):
  if s[i] != t[i]:
    count += 1
print(count)
Problem p02753 (python)

Fixed submission:
s=input()
if s=="AAA" or s=="BBB":
  print("No")
else:
  print("Yes")

Buggy submission (verdict: Runtime Error):
s=input()
if AAA or BBB:
  print("No")
else:
  print("Yes")
Problem p02570 (python)

Fixed submission:
d, t, s  = map(int, input().split())
if d <= t * s :
    print("Yes")
else :
    print("No")

Buggy submission (verdict: Runtime Error):
d, t, s  = map(int, input().split())
if d =< t * s :
    print("Yes")
else :
    print("No")
Problem p02754 (python)

Fixed submission:
n, a, b = map(int, input().split())
red = 0 ; blue = 0
if n >= a + b :
    stack = n // (a+b)
    red += b * stack
    blue += a * stack
    n -= (a+b) * stack
if n > a :
    n -= a
    blue += a
else :
    blue += n
if n > b :
    n -= b
    red += b
else :
    red += n
print(blue)

Buggy submission (verdict: Runtime Error):
n, a, b = map(int, input().split())
list = [0] * n
idx = 0
while True :
    if a < list.count(0) :
        for i in range(idx,idx+a) :
            list[i] = "b"
        idx += a
    elif a == list.count(0) :
        for i in range(idx,idx+a) :
            list[i] = "b"
        break
    else :
        for i in range(idx,idx+list.count(0)) :
            list[i] = "b"
        break

    if b < list.count(0) :
        for i in range(idx,idx+b) :
            list[i] = "a"
        idx += b
    elif b == list.count(0) :
        for i in range(idx,idx+b) :
            list[i] = "a"
        break
    else :
        for i in range(idx,idx+list.count(0)) :
            list[i] = "a"
        break
print(list.count("b"))

Buggy submission (verdict: Runtime Error):
n, a, b = map(int, input().split())
list = [0] * n
idx = 0
while True :
    if a < list.count(0) :
        for i in range(idx,idx+a) :
            list[i] = "b"
        idx += a
    elif a == list.count(0) :
        for i in range(idx,idx+a) :
            list[i] = "b"
        break
    else :
        for i in range(idx,idx+list.count(0)) :
            list[i] = "b"
        break

    if b < list.count(0) :
        for i in range(idx,idx+b) :
            list[i] = "a"
        idx += b
    elif b == list.count(0) :
        for i in range(idx,idx+b) :
            list[i] = "a"
        break
    else :
        for i in range(idx,idx+list.count(0)) :
            list[i] = "a"
        break
print(list.count("b"))
Problem p02773 (python)

Fixed submission:
n = int(input())
d = {}
for _ in range(n) :
    s = input()
    if s in d :
        d[s] += 1
    else :
        d[s] = 1

mx = max(d.values())
for s in sorted(k for k in d if d[k] == mx) :
    print(s)

Buggy submission (verdict: Runtime Error):
n = int(input())
d = {}
for _ in range(n) :
    s = input()
    if s in d :
        d[s] += 1
    else :
        d[s] = 1

mx = max(d.values())
for s in sorted(k for k in d if d[k] == m) :
    print(s)
Problem p03265 (python)

Fixed submission:
x1, y1, x2, y2 = map(int, input().split())
dx = x2 - x1
dy = y2 - y1
nx = x2
ny = y2
l = []
for i in range(2) :
    dx, dy = -dy, dx
    nx += dx
    ny += dy
    l.append(nx)
    l.append(ny)
print(l[0], l[1], l[2], l[3])

Buggy submission (verdict: Runtime Error):
x1, y1, x2, y2 = map(int, input().split())
nx = x2
ny = y2
l = []
for i in range(2) :
    dx, dy = -dy, dx
    nx += dx
    ny += dy
    l.append(nx)
    l.append(ny)
print(l[0], l[1], l[2], l[3])
Problem p03617 (python)

Fixed submission:
q, h, s, d = map(int, input().split())
n = int(input())
ans = 0
q_per = q / 0.25
h_per = h / 0.5
s_per = s
d_per = d / 2
list = [q_per,h_per,s_per,d_per]
if min(list) == d_per :
    if n%2 == 0:
        ans += d * (n //2)
    else :
        ans += n//2 * d
        n -= n//2
        list.remove(d_per)
        if min(list) == s_per :
            ans += s_per
        elif min(list) == h_per :
            ans += h * 2
        else :
            ans += q * 4
elif min(list) == s_per :
    ans += n * s
elif min(list) == h_per :
    ans += n * 2 * h
else :
    ans += n * 4 * q

print(int(ans))

Buggy submission (verdict: Runtime Error):
q, h, s, d = map(int, input().split())
n = int(input())
ans = 0
q_per = q / 0.25
h_per = h / 0.5
s_per = s
d_per = d / 2
list = [q_per,h_per,s_per,d_per]
elif min(list) == d_per :
    if n%2 == 0:
        ans += d * (n //2)
    else :
        ans += n//2 * d
        n -= n//2
        list.remove(d_per)
        if min(list) == s_per :
            ans += s_per
        elif min(list) == h_per :
            ans += h * 2
        else :
            ans += q * 4
elif min(list) == s_per :
    ans += n * s
elif min(list) == h_per :
    ans += n * 2 * h
else :
    ans += n * 4 * q

print(int(ans))
Problem p03723 (python)

Fixed submission:
a, b, c = map(int, input().split())
a_tmp = a ; b_tmp = b ; c_tmp = c
count = 0
while True :
    if a == b == c and a%2 == 0 :
        print("-1")
        break
    elif a%2 == 1 or b%2 == 1 or c%2 == 1 :
        print(count)
        break
    else :
        a = b_tmp/2 + c_tmp/2
        b = a_tmp/2 + c_tmp/2
        c = a_tmp/2 + b_tmp/2
        a_tmp = a ; b_tmp = b ; c_tmp = c
        count += 1

Buggy submission (verdict: Runtime Error):
a, b, c = map(int, input().split())
a_tmp = a ; b_tmp = b ; c_tmp = c
count = 0
while True :
    count += 1
    a = b_tmp/2 + c_tmp/2
    b = a_tmp/2 + c_tmp/2
    c = a_tmp/2 + b_tmp/2
    if a == a_tmp and b == b_tmp and c = c_tmp :
        print("-1")
        break
    a_tmp = a ; b_tmp = b ; c_tmp = c
    if a%2 == 1 or b%2 == 1 or c%2 == 1 :
        print(count)
        break
    else :
        continue

Buggy submission (verdict: Runtime Error):
a, b, c = map(int, input().split())
a_tmp = a ; b_tmp = b ; c_tmp = c
count = 0
while True :
    count += 1
    a = b_tmp/2 + c_tmp/2
    b = a_tmp/2 + c_tmp/2
    c = a_tmp/2 + b_tmp/2
    if a == a_tmp and b == b_tmp and c = c_tmp :
        print("-1")
        break
    a_tmp = a ; b_tmp = b ; c_tmp = c
    if a%2 == 1 or b%2 == 1 or c%2 == 1 :
        print(count)
        break
    else :
        continue
Problem p03137 (python)

Fixed submission:
n, m = [int(x) for x in input().split()]
x = [int(x) for x in input().split()]

x.sort()

dist = [0] * (m-1)
for i in range(m-1):
    dist[i] = x[i+1] - x[i]
dist.sort(reverse=True)

if m <= n:
    print(0)
else:
    length = x[m-1]-x[0]
    for i in range(n-1):
        length -= dist[i]
    print(length)

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

x.sort()
dist = [0] * (m-1)
for i in range(m-1):
    dist[i] = x[i+1] - x[i]
dist.sort(reverse=True)

length = x[m-1]-x[0]
for i in range(n-1):
    length -= dist[i]

print(length)

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

x.sort()
print(x)

dist = [0] * (m-1)
for i in range(m-1):
    dist[i] = x[i+1] - x[i]
dist.sort(reverse=True)

length = x[m-1]-x[0]
for i in range(n-1):
    length -= dist[i]

print(length)
Problem p02622 (python)

Fixed submission:
s=input()
s1=input()
c=0;
for i in range(len(s1)):
  if(s1[i]!=s[i]):
    c+=1;
print(c)

Buggy submission (verdict: Runtime Error):
s=input()
s1=input()
c=0;
for i in range(len(s1)):
  if(s1[i]!=s[i]):
    c++;
print(c)
Problem p02570 (python)

Fixed submission:
# -*- coding: utf-8 -*-
D, T, S= map(int,input().split(' '))
print('Yes' if D / S <= T else 'No')

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
N= int(input())
A= list(map(int,input().split(' ')))
 
ans = 0
for i in range(len(A)-1):
  for j in range(i+1, len(A)):
    ans += A[i]*A[j]
 
print(ans)
Problem p02595 (python)

Fixed submission:
import math
N,D= map(int, input().split(" "))
count = 0
for i in range(0,N):
    X,Y= map(int, input().split(" "))
    d= math.sqrt(pow(X,2)+pow(Y,2))
    if d<= D:
        count = count+1
print(count)

Buggy submission (verdict: Runtime Error):
import math
n, d = map(int, input().split())
lst1 = []
lst2 = []
ans = 0
for i in range(n):
  x, y = map(int, input().split())
  # lst2 =[x, y]
  # list1.append(lst2)
  cal = math.sqrt(x^2+y^2)
  lst1.append(cal)
  
for i in range(n):
  if lst1[i] >= d:
    ans += 1
  else:
    continue
print(ans)

Buggy submission (verdict: Runtime Error):
import math
n, d = map(int, input().split())
lst1 = []
lst2 = []
ans = 0
for i in range(n):
  x, y = map(int, input().split())
  # lst2 =[x, y]
  # list1.append(lst2)
  cal = math.sqrt(x^2+y^2)
  lst1.append(cal)
  
for i in range(n):
  if lst1[i] >= d:
    ans += 1
  else:
    continue:
print(ans)
Problem p02570 (python)

Fixed submission:
d,t,s = list(map(int,input().split()))
try:
  times = d/s
except:
  times = t+1
if times<=t:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
d,t,s = list(map(int,input().split()))
times = distance/speed
if times<=t:
  print("Yes")
else:
  print("No")
Problem p02831 (python)

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

def gcd(a,b):
    while b!=0:
        a,b=b,a%b
    return a

lcm=a*b/gcd(a, b)
print(int(lcm))

Buggy submission (verdict: Runtime Error):
import math
a,b=map(int,input().split())
lcm=a*b/math.gcd(a, b)
print(int(lcm))
Problem p02879 (python)

Fixed submission:
a,b=map(int,input().split())
if a<10 and b<10:
  print(a*b)
else:
  print(-1)

Buggy submission (verdict: Runtime Error):
a,b=int(input().split())
if a<10 && b<10:
  print(a*b)
else:
  print(-1)
Problem p02570 (python)

Fixed submission:
D,T,S=input().split()
D=int(D)
T=int(T)
S=int(S)
a=float(T-D/S)
if a>=0:
    print("Yes")
else :
    print("No")

Buggy submission (verdict: Runtime Error):
D=int(input())
T=int(input())
S=int(input())
a=float(T-D/S)
if a>0:
    print("Yes")
else :
    print("No")

Buggy submission (verdict: Runtime Error):
D=int(input())
T=int(input())
S=int(input())
a=float(T-D/S)
if a>=0:
    print("Yes")
else :
    print("No")

Buggy submission (verdict: Runtime Error):
D=input()
T=input()
S=input()
if T-D/S>=0:
    print("Yes")
    else print("No")
Problem p02785 (python)

Fixed submission:
n,k=map(int,input().split())
hps=list(map(int,input().split()))
hps.sort()
if k>n:
  print(0)
elif k==n:
  print(0)
else:
  ans=0
  for i in range(k):
    hps.pop()
  ans+=sum(hps)
  print(ans)

Buggy submission (verdict: Runtime Error):
n,k=map(int,input().split())
hps=list(map(int,input().split()))
hps.sort()
if k>n:
  print(n)
elif k==n:
  print(k)
else:
  ans=k
  for i in range(k):
    hps.pop()
  ans+==sum(hps)
  print(ans)
Problem p02879 (python)

Fixed submission:
a,b=map(int,input().split())
if a<10 and b<10:
  print(a*b)
else:
  print(-1)

Buggy submission (verdict: Runtime Error):
a, b = map(int,input().split()) #複数の入力はmap関数

#判別＆出力
if A <= 9 and B <= 10:
  print(A * B)
else:
  print(-1)

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

a=list(map(int,input().split()))
f=list(map(int,input().split()))
a=sorted(a)
f=sorted(f,reverse=True)

l=-1
r=10**12
def ok():
    s=0
    for i in range(n):
        s+=max(0,int(int(a[i])-int(c/f[i])))
    return s<=k

while(l+1<r):
    c=int((l+r)/2)
    if ok():
        r=c
    else:
        l=c
print(r)

Buggy submission (verdict: Runtime Error):
import math
a,b,x=map(int,input().split())
if a*a*b/2<x:
  print(math.degrees(math.atan(a*a*b/2*x)))
else:
  print(math.degrees(math.atan(2-2*x/a*a*b)))
Problem p02880 (python)

Fixed submission:
N=int(input())

list=[]
for i in range(1,10):
  for j in range(1,10):
    list.append(i*j)
if N in list:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
"""
制約
1≦N≦100
Nは整数
"""

#入力
n = int(input())

#九九リストの作成
list = []
for i in range(1, 10):
  for j in range(1, 10):
    list.append(i * j) #リストに追加　list.append()

#リスト内にNが存在するかどうかで判別＆出力
if N in list:
  print("Yes")
else:
  print("No")

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

while a=True:
  for i in range(10):
    for j in range(10):
      if i*j==N:
        print("Yes")
        break
  print("No")
  a=False

Buggy submission (verdict: Runtime Error):
xlist=[]
for a in range(10):
    for b in range(10):
        xlist.append(a*b)

if n in xlist:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
n=int(input())#入力

for a in range(10):
    for b in range(10):
        if a*b==n:
            print("Yes")
            break #Yesになった時にループを終了
    if a*b==81:
    print("No")#break(if文条件)が一度も起きなかった時のみ出力
Problem p02881 (python)

Fixed submission:
n=int(input())
xlist=[]
 
for i in range(1,int(n**0.5)+1):
    if n%i==0:
        xlist.append(i)
 
ans=max(xlist)
print(int(ans+n/ans-2))

Buggy submission (verdict: Runtime Error):
def make_divisor_list(num):
    if num < 1:
        return []
    elif num == 1:
        return [1]
    else:
        divisor_list = []
        divisor_list.append(1)
        for i in range(2, num // 2 + 1):
            if num % i == 0:
                divisor_list.append(i)
        divisor_list.append(num)

        return divisor_list
ya=make_divisor_list(N)
answer=[]
 
lenarray=len(ya)
if lenarray%2==0:
  for i in range(lenarray//2):
    x=ya.pop(0)+ya.pop(-1)
    answer.append(x)
else:
  for i in range((lenarray-1)//2):
    x=ya.pop(0)+ya.pop(-1)
    answer.append(x)
 
 
  y=ya[0]
  answer.append(y*2)
  
print(min(answer)-2)
N=int(input())

ya = []

for i in range(1,N+1):
    if N % i == 0:
        ya.append(i)
answer=[]

lenarray=len(ya)
if lenarray%2==0:
  for i in range(lenarray//2):
    x=ya.pop(0)+ya.pop(-1)
    answer.append(x)
else:
  for i in range((lenarray-1)//2):
    x=ya.pop(0)+ya.pop(-1)
    answer.append(x)


  y=ya[0]
  answer.append(y*2)
  
print(min(answer)-2)
Problem p02916 (python)

Fixed submission:
c=0
n=int(input())
A_list=list(map(int,input().split()))
B_list=list(map(int,input().split()))
C_list=list(map(int,input().split()))
for i in range(0,n):
  c+=B_list[A_list[i]-1]
  if i==n-1:
    break
  if A_list[i]==(A_list[i+1]-1):
    c+=C_list[A_list[i]-1]
print(c)

Buggy submission (verdict: Runtime Error):
c=0
n=int(input())
A_list=input().split()
B_list=input().split()
C_list=input().split()
for i in range(0,n):
  c+=B_list[A_list[i]-1]
  if i==n:
    break
  if A_list[i]==(A_list[i+1]-1):
    c+=C_list[A_list[i+1]-1]
print(c)
Problem p03041 (python)

Fixed submission:
A=list(map(int,input().split()))
S=input()
S=S[0:(A[1]-1)]+S[A[1]-1].lower()+S[A[1]:A[0]]
print(S)

Buggy submission (verdict: Runtime Error):
ソースコード 

Copy
Copy
A=list(map(int,input().split()))
S=input()
S=S[0:(A[1]-1)]+S[A[1]-1].lower()+S[(A[1]+1):A[0]]
print(S)

Buggy submission (verdict: Runtime Error):
A=list(map(int,input().split()))
S=input()
 
S(A(1)-1).lower()
print(S)

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

S(A(1)-1).lower()
print(''.join(S))
Problem p03075 (python)

Fixed submission:
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
k=int(input())
f=[b-a,c-b,d-c,e-d]
 
if((f[0]>k) or (f[1]>k) or (f[2]>k)or (f[3]>k)):
  print(':(')
elif(((f[0]+f[1])>k)or ((f[1]+f[2])>k)or ((f[2]+f[3])>k)):
  print(':(')
elif(((f[0]+f[1]+f[2])>k) or((f[1]+f[2]+f[3])>k)):
  print(':(')
elif((e-a)>k):
  print(':(')
else:
  print('Yay!')

Buggy submission (verdict: Runtime Error):
A=int(input())
B=int(input())
C=int(input())
D=int(input())
E=int(input())
list1=[A,B,C,D,E]
sum=0
for item in list1:
  if(item%10==0):
    sum+=item
  else:
    sum=sum+item+(10-item%10)
print(sum

Buggy submission (verdict: Runtime Error):
A=int(input())
B=int(input())
C=int(input())
D=int(input())
E=int(input())
list1=[A,B,C,D,E]
sum=0
for item in list1:
  if(w%10==0):
    sum+=w
  else:
    sum=sum+(10-w%10)
print(sum)

Buggy submission (verdict: Runtime Error):
a=input()
b=input()
c=input()
d=input()
e=input()
k=input()
f=[b-a,c-b,d-c,e-d]
 
if(f[0]>k or f[1]>k or f[2]>kor f[3]>k):
  print(':(')
elif((f[0]+f[1])>k or (f[1]+f[2])>k or (f[2]+f[3])>k):
  print(':(')
elif((f[0]+f[1]+f[2])>k or(f[1]+f[2]+f[3])>k):
  print(':(')
elif(e-a)>k:
  print(':(')
else:
  print('Yay!')

Buggy submission (verdict: Runtime Error):
a=input()
b=input()
c=input()
d=input()
e=input()
k=input()
f=[b-a,c-b,d-c,e-d]
 
if((f[0]>k) or (f[1]>k) or (f[2]>k)or (f[3]>k)):
  print(':(')
elif(((f[0]+f[1])>k)or ((f[1]+f[2])>k)or ((f[2]+f[3])>k)):
  print(':(')
elif(((f[0]+f[1]+f[2])>k) or((f[1]+f[2]+f[3])>k)):
  print(':(')
elif((e-a)>k):
  print(':(')
else:
  print('Yay!')

Buggy submission (verdict: Runtime Error):
a=input()
b=input()
c=input()
d=input()
e=input()
k=input()
f=[b-a,c-b,d-c,e-d]

if((f[0]>k) or (f[1]>k) or (f[2]>k)or (f[3]>k)):
  print(':(')
else if(((f[0]+f[1])>k)or ((f[1]+f[2])>k)or ((f[2]+f[3])>k)):
  print(':(')
else if(((f[0]+f[1]+f[2])>k) or((f[1]+f[2]+f[3])>k)):
  print(':(')
else if((e-a)>k):
  print(':(')
else:
  print('Yay!')

Buggy submission (verdict: Runtime Error):
a=input()
b=input()
c=input()
d=input()
e=input()
k=input()
c[0]=b-a
c[1]=c-b
c[2]=d-c
c[3]=e-d
if((c[0]>k) or (c[1]>k) or (c[2]>k)or (c[3]>k)):
  print(':(')
else if(((c[0]+c[1])>k)or ((c[1]+c[2])>k)or ((c[2]+c[3])>k)):
  print(':(')
else if(((c[0]+c[1]+c[2])>k) or((c[1]+c[2]+c[3])>k)):
  print(':(')
else if((e-a)>k):
  print(':(')
else:
  print('Yay!')
Problem p02627 (python)

Fixed submission:
a=input()
if(a.isupper()):
    print("A")
else:
    print("a")

Buggy submission (verdict: Runtime Error):
if(a.isupper()==True):
        print("A")
    else:
        print("a")

Buggy submission (verdict: Runtime Error):
 a = input()
    if(a.isupper()):
        print("A")
    else:
        print("a")

Buggy submission (verdict: Runtime Error):
#!/usr/bin/env python
# ---------------------------------------------------------------------------------------!
import os
import sys
from io import BytesIO, IOBase
# from bisect import bisect_left as bl                #c++ lowerbound bl(array,element)
# from bisect import bisect_right as br               #c++ upperbound br(array,element)


# ---------------------------------------MAIN()-----------------------------------------------!
def main():
    sys.stdin = open('input.txt', 'r')
    sys.stdout = open('output.txt', 'w')
    a = input()
    if(a.isupper()):
        print("A")
    else:
        print("a")


# -----------------------------------------------------------------------------------------!
# region fastio
BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def _init_(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def _init_(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
def input(): return sys.stdin.readline().rstrip("\r\n")

# endregion


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

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

if 1<=a<=9 and 1<=b<=9:
    print(a*b)
else:
    print(-1)

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

ans="no"

for i in range(9):
  if n%(9-i)==0:
    if n/(9-i)<10:
      ans="yes"
print(ans)
Problem p02933 (python)

Fixed submission:
a=int(input())
s=str(input())

if a>=3200:
  print(s)
else:
  print("red")

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

if a>=3200:
  print(S)
else:
  print("red")
Problem p02688 (python)

Fixed submission:
N, K = map(int, input().split())
#ANSlist = [1]*(N)
ANSlist = []
ANS = 0

for i in range(K):
    I = input() #
    S = input().split()
    #print(ANSlist)
    for j in range(len(S)):
        if S[j] != " ":
            #ANSlist[int(S[j])-1] = 0
            if not S[j] in ANSlist:
                ANSlist.append(S[j])
                
            


'''for i in range(len(ANSlist)):
    if ANSlist[i] != 0:
        ANS += 1'''
ANS = N - len(ANSlist)
print(ANS)

Buggy submission (verdict: Runtime Error):
N, K = map(int, input().split())
ANSlist = [1]*(N)

for i in range(K):
    I = input() #
    S = list(input())
    for j in range(len(S)):
        if S[j] != " ":
            ANSlist[int(S[j])-1] = 0

ANS = 0

for i in range(len(ANSlist[i])):
    if ANSlist[i] != 0:
        ANS += 1

print(ANS)

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

ANSlist = []

for i in range(1,K):
    inportant = int(input())
    trash = input()
    ANSlist.append(inportant)

ANS = N - max(ANSlist)

print(ANS)

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

ANSlist = []

for i in range(1,K):
    inportant = int(input())
    trash = input()
    ANSlist.append(inportant)

ANS = N - max(ANSlist)

print(ANS)

Buggy submission (verdict: Runtime Error):
N, K = map(int, input().split())
print("ok")
D = int(input)

ANSlist = [1]*(N -1)

for i in range(1,K):
    S = map(int, input().split())
    for j in range(S):
        ANSlist[S[j]] = 0

ANS = 0

for i in range(N-1):
    if ANSlist[i] != 0:
        ANS += 1

print(ANS)
Problem p02699 (python)

Fixed submission:
S, W = map(int, input().split())
print('unsafe' if W>=S else 'safe')

Buggy submission (verdict: Runtime Error):
N = int(input())
S = [input() for i in range(N)]
a = set(S)
print(len(a))
Problem p02701 (python)

Fixed submission:
N = int(input())
S = [input() for i in range(N)]
a = set(S)
print(len(a))

Buggy submission (verdict: Runtime Error):
N = int(input())
S = [input() for i in range(N)]
a = set(S)
print(len(a)