Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
N,Y=map(int,input().split())
ichiman=0
gosen=0
sen=0
se_ichi=0
go_ichi=0
sen_go_ichi=0
mismatch=0
max_ichiman=int(2*(10**7)/(10**4))
for i in range(max_ichiman+1):
    if i*10**4==Y:
        ichiman=i
        break
    if i*10**4>Y:
        ichiman=i-1
        break
Y=Y-ichiman*10**4
for j in range(2):
    if j*5*10**3>=Y:
        gosen=j
        break
Y=Y-gosen*5*10**3
for k in range(5):
    if k*10**3==Y:
        sen=k
min_N=ichiman+gosen+sen
for i2 in range(N-min_N+1):
    if N-min_N<0:
        mismatch=1
    if i2*9>N-min_N:
        se_ichi=i2-1
        break
N=N-se_ichi*9
for j2 in range(N-min_N+1):
    if N-min_N<0:
        mismatch=1
    if j2*5>N-min_N:
        sen_go_ichi=j2-1
        break
N=N-sen_go_ichi*5
for k2 in range(N-min_N+1):
    if N-min_N<0:
        mismatch=1
    if k2==N-min_N:
        go_ichi=k2
        break
N=N-go_ichi
if N-min_N<0:
    mismatch=1
#print(ichiman, gosen, sen,N)
ichiman=ichiman-se_ichi-sen_go_ichi-go_ichi
gosen=gosen+2*go_ichi+sen_go_ichi
sen=sen+5*sen_go_ichi+10*se_ichi

if sen|gosen|ichiman<0:
    mismatch=1
if mismatch==1:
    sen=-1
    ichiman=-1
    gosen=-1
3print(se_ichi,go_ichi,sen_go_ichi,mismatch)
print(ichiman, gosen, sen)

Fixed submission:
N,Y=map(int,input().split())
ichiman=0
gosen=0
sen=0
se_ichi=0
go_ichi=0
sen_go_ichi=0
mismatch=0
max_ichiman=int(2*(10**7)/(10**4))
for i in range(max_ichiman+1):
    if i*10**4==Y:
        ichiman=i
        break
    if i*10**4>Y:
        ichiman=i-1
        break
Y=Y-ichiman*10**4
for j in range(2+1):
    if j*5*10**3>Y:
        gosen=j-1
        break
Y=Y-gosen*5*10**3
for k in range(5):
    if k*10**3==Y:
        sen=k
min_N=ichiman+gosen+sen
if N-min_N<0:
    mismatch=1
#print(ichiman, gosen, sen,N)
for i2 in range(N-min_N+1):
    if N-min_N<0:
        mismatch=1
    if i2*9>N-min_N:
        se_ichi=i2-1
        break
N=N-se_ichi*9
for j2 in range(N-min_N+1):
    if N-min_N<0:
        mismatch=1
    if j2*5>N-min_N:
        sen_go_ichi=j2-1
        break
N=N-sen_go_ichi*5
for k2 in range(N-min_N+1):
    if N-min_N<0:
        mismatch=1
    if k2==N-min_N:
        go_ichi=k2
        break
N=N-go_ichi
if N-min_N<0:
    mismatch=1
#print(ichiman, gosen, sen,N)
ichiman=ichiman-se_ichi-sen_go_ichi-go_ichi
gosen=gosen+2*go_ichi+sen_go_ichi
sen=sen+5*sen_go_ichi+10*se_ichi

if sen|gosen|ichiman<0:
    mismatch=1
if mismatch==1:
    sen=-1
    ichiman=-1
    gosen=-1
#print(se_ichi,go_ichi,sen_go_ichi,mismatch)
print(ichiman, gosen, sen)
Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python
# coding:utf-8
import os, sys
import math

N = input()
K = input()
X=input()
Y=input()
if N-K >= 0:
    print X*K + Y*(N-K)
else:
    pritn X*K





Fixed submission:
#!/usr/bin/env python
# coding:utf-8
import os, sys
import math

N = input()
K = input()
X=input()
Y=input()
if N <= K:
    print X*N
