Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
s = input()
t = input()
n = len(s)
ans = 0
for i in range(n):
    if s[i] != t[i]:
        ans += 1
print(ans)

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

Buggy python submission (verdict: Runtime Error):
s = input()
t = input()
n = len(s)
ans = 0
for i in range(n):
    if s[i] != t[i]:
        s[i] = t[i]
        x += 1
print(ans)

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

Buggy python submission (verdict: Runtime Error):
s = input()
t = input()
n = len(s)
s.split()
t.split()
ans = 0
for i in range(n):
    if s[i] != t[i]:
        s[i] = t[i]
        x += 1
    else:
        pass
print(ans)

Fixed submission:
a = int(input())
print(a+a**2+a**3)
Buggy python submission (verdict: Runtime Error):
s = input()
t = input()
n = len(s)
s.split()
t.split()
ans = 0
for i in range(n):
    if s[i] != t[i]:
        s[i] = t[i]
    else:
        pass
print(ans)

Fixed submission:
s = input()
t = input()
n = len(s)
ans = 0
for i in range(n):
    if s[i] != t[i]:
        ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
n, k = map(int,input().split())
a = sorted(list(map(int,input().split())))
print(sum(a[:k]))

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

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

Fixed submission:
a = input()
if a == a.upper():
    print("A")
else:
    print("a")
Buggy python submission (verdict: Runtime Error):
x,y = map(int,input().split())
if y < x * 4 and y > x * 2 and y % 2 != 0:
    ans ="No"
else :
    ans ="Yes"
print(ans)

Fixed submission:
x  = (list(map(int,input().split())))
x = sum(x)
ans = 15-x
print(ans)