else:
    print X*K + Y*(N-K)
Buggy python submission (verdict: Runtime Error):
print(48 - input())

Fixed submission:
print(48 - int(input()))
Buggy python submission (verdict: Runtime Error):
data = input().split()

if data[1] = "+":
    print int(data[0] + data[2])
else
    print int(data[0] - data[2])

Fixed submission:
data = input().split()

if data[1] in "+":
    print(int(data[0]) + int(data[2]))
else:
    print(int(data[0]) - int(data[2]))

Buggy python submission (verdict: Runtime Error):
data = input().split() # "1 2 3"と入力
 
if data[1]) = "+":
    print int(data[0] + data[2])
else
    print int(data[0] - data[2])

Fixed submission:
data = input().split()

if data[1] in "+":
    print(int(data[0]) + int(data[2]))
else:
    print(int(data[0]) - int(data[2]))

Buggy python submission (verdict: Runtime Error):
data = input().split() # "1 2 3"と入力

if data[1]) = "+":
    print data[0] + data[2]
else
    print data[0] - data[2]

Fixed submission:
data = input().split()

if data[1] in "+":
    print(int(data[0]) + int(data[2]))
else:
    print(int(data[0]) - int(data[2]))
Buggy python submission (verdict: Runtime Error):
R = int(input())
G = int((input))
peform = 

Fixed submission:
R = int(input())
G = int(input())
p = G * 2 - R
print(p)
Buggy python submission (verdict: Runtime Error):
M = input()
print(24 - M + 24)

Fixed submission:
M = input()
print(24 - int(M) + 24)
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input())
s=str(input())
if s[:a].isnumeric() and s[a]=="-" and s[a+1:].isnumeric():
    print("Yes")
else:
    print("No")

Fixed submission:
a,b=map(int,input().split())
s=str(input())
if s[:a].isnumeric() and s[a]=="-" and s[a+1:].isnumeric():
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input())
s=list(input())
if s[:a].isnumeric() and s[a]=="-" and s[a+1:].isnumeric():
    print("Yes")
else:
    print("No")

Fixed submission:
a,b=map(int,input().split())
s=str(input())
if s[:a].isnumeric() and s[a]=="-" and s[a+1:].isnumeric():
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
x,y=map(int,inout().split())
len=0
flag=False
while flag:
  if x*2<y:
    len+=1
print(len)

Fixed submission:
x,y=map(int,input().split())
len=1
while True:
  if x*2<=y:
    len+=1
  else:
    break
  x*=2
print(len)
Buggy python submission (verdict: Runtime Error):
n=input()
m=n
s=0
while True:
  q,mod=divmod(m,10)
  s+=mod
  m=q
  if q<=0:
    break
if n%s==0:
  print("Yes")
else:
  print("No")


Fixed submission:
n=int(input())
m=n
s=0
while True:
  q,mod=divmod(m,10)
  s+=mod
  m=q
  if q<=0:
    break
if n%s==0:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
n=input()
m=n
s=0
while true:
  q,mod=divmod(m,10)
  s+=mod
  m=q
  if q<=0:
    break
if n%s==0:
  print("Yes")
else:
  print("No")


Fixed submission:
n=int(input())
m=n
s=0
while True:
  q,mod=divmod(m,10)
  s+=mod
  m=q
  if q<=0:
    break
if n%s==0:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
d1 = 24 - M
ans = d1 + 24
print ans

Fixed submission:
M = input()
print 48-M
Buggy python submission (verdict: Runtime Error):
A ,B = map(int, raw_input().split())
S = raw_input().split("-")
print len(S) == 2 and len(S[0]) == A and len(S[1]) == B ? "Yes" : "No"

Fixed submission:
A ,B = map(int, raw_input().split())
S = raw_input().split("-")
print  "Yes" if len(S) == 2 and len(S[0]) == A and len(S[1]) == B else "No"
Buggy python submission (verdict: Runtime Error):
# C - Special Trains
import math

N = int(raw_input())
C, S, F = [0]*(N-1), [0]*(N-1), [0]*(N-1)
for i in range(N-1):
  C[i], S[i], F[i] = map(int, raw_input().split())