Buggy python submission (verdict: Runtime Error):
x  = (list(map(int,input().split()))
x = sum(x)
ans = 15-x
print(ans)

Fixed submission:
x  = (list(map(int,input().split())))
x = sum(x)
ans = 15-x
print(ans)

Buggy python submission (verdict: Runtime Error):
x  = (list(map(int,input().split()))
x = sum(x)
ans = 15-x
print(ans)

Fixed submission:
x  = (list(map(int,input().split())))
x = sum(x)
ans = 15-x
print(ans)

Buggy python submission (verdict: Runtime Error):
x  = (list[map(int,input().split()))
x = sum(x)
ans = 15-x
print(ans)
          

Fixed submission:
x  = (list(map(int,input().split())))
x = sum(x)
ans = 15-x
print(ans)

Buggy python submission (verdict: Runtime Error):
x  = list[map(int,input().split())]
x = sum(x)
ans = 15-x
print(ans)

Fixed submission:
x  = (list(map(int,input().split())))
x = sum(x)
ans = 15-x
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = map(int,input().split())
ans = 1
for i in a:
    ans *= i
if ans > 10**18 :
    ans = -1
print(ans)

Fixed submission:
n = int(input())
a = [int(i) for i in input().split()]
if 0 in a:
    print(0)
    quit()
ans = 1
for i in a:
    ans *= i
    #print(i)
    if ans > 10**18:
        ans = -1
        break
print(ans)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = map(int,input().split())
ans = 1
for i in n:
    ans *= i
if ans > 10**18 :
    ans = -1
print(ans)

Fixed submission:
n = int(input())
a = [int(i) for i in input().split()]
if 0 in a:
    print(0)
    quit()
ans = 1
for i in a:
    ans *= i
    #print(i)
    if ans > 10**18:
        ans = -1
        break
print(ans)
Buggy python submission (verdict: Runtime Error):
s = str(input())
if s == ABC:
    ans = ARC
else :
    ans == ABC
print(ans)

Fixed submission:
s = input()
if s == "ABC":
    ans = "ARC"
else :
    ans = "ABC"
print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = set(map(int,input().split()))
a = len(s)
print(a)

Fixed submission:
s,w = map(int,input().split())
if s <= w :
    print("unsafe")
else :
    print("safe")
Buggy python submission (verdict: Runtime Error):
r = input()
r = r * 2
ans = 3.1415926535897932384626433834*r

Fixed submission:
print(3.1415926535897932384626433834* 2* (int(input())))
Buggy python submission (verdict: Runtime Error):
s, t = map(str,input.split())
a, b = map(int,input.split())
u = input()
if s == u:
    a -= 1
if t == u:
    b -= 1
print("{0} {1}".format(a,b))

Fixed submission:
S, T = map(str,input().split())
A, B = map(int,input().split())
U = input()
 
if S == U: A -= 1
if T == U: B -= 1
print("{0} {1}".format(A,B))

Buggy python submission (verdict: Runtime Error):
s,t = map(str,input.split())
a,b = map(int,input.split())
u = str(input())
if s == u:
    a -= 1
if s == u :
    b -= 1
print("{0} {1}".format(a,b))

Fixed submission:
S, T = map(str,input().split())
A, B = map(int,input().split())
U = input()
 
if S == U: A -= 1
if T == U: B -= 1
print("{0} {1}".format(A,B))

Buggy python submission (verdict: Runtime Error):
S,T = map(str,input.split())
A,B = map(int,input.split())
u = str(input())
if s == u:
    a -= 1
else :
    b -= 1
print("{0} {1}".format(a,b))

Fixed submission:
S, T = map(str,input().split())
A, B = map(int,input().split())
U = input()
 
if S == U: A -= 1
if T == U: B -= 1
print("{0} {1}".format(A,B))

Buggy python submission (verdict: Runtime Error):
s,t = map(str,input.split())
a,b = map(int,input.split())
u = str(input())
if s == u:
    a -= 1
else :
    b -= 1
print("{0} {1}".format(a,b))

Fixed submission:
S, T = map(str,input().split())
A, B = map(int,input().split())
U = input()
 
if S == U: A -= 1
if T == U: B -= 1
print("{0} {1}".format(A,B))
Buggy python submission (verdict: Runtime Error):
W,E,R = map(int,input().split())
if W + E + R >= 22:
    ans("bust")
else :
    ans("win")
print(ans)


Fixed submission:
W,E,R = map(int,input().split())
if W + E + R >= 22:
    ans="bust"
else :
    ans="win"
print(ans)

Buggy python submission (verdict: Runtime Error):
W,E,R = map(int,input().split())
if W + E + R >= 22:
    ans("bust")
else :
    ans("win")
print(ans)

Fixed submission:
W,E,R = map(int,input().split())
if W + E + R >= 22:
    ans="bust"
else :
    ans="win"
print(ans)
Buggy python submission (verdict: Runtime Error):
r = input()
print(r**2)

Fixed submission:
r = int(input())
print(r**2)
Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())
if A < 10 and B <10:
  ans = (A * B)
else:
  ans = int(-1)
print(ans)

Fixed submission:
A , B= map(int,input().split())
if A < 10 and B <10:
  ans = (A * B)
else:
  ans = int(-1)
print(ans)
Buggy python submission (verdict: Runtime Error):
a = int(input())
b=int(input())
ans =max(a-b*2,0)
print(ans)

Fixed submission:
A,B = map(int,input().split())
curtain = int(B*2)
if A > curtain:
    ans = A - curtain
else:
    ans = 0
print(ans)

Buggy python submission (verdict: Runtime Error):
a = int(input())
b=int(input())
if a <b:
  print(a)
else:
  print(a-b)

Fixed submission:
A,B = map(int,input().split())
curtain = int(B*2)
if A > curtain:
    ans = A - curtain
else:
    ans = 0
print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
x = N += 1
if N % 0:
  ans = (0.5)
else:
  ans = (x / 2)
print(ans)

Fixed submission:
N = int(input())
if N%2 == 0:
  ans = 0.5
else:
  ans = (N // 2 + 1) / N
print(ans)
Buggy python submission (verdict: Runtime Error):
S = input()
T = input()
ans = 0
for i in range(3):
    if S[i] == T[i]:
        ans += 1
print(ans

Fixed submission:
S = input()
T = input()
ans = 0
for i in range(3):
    if S[i] == T[i]:
        ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
A,B = map(int,input.split())
tap = 1
ans = 0

while tap < B:
    tap += a - 1
    ans += 1
print(ans)

Fixed submission:
A,B = map(int,input().split())
tap = 1
ans = 0

while tap < B:
    tap += A - 1
    ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
import math
N = int(input())

xs = list(range(N))

print(sum(xs))

Fixed submission:

import math
N = int(input())
print(int(N * (N - 1) // 2))

Buggy python submission (verdict: Runtime Error):

import math
N = int(input())

sum = list(range(2,N))

print(sum)

Fixed submission:

import math
N = int(input())
print(int(N * (N - 1) // 2))

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

sum = list(range(N))

print(sum)

Fixed submission:

import math
N = int(input())
print(int(N * (N - 1) // 2))

Buggy python submission (verdict: Time Limit Exceeded):

import math
N = int(input())

sum =0
for i in range(N):
	sum += i

print(sum)

Fixed submission:

import math
N = int(input())
print(int(N * (N - 1) // 2))
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = input().split()

for i in range(N):
    A[i] = int(A[i])

ans = 0
for j in range(1, N):
    for i in range(0, j):
        ans += A[i]*A[j]

print(ans % 1000000007)

Fixed submission:
N = int(input())
A = input().split()

toA = 0
for i in range(N):
    A[i] = int(A[i])
    toA += A[i]

ans = 0
for i in range(0, N):
    toA -= A[i]
    ans += A[i]*toA

print(ans % 1000000007)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = [int(x) for x in input().split()]
s = 0
for i in range(N-1):
    for j in range(i+1, N):
        s += (A[i] * A[j]) % (10**9+7)
print(s%(10**9+7))


Fixed submission:
N = int(input())
A = [int(x) for x in input().split()]
S = [0] * (N+1)      #累積和用のリスト
s = 0
CONST = 10**9+7

#前準備として累積和を計算
for i in range(N):
    S[i+1] = S[i] + A[i]

#積の総和を計算
for i in range(N-1):
    s += A[i] * ((S[N] - S[i+1]) % CONST)
    s %= CONST

print(s)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = [int(x) for x in input().split()]
s = 0
for i, ai in enumerate(A):
    for j in range(i+1, N):
        s += ai * A[j]
print(s%(10**9+7))

Fixed submission:
N = int(input())
A = [int(x) for x in input().split()]
S = [0] * (N+1)      #累積和用のリスト
s = 0
CONST = 10**9+7

#前準備として累積和を計算
for i in range(N):
    S[i+1] = S[i] + A[i]

#積の総和を計算
for i in range(N-1):
    s += A[i] * ((S[N] - S[i+1]) % CONST)
    s %= CONST

print(s)
Buggy python submission (verdict: Runtime Error):
n, m =map(int,input().split())
l = [{int(x) for x in input().split()}]
ans = 0
for _ in range(m-1):
    a = {int(x) for x in input().split()}
    for j, s in enumerate(l):
        if s & a:
            l[j] |= a
            ans = max(ans, len(l[j]))
            if ans >= n:
                print(ans)
                exit()
            break
    else:
        l.append(a)
print(ans)


Fixed submission:
class UnionFind:
    #par[x]でxの親のID，xが根ならその木のサイズに―をつけたもの
    def __init__(self, n):
        #全て根として初期化
        self.par = [-1] * n
    
    #xの根を返す
    def root(self, x):
        #xが根なら終了
        if self.par[x] < 0:
            return x
        #そうでないならxの親について調べる
        self.par[x] = self.root(self.par[x])    #xの根が親になるように更新
        return self.par[x]

    #xとyを結合
    def union(self, x, y):
        x = self.root(x)
        y = self.root(y)
        #xとyが同じ根を持つ(＝同じ木に属する)なら終了
        if x == y:
            return
        #サイズの大きい木に小さい木を結合
        if self.par[x] > self.par[y]:   #xが大きくなるよう交換
            x, y = y, x
        self.par[x] += self.par[y]
        self.par[y] = x
    
    #xのサイズを返す
    def size(self, x):
        return -1 * self.par[self.root(x)]


#main
n, m = map(int, input().split())
uf = UnionFind(n)
#Union-FInd木を作る
for _ in range(m):
    a, b = map(int, input().split())
    uf.union(a-1, b-1)      #1からではなく0からに
#サイズが最大のものを探す
ans = 0
for i in range(n):
    ans = max(ans, uf.size(i))
print(ans)

Buggy python submission (verdict: Runtime Error):
n, m =map(int,input().split())
l = [{int(x) for x in input().split()}]
ans = 0
for _ in range(m-1):
    a = {int(x) for x in input().split()}
    for j, s in enumerate(l):
        if s & a:
            l[j] |= a
            break
    else:
        l.append(a)
for s in l:
    ans = max(ans, len(s))
print(ans)


Fixed submission:
class UnionFind:
    #par[x]でxの親のID，xが根ならその木のサイズに―をつけたもの
    def __init__(self, n):
        #全て根として初期化
        self.par = [-1] * n
    
    #xの根を返す
    def root(self, x):
        #xが根なら終了
        if self.par[x] < 0:
            return x
        #そうでないならxの親について調べる
        self.par[x] = self.root(self.par[x])    #xの根が親になるように更新
        return self.par[x]

    #xとyを結合
    def union(self, x, y):
        x = self.root(x)
        y = self.root(y)
        #xとyが同じ根を持つ(＝同じ木に属する)なら終了
        if x == y:
            return
        #サイズの大きい木に小さい木を結合
        if self.par[x] > self.par[y]:   #xが大きくなるよう交換
            x, y = y, x
        self.par[x] += self.par[y]
        self.par[y] = x
    
    #xのサイズを返す
    def size(self, x):
        return -1 * self.par[self.root(x)]


#main
n, m = map(int, input().split())
uf = UnionFind(n)
#Union-FInd木を作る
for _ in range(m):
    a, b = map(int, input().split())
    uf.union(a-1, b-1)      #1からではなく0からに
#サイズが最大のものを探す
ans = 0
for i in range(n):
    ans = max(ans, uf.size(i))
print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(input())
if(n%1000 == 0):
	print('0')
else:
	n_str = str(n)
    g = n_str[0]
    print((n+1)*1000-n)

Fixed submission:
n = int(input())
for i in range(1000,10001,1000):
    if(i>=n):
        print(i-n)
        break
Buggy python submission (verdict: Time Limit Exceeded):
a,b,c,k = map(int,input().split())
result = 0

while k > 0:
    if a > 0:
        result+=1
        a-=1
        k-=1
        continue
    elif b > 0:
        b-=1
        k-=1
        continue
    else:
        result-=1
        c-=1
        k-=1
        continue

print(result)

Fixed submission:
a,b,c,k = map(int,input().split())
if a >= k:
    print(k)
elif a < k and b >= k-a:
    print(a)
else:
    print(a-(k-a-b))
Buggy python submission (verdict: Runtime Error):
D,T,S=int(input())
if 1<=D<=10000 and 1<=T<=10000 and 1<=S<=10000:
  if (D/S)>T:
    print("He will be late")
  else:
    print("Yes")

Fixed submission:
D,T,S=map(int,input().split())
if 1<=D<=10000 and 1<=T<=10000 and 1<=S<=10000:
  if (D/S)>T:
    print("No")
  else:
    print("Yes")
Buggy python submission (verdict: Time Limit Exceeded):
cash = int(input())

n=0
paid =0
while paid < cash:
  paid = 1000 * n 

print(paid - cash)



Fixed submission:
cash = int(input())
 
n = 0
paid = 0
while paid < cash:
  paid = 1000 * n 
  n += 1
 
print(paid - cash)
Buggy python submission (verdict: Runtime Error):
cases = int(input())

account = {'AC': 0, 'WA' : 0, 'TLE':0, 'RE':0}

while --cases > 0:
  ++account[input()]
  
print('AC x '+ account['AC'])
print('WA x '+ account['WA'])
print('TLE x '+ account['TLE'])
print('RE x '+ account['RE'])

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

cases = int(input())
account = {'AC': 0, 'WA' : 0, 'TLE':0, 'RE':0}

while cases > 0:
  account[input().split()[0]] += 1
  cases -= 1
  
print('AC x '+ str(account['AC']))
print('WA x '+ str(account['WA']))
print('TLE x '+ str(account['TLE']))
print('RE x '+ str(account['RE']))

Buggy python submission (verdict: Runtime Error):
cases = int(input())

account = {'AC': 0, 'WA' : 0, 'TLE':0, 'RE':0}

while cases > 0:
  account[input()]++
  cases--
  
print('AC x '+ account['AC'])
print('WA x '+ account['WA'])
print('TLE x '+ account['TLE'])
print('RE x '+ account['RE'])

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

cases = int(input())
account = {'AC': 0, 'WA' : 0, 'TLE':0, 'RE':0}

while cases > 0:
  account[input().split()[0]] += 1
  cases -= 1
  
print('AC x '+ str(account['AC']))
print('WA x '+ str(account['WA']))
print('TLE x '+ str(account['TLE']))
print('RE x '+ str(account['RE']))

Buggy python submission (verdict: Runtime Error):
cases = int(input())

account = {'AC': 0, 'WA' : 0, 'TLE':0, 'RE':0}

while cases-- > 0:
  account[input()]++
  
print('AC x '+ account['AC'])
print('WA x '+ account['WA'])
print('TLE x '+ account['TLE'])
print('RE x '+ account['RE'])
  
  

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

cases = int(input())
account = {'AC': 0, 'WA' : 0, 'TLE':0, 'RE':0}

while cases > 0:
  account[input().split()[0]] += 1
  cases -= 1
  
print('AC x '+ str(account['AC']))
print('WA x '+ str(account['WA']))
print('TLE x '+ str(account['TLE']))
print('RE x '+ str(account['RE']))
Buggy python submission (verdict: Runtime Error):
s=input()
if s=="Sunny":print("Cloudy")
elif s=="Cloudy":print("Rainy")
else print("Sunny")

Fixed submission:
s=input()
if s=="Sunny":print("Cloudy")
elif s=="Cloudy":print("Rainy")
else:print("Sunny")
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=list(map(int,input().split()))
s=sum(b)
for i in range(n-1):
  if a[i]+1==a[i+1]:
    s+=c[a[i]]
print(s)

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=list(map(int,input().split()))
s=sum(b)
for i in range(n-1):
  if a[i]+1==a[i+1]:
    s+=c[a[i]-1]
print(s)
Buggy python submission (verdict: Runtime Error):
print((int)input()/3)

Fixed submission:
print(int(input())//3)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))

ans = 1
for a in A:
    ans *= a
    if ans == 0:
        break
    elif ans > 10**18:
        ans = -1
        break

print(ans)

Fixed submission:
A, B = map(int,input().split())
print(A*B)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int,input().split()))

ans = 1
for a in A:
    ans *= a
    if ans == 0:
        break

if ans > 10**18:
    print(-1)
else:
    print(ans)

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

ans = 1
if 0 in A:
    print(0)
else:
    for a in A:
        ans *= a
        if ans > 10**18:
            ans = -1
            break

    print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int,input().split()))

ans = 1
for a in A:
    ans *= a

if ans > 10**18:
    print(-1)
else:
    print(ans)

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

ans = 1
if 0 in A:
    print(0)
else:
    for a in A:
        ans *= a
        if ans > 10**18:
            ans = -1
            break

    print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input.split()))

ans = [0]*N

for i in A:
    ans[i-1] += 1

for j in ans:
    print(j)


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

ans = [0]*N

for i in A:
    ans[i-1] += 1

for j in ans:
    print(j)
Buggy python submission (verdict: Runtime Error):
import sys

N, M = map(int, input().split())

def com(n,r):
    ans1 = 1
    ans2 = 1
    tmp = r
    while r != 0:
        ans1 = ans1 * (n)
        ans2 = ans2 * r
        n -= 1
        r -= 1

    return ans1/ans2

print(int(com(N,2)+com(M,2))


Fixed submission:
import sys

N, M = map(int, input().split())

def com(n,r):
    ans1 = 1
    ans2 = 1
    tmp = r
    while r != 0:
        ans1 = ans1 * (n)
        ans2 = ans2 * r
        n -= 1
        r -= 1

    return ans1/ans2

print(int(com(N,2)+com(M,2)))

Buggy python submission (verdict: Runtime Error):
import sys

N = int(input()) #偶数の球の数
M = int(input()) #奇数の球の数

def combination(n,r):
    if n == 1:
        ans = 0

    if r != 1:
        ans = n/r * combination(n-1,r-1)
    elif r == 1:
        ans = n/r

    return ans

print(combination(N,2)+combination(M,2))


Fixed submission:
import sys

N, M = map(int, input().split())

def com(n,r):
    ans1 = 1
    ans2 = 1
    tmp = r
    while r != 0:
        ans1 = ans1 * (n)
        ans2 = ans2 * r
        n -= 1
        r -= 1

    return ans1/ans2

print(int(com(N,2)+com(M,2)))

Buggy python submission (verdict: Runtime Error):
import sys

N = int(sys.argv[1]) #偶数の球の数
M = int(sys.argv[2]) #奇数の球の数

def combination(n,r):
    if n == 1:
        ans = 0

    if r != 1:
        ans = n/r * combination(n-1,r-1)
    elif r == 1:
        ans = n/r

    return ans

print(combination(N,2)+combination(M,2))

Fixed submission:
import sys

N, M = map(int, input().split())

def com(n,r):
    ans1 = 1
    ans2 = 1
    tmp = r
    while r != 0:
        ans1 = ans1 * (n)
        ans2 = ans2 * r
        n -= 1
        r -= 1

    return ans1/ans2

print(int(com(N,2)+com(M,2)))
Buggy python submission (verdict: Runtime Error):
import math

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

pricemax_A = math.floor((A+1)/0.08)
pricemin_A = math.floor(A/0.08)

pricemax_B = math.floor((B+1)/0.1)
pricemin_B = math.floor(B/0.1)

if pricemin_A >= pricemax_B or pricemax_A =< pricemin_B:
    print(-1)
elif pricemin_A >= pricemin_B:
    print(pricemin_A)
elif pricemin_A < pricemin_B:
    print(pricemin_B)

Fixed submission:
S = list(input())

if (S[0] == S[1]) and (S[0] == S[2]) and (S[1] == S[2]):
    print('No')
else:
    print('Yes')
Buggy python submission (verdict: Runtime Error):
import math

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

pricemax_A = math.floor((A+1)/0.08)
pricemin_A = math.floor(A/0.08)

pricemax_B = math.floor((B+1)/0.1)
pricemin_B = math.floor(B/0.1)

if pricemin_A >= pricemax_B or pricemax_A =< pricemin_B:
    print(-1)
elif pricemin_A >= pricemin_B:
    print(pricemin_A)
elif pricemin_A < pricemin_B:
    print(pricemin_B)

Fixed submission:
import math

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

pricemax_A = math.floor((A+1)/0.08)
pricemin_A = math.ceil(A/0.08)

pricemax_B = math.floor((B+1)/0.1)
pricemin_B = math.ceil(B/0.1)

if pricemin_A >= pricemin_B and pricemin_A < pricemax_B:
    print(pricemin_A)
elif pricemin_A <= pricemin_B and pricemax_A > pricemin_B:
    print(pricemin_B)
else:
    print(-1)

Buggy python submission (verdict: Runtime Error):
import math

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

pricemax_A = math.floor((A+1)/0.08)
pricemin_A = math.floor(A/0.08)

pricemax_B = math.floor((B+1)/0.1)
pricemin_B = math.floor(B/0.1)

if A > B or A < 0 or B < 0 or A > 100 or B > 100:
    return (-1)

if pricemin_A >= pricemin_B and pricemin_A < pricemax_B:
    print(pricemin_A)
elif pricemin_A <= pricemin_B and pricemax_A > pricemin_B:
    print(pricemin_B)
else:
    print(-1)

Fixed submission:
import math

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

pricemax_A = math.floor((A+1)/0.08)
pricemin_A = math.ceil(A/0.08)

pricemax_B = math.floor((B+1)/0.1)
pricemin_B = math.ceil(B/0.1)

if pricemin_A >= pricemin_B and pricemin_A < pricemax_B:
    print(pricemin_A)
elif pricemin_A <= pricemin_B and pricemax_A > pricemin_B:
    print(pricemin_B)
else:
    print(-1)
Buggy python submission (verdict: Runtime Error):
import math

N, M = map(int,input().split())

if M == 0:
    if N == 1:
        print(0)
    else:
        print(10**(N-1))
else:
    s = list()
    c = list()

    for i in range(M):
        s_val, c_val = map(int, input().split())
        s.append(s_val)
        c.append(c_val)

    ans = 1000
    for i in range(int(10**(N)-1), int(10**(N-1)-1),-1):
        keta=list()
        for j in range(N):
            keta.append((math.floor(i/(10**j))%10))
        counter = 0
        print(i)
        for k in range(M):

            if keta[N-s[k]] == c[k]:
                counter += 1
            if counter == M:
                ans = i

    elif ans == 1000:
        print(-1)
    else:
        print(ans)


Fixed submission:
import math
 
N, M = map(int,input().split())
 
if M == 0:
    if N == 1:
        print(0)
    else:
        print(10**(N-1))
else:
    s = list()
    c = list()
 
    for i in range(M):
        s_val, c_val = map(int, input().split())
        s.append(s_val)
        c.append(c_val)
 
    ans = 1000
    for i in range(int(10**(N)-1), int(10**(N-1)-1),-1):
        keta=list()
        for j in range(N):
            keta.append((math.floor(i/(10**j))%10))
        counter = 0
        
        for k in range(M):
 
            if keta[N-s[k]] == c[k]:
                counter += 1
            if counter == M:
                ans = i
 
    if N == 1 and M == 1 and c[0] == 0:
        print(0)
 
    elif ans == 1000:
        print(-1)
    else:
        print(ans)