result = [0] * N

for station in range(N):
  now = station
  time = 0
  while now != N-1:
    time = S[now] + C[now] if time <= S[now] else int(math.floor(time/F[now])*F[now] + C[now]
    now += 1
  result[station] = time

for i in result: print i

Fixed submission:
# C - Special Trains
import math

N = int(raw_input())
C, S, F = [0]*(N-1), [0]*(N-1), [0]*(N-1)
for i in range(N-1):
  C[i], S[i], F[i] = map(int, raw_input().split())
result = [0] * N

for station in range(N):
  now = station
  time = 0
  while now != N-1:
    time = S[now] + C[now] if time <= S[now] else int(math.ceil(float(time)/float(F[now])))*F[now] + C[now]
    now += 1
  result[station] = time

for i in result: print i
Buggy python submission (verdict: Runtime Error):
# A - Libra
# coding: utf-8
A, B, C, D = map(int, raw_input())
if A+B > C+D:
  print "Left"
elif A+B < C+D:
  print "Right"
else:
  print "Balanced"

Fixed submission:
# A - Libra
# coding: utf-8
A, B, C, D = map(int, raw_input().split())
if A+B > C+D:
  print "Left"
elif A+B < C+D:
  print "Right"
else:
  print "Balanced"
Buggy python submission (verdict: Runtime Error):
# B - Two Anagrams
# coding: utf-8

A = list(raw_input())
B = list(raw_input())
A.sort()
B.sort(), B.reverse()

print "Yes" if A < B else "No"

Fixed submission:
A, B = map(int, raw_input().split())
print (A+B+1)/2
Buggy python submission (verdict: Time Limit Exceeded):
# C - Good Sequence
# coding: utf-8

N = int(raw_input())
a = map(int, raw_input().split())
result = 0

while a != []:
  first_num = a[0]
  first_count = a.count(first_num)
  result += first_count if first_num > first_count else first_count-first_num
  a = [num for num in a if num is not first_num]

print result

Fixed submission:
# C - Good Sequence
# coding: utf-8

from collections import Counter

N = int(raw_input())
a = map(int, raw_input().split())
result = 0
cnt = Counter()

for num in a: cnt[num] += 1

for x, y in cnt.items():
  result += y if x>y else y-x

print result
Buggy python submission (verdict: Runtime Error):
# A - Placing Marbles
# coding: utf-8

s1, s2 ,s3 = map(int, raw_input().split())
s = [s1, s2, s3]

print s.count(1)

Fixed submission:
# A - Placing Marbles
# coding: utf-8

s1, s2 ,s3 = map(int, raw_input())
s = [s1, s2, s3]

print s.count(1)
Buggy python submission (verdict: Runtime Error):
import collections

N, K = map(int, raw_input().split())
A = map(int, raw_input().split())
A_dict = collections.Counter(A)
A_common = A_dict.most_common(K)
result = N

for i in range(K): result -= A_common[i][1]

print result

Fixed submission:
# C - Not so Diverse
# coding: utf-8

import collections

N, K = map(int, raw_input().split())
A = map(int, raw_input().split())
A_dict = collections.Counter(A)
A_common = A_dict.most_common(K)

if len(A_dict) <= K:
  result = 0
else:
  result = N
  for i in range(K): result -= A_common[i][1]

print result
Buggy python submission (verdict: Runtime Error):
# A - Parking

N, A, B = map(int, raw_input().split)

print min(N*A, B)

Fixed submission:
# A - Parking

N, A, B = map(int, raw_input().split())

print min(N*A, B)

Buggy python submission (verdict: Runtime Error):
# A - Parking

N, A, B = map(int, raw_input().split)

print mint(N*A, B)

Fixed submission:
# A - Parking

N, A, B = map(int, raw_input().split())

print min(N*A, B)
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
print('Yes' if a <= c <= b else ''No')

Fixed submission:
a,b,c=map(int,input().split())
print('Yes' if a <= c <= b else 'No')
Buggy python submission (verdict: Runtime Error):
import numpy as np

n,m=map(int,input().split())
e = []

for _ in range(1,m+1):
    a,b=map(int,input().split())
    e.append((a,b))

q = int(input())
cs = [0] * (q+1)
dp = np.zeros((n+1, 11), int)
for i in range(1, q+1):
    v,d,c=map(int,input().split())
    cs[i] = c
    dp[v,d] = i

for d in range(9, -1, -1):
    for i in range(1,n+1):
        dp[i,d] = max(dp[i,d], dp[i,d+1])
    for a,b in e:
        dp[a,d] = max(dp[a,d], dp[b,d+1])
        dp[b,d] = max(dp[b,d], dp[a,d+1])

for i in range(1, n+1):
    print(cs[dp[i,0]])

Fixed submission:
n,m=map(int,input().split())
e = []

for _ in range(1,m+1):
    a,b=map(int,input().split())
    e.append((a,b))

q = int(input())
cs = [0] * (q+1)
dp = [[0]*11 for _ in range(n+1)]
for i in range(1, q+1):
    v,d,c=map(int,input().split())
    cs[i] = c
    dp[v][d] = i

for d in range(9, -1, -1):
    for i in range(1,n+1):
        dp[i][d] = max(dp[i][d], dp[i][d+1])
    for a,b in e:
        dp[a][d] = max(dp[a][d], dp[b][d+1])
        dp[b][d] = max(dp[b][d], dp[a][d+1])

for i in range(1, n+1):
    print(cs[dp[i][0]])

Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np

n,m=map(int,input().split())
e = []

for _ in range(1,m+1):
    a,b=map(int,input().split())
    e.append((a,b))

q = int(input())
cs = [0] * (q+1)
dp = np.zeros((n+1, 11), int)
for i in range(1, q+1):
    v,d,c=map(int,input().split())
    cs[i] = c
    dp[v,d] = i

for d in range(9, -1, -1):
    for i in range(1,n+1):
        dp[i,d] = max(dp[i,d], dp[i,d+1])
    for a,b in e:
        dp[a,d] = max(dp[a,d], dp[b,d+1])
        dp[b,d] = max(dp[b,d], dp[a,d+1])

for i in range(1, n+1):
    print(cs[dp[i,0]])

Fixed submission:
n,m=map(int,input().split())
e = []

for _ in range(1,m+1):
    a,b=map(int,input().split())
    e.append((a,b))

q = int(input())
cs = [0] * (q+1)
dp = [[0]*11 for _ in range(n+1)]
for i in range(1, q+1):
    v,d,c=map(int,input().split())
    cs[i] = c
    dp[v][d] = i

for d in range(9, -1, -1):
    for i in range(1,n+1):
        dp[i][d] = max(dp[i][d], dp[i][d+1])
    for a,b in e:
        dp[a][d] = max(dp[a][d], dp[b][d+1])
        dp[b][d] = max(dp[b][d], dp[a][d+1])

for i in range(1, n+1):
    print(cs[dp[i][0]])
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
t,a=map(int,input().split())
for i in range(n-1):
    ti,ai=map(int,input().split())
    tii,aii,m=ti,ai,1
    while tii*m < t or aii*m < a:
        m+=1
    t,a=tii*m,aii*m
print(t+a)


Fixed submission:
import math
n=int(input())
t,a=1,1
for i in range(n):
    ti,ai=map(int,input().split())
    m=max(math.ceil(t/ti), math.ceil(a/ai))
    while t > ti*m or a > ai*m:
        m+=1
    while t <= ti*(m-1) and a <= ai*(m-1):
        m-=1
    t,a=ti*m,ai*m
print(t+a)
Buggy python submission (verdict: Runtime Error):
    s=list(input())
    k=int(input())
    for i in range(len(s)):
        c = ord('z') - ord(s[i]) + 1
        if c > k:
            continue
        else:
            k -= c
            s[i] = 'a'
    if k > 0:
        s[-1] = chr(ord('a') + ((ord(s[-1]) - ord('a') + k) % 26))
    print(''.join(s))

Fixed submission:
s=list(input())
k=int(input())
for i in range(len(s)):
    c = (ord('z') - ord(s[i]) + 1)%26
    if c <= k:
        k -= c
        s[i] = 'a'
s[-1] = chr(ord('a') + ((ord(s[-1]) - ord('a') + k) % 26))
print(''.join(s))
Buggy python submission (verdict: Time Limit Exceeded):
n,a=map(int,input().split())
x=list(map(int,input().split()))
dp=[[[0 for _ in range(50*n+1)] for j in range(n+1)] for _ in range(n+1)] #dp[n][n][n*50]=cnt
dp[0][0][0] = 1
for i in range(1, n+1):
    for j in range(i+1):
        for k in range(50*n+1):
            if i > 0:
                dp[i][j][k] = dp[i-1][j][k]
                if k >= x[i-1]:
                    dp[i][j][k] += dp[i-1][j-1][k-x[i-1]]

ans = 0
for j in range(1,n+1):
    ans += dp[n][j][a*j]
print(ans)


Fixed submission:
n,a=map(int,input().split())
x=list(map(int,input().split()))
dp=[[[0 for _ in range(50*n+1)] for j in range(n+1)] for _ in range(n+1)] #dp[n][n][n*50]=cnt
dp[0][0][0] = 1
for i in range(1, n+1):
    for j in range(i+1):
        for k in range(50*n+1):
            if i > 0:
                dp[i][j][k] = dp[i-1][j][k]
                if k >= x[i-1]:
                    dp[i][j][k] += dp[i-1][j-1][k-x[i-1]]

ans = 0
for j in range(1,n+1):
    ans += dp[n][j][a*j]
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n,l=map(int,input().split())
s=[]
for i in range(n):
    s.append(input())
s=list(sorted(s))
print(''.join(s))


Fixed submission:
n,l=map(int,input().split())
s=[]
for i in range(n):
    s.append(input())
s=list(sorted(s))
print(''.join(s))
Buggy python submission (verdict: Runtime Error):
print str(48 - int(raw_input))

Fixed submission:
print str(48 - int(raw_input()))
Buggy python submission (verdict: Runtime Error):
N=input()
c=0
for i in range(N):
    l,r=(int(i) for i in input().split())
    c+=r-l+1
print(c)

Fixed submission:
N=int(input())
c=0
for i in range(N):
    l,r=(int(i) for i in input().split())
    c+=r-l+1
print(c)
Buggy python submission (verdict: Runtime Error):
# your code goes here
def gcd(a,b):
    if b>a:
        t=b
        b=a
        a=t
    a1=a
    b1=b
    while b1>0:
        r=a1%b1
        a1=b1
        b1=r
    a//=a1
    a*=b
    return a
N=int(input())
T=[int(input()) for i in range(N)]
m=gcd(T[0],T[1])
i=2
while i <N:
    m=gcd(m,T[i])
    i+=1
print(m)

Fixed submission:
# your code goes here
def gcd(a,b):
    if b>a:
        t=b
        b=a
        a=t
    a1=a
    b1=b
    while b1>0:
        r=a1%b1
        a1=b1
        b1=r
    a//=a1
    a*=b
    return a
N=int(input())
T=[int(input()) for i in range(N)]
if N==1:
    print (T[0])
else:
    m=gcd(T[0],T[1])
    i=2
    while i <N:
        m=gcd(m,T[i])
        i+=1
    print(m)

Buggy python submission (verdict: Runtime Error):
def gcd(a,b):
    if b>a:
        t=b
        b=a
        a=t
    while b>0:
        r=a%b
        a=b
        b=r
    return a
N=int(input())
T=[int(input()) for i in range(N)]
g=gcd(T[0],T[1])
i=2
while i <N:
    g=gcd(T[i],g)
    i+=1
M=g
for i in range(N):
    M*=T[i]//g
print(M)

Fixed submission:
# your code goes here
def gcd(a,b):
    if b>a:
        t=b
        b=a
        a=t
    a1=a
    b1=b
    while b1>0:
        r=a1%b1
        a1=b1
        b1=r
    a//=a1
    a*=b
    return a
N=int(input())
T=[int(input()) for i in range(N)]
if N==1:
    print (T[0])
else:
    m=gcd(T[0],T[1])
    i=2
    while i <N:
        m=gcd(m,T[i])
        i+=1
    print(m)

Buggy python submission (verdict: Runtime Error):
# your code goes here
def gcd(a,b):
    if b>a:
        t=b
        b=a
        a=t
    while b>0:
        r=a%b
        a=b
        b=r
    return a
N=int(input())
T=[int(input()) for i in range(N)]
g=gcd(T[0],T[1])
i=2
while i <N:
    g=gcd(T[i],g)
M=g
for i in range(N):
    M*=T[i]//g
print(M)

Fixed submission:
# your code goes here
def gcd(a,b):
    if b>a:
        t=b
        b=a
        a=t
    a1=a
    b1=b
    while b1>0:
        r=a1%b1
        a1=b1
        b1=r
    a//=a1
    a*=b
    return a
N=int(input())
T=[int(input()) for i in range(N)]
if N==1:
    print (T[0])
else:
    m=gcd(T[0],T[1])
    i=2
    while i <N:
        m=gcd(m,T[i])
        i+=1
    print(m)

Buggy python submission (verdict: Runtime Error):
# your code goes here
def gcd(a,b):
    if b>a:
        t=b
        b=a
        a=t
    while b>0:
        r=a%b
        a=b
        b=r
    return a
N=int(input())
T=[int(input()) for i in range(N)]
g=gcd(T[0],T[1])
for i in range(1,N-1):
    g=gcd(T[i],g)
M=g
for i in range(N):
    M*=T[i]//g
print(M)

Fixed submission:
# your code goes here
def gcd(a,b):
    if b>a:
        t=b
        b=a
        a=t
    a1=a
    b1=b
    while b1>0:
        r=a1%b1
        a1=b1
        b1=r
    a//=a1
    a*=b
    return a
N=int(input())
T=[int(input()) for i in range(N)]
if N==1:
    print (T[0])
else:
    m=gcd(T[0],T[1])
    i=2
    while i <N:
        m=gcd(m,T[i])
        i+=1
    print(m)
Buggy python submission (verdict: Runtime Error):
N=int(input())
a=[int(i) for i in input(). split ()]
mi=a[0]
ma=a[0]
while i<N:
    if a[i]>ma:
        ma=a[i]
    if a[i]<mi:
        mi=a[i]
    i+=1
print (ma-mi)

Fixed submission:
N=int(input())
a=[int(i) for i in input(). split ()]
mi=a[0]
ma=a[0]
i=0
while i<N:
    if a[i]>ma:
        ma=a[i]
    if a[i]<mi:
        mi=a[i]
    i+=1
print (ma-mi)

Buggy python submission (verdict: Runtime Error):
N=int(input())
a=[int(i) for i in input(). split ()]
mi=a[i]
ma=a[i]
while i<N:
    if a[i]>ma:
        ma=a[i]
    if a[i]<mi:
        mi=a[i]
    i+=1
print (ma-mi)

Fixed submission:
N=int(input())
a=[int(i) for i in input(). split ()]
mi=a[0]
ma=a[0]
i=0
while i<N:
    if a[i]>ma:
        ma=a[i]
    if a[i]<mi:
        mi=a[i]
    i+=1
print (ma-mi)
Buggy python submission (verdict: Runtime Error):
S=list(input())
sorted(S)
nd=0
while nd==0 and i<len(S):
    if S[i]==S[i+1]:
         nd=1
    i+=1
if nd==1:
    print ("no")
else:
    print ("yes")
        
    

Fixed submission:
S=list(input())
S.sort()
nd=0
i=0
while nd==0 and i<len(S)-1:
    if S[i]==S[i+1]:
         nd=1
    i+=1
if nd==1:
    print ("no")
else:
    print ("yes")
Buggy python submission (verdict: Runtime Error):
so=input()
se=input()
sol=list(so)
sel=list(se)
i=0
while i<len(sol) or i<len(sel):
    s.append(sol[i])
    s.append(sel[i])
    i=i+1
print "".join(s)

Fixed submission:
a,b,c=(int(i) for i in input().split())
if b-a==c-b:
    print("YES")
else:
    print("NO")

Buggy python submission (verdict: Runtime Error):
s=[int(input()) for i in range(3)]
a=0
if i[1]-i[0]==i[2]-i[1]:
    print("YES")
else:
    print("NO")

Fixed submission:
a,b,c=(int(i) for i in input().split())
if b-a==c-b:
    print("YES")
else:
    print("NO")
Buggy python submission (verdict: Runtime Error):
data = input().split()
A = int(data[0])
B = int(data[1])
S = input()
s1 = S[:A]
s2 = S[A:A+1]
s3= S[len(S)-B:]
if s1.isdigit() == True:
    if s2 == "-":
        if s3.isdigit() == True:
            print("Yes")
        else : 
            print("No")
    else:
        print("No")
else :
    print("No")

Fixed submission:
M = int(input())
print(48 - M)
Buggy python submission (verdict: Runtime Error):
A= int(input())
B = int(input())
S = input()
s1 = S[:A]
s2 = S[A:A+1]
s3= S[len(S)-B:]
if s1.isdigit() == True:
    if s2 == "-":
        if s3.isdigit() == True:
            print("Yes")
        else : 
            print("No")
    else:
        print("No")
else :
    print("No")

Fixed submission:
data = input().split()
A = int(data[0])
B = int(data[1])
S = input()
s1 = S[:A]
s2 = S[A:A+1]
s3= S[len(S)-B:]
if s1.isdigit() == True:
    if s2 == "-":
        if s3.isdigit() == True:
            print("Yes")
        else : 
            print("No")
    else:
        print("No")
else :
    print("No")
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
# 整数の入力
a = int(raw_input())
print str(48-a)

Fixed submission:
# -*- coding: utf-8 -*-
# 整数の入力
a = int(raw_input())
print str(48-a)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
a, b = map(int, raw_input().split())
s = raw_input()
ok = False
if len(s) == (a+b+1):
  n = s.count('-')
  if n = 1:
    x,y = map(str, s.split('-'))
    if len(x) == a:
      if len(y) == b:
        ok = True

if ok:
  print 'Yes'
else:
  print 'No'

Fixed submission:
# -*- coding: utf-8 -*-
a, b = map(int, raw_input().split())
s = raw_input()
ok = False
if len(s) == (a+b+1):
  n = s.count('-')
  if n == 1:
    x,y = map(str, s.split('-'))
    if len(x) == a:
      if len(y) == b:
        ok = True

if ok:
  print 'Yes'
else:
  print 'No'

Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
a, b = map(int, raw_input().split())
s = raw_input()
ok = False
if len(s) == (a+b+1):
  n = s.count('-')
  if n <= 1:
    x,y = map(str, s.split('-'))
    if len(x) == a:
      if len(y) == b:
        ok = True

if ok:
  print 'Yes'
else:
  print 'No'

Fixed submission:
# -*- coding: utf-8 -*-
a, b = map(int, raw_input().split())
s = raw_input()
ok = False
if len(s) == (a+b+1):
  n = s.count('-')
  if n == 1:
    x,y = map(str, s.split('-'))
    if len(x) == a:
      if len(y) == b:
        ok = True

if ok:
  print 'Yes'
else:
  print 'No'

Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
a, b = map(int, raw_input().split())
s = raw_input()
ok = False
if len(s) == (a+b+1):
  x,y = map(str, s.split('-'))
  if len(x) == a:
    if len(y) == b:
      print ok

Fixed submission:
# -*- coding: utf-8 -*-
a, b = map(int, raw_input().split())
s = raw_input()
ok = False
if len(s) == (a+b+1):
  n = s.count('-')
  if n == 1:
    x,y = map(str, s.split('-'))
    if len(x) == a:
      if len(y) == b:
        ok = True

if ok:
  print 'Yes'
else:
  print 'No'