Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
H, W = list(map(int, input().split()))
Hs = [[0] * W for i in range(H)]
Vs = [[0] * W for i in range(H)]

Ss = [0] * H
for i in range(H):
    Ss[i] = input()

# 横
for i in range(H):
    s = 0
    e = 0
    c = 0
    for k in range(W):
        if Ss[i][k] == ".":
            c += 1
        else:
            e = k
            for m in range(e - s):
                Hs[i][s + m] = c
            s = e + 1
            c = 0
    e = W
    for m in range(e - s):
        Hs[i][s + m] = c
# 縦
for i in range(W):
    s = 0
    e = 0
    c = 0
    for k in range(H):
        if Ss[k][i] == ".":
            c += 1
        else:
            e = k
            for m in range(e - s):
                Vs[s + m][i] = c
            s = e + 1
            c = 0
    e = H
    for m in range(e - s):
        Vs[s + m][i] = c

maxv = 0
for i in range(H):
    for k in range(W):
        t = Hs[i][k] + Vs[i][k] - 1
        if t > maxv:
            maxv = t
print(maxv)

Fixed submission:
H, W = list(map(int, input().split()))
Hs = [[0] * W for i in range(H)]
Vs = [[0] * W for i in range(H)]
 
Ss = [0] * H
for i in range(H):
    Ss[i] = input()
 
for i in range(H):
    s = 0
    e = 0
    c = 0
    for k in range(W):
        if Ss[i][k] == ".":
            c += 1
        else:
            e = k
            for m in range(e - s):
                Hs[i][s + m] = c
            s = e + 1
            c = 0
    e = W
    for m in range(e - s):
        Hs[i][s + m] = c
# 縦
for i in range(W):
    s = 0
    e = 0
    c = 0
    for k in range(H):
        if Ss[k][i] == ".":
            c += 1
        else:
            e = k
            for m in range(e - s):
                Vs[s + m][i] = c
            s = e + 1
            c = 0
    e = H
    for m in range(e - s):
        Vs[s + m][i] = c
 
maxv = 0
for i in range(H):
    for k in range(W):
        t = Hs[i][k] + Vs[i][k] - 1
        if t > maxv:
            maxv = t
print(maxv)
Buggy python submission (verdict: Runtime Error):
N, K = list(map(int, input().split()))
Vs = list(map(int, input().split()))
Length = len(Vs)

maxv = 0

for i in range(K):
    if K // 2 >= i:
        count = K - i
        for hoge in range(count):
            left = count
            right = 0
            for m in range(count):
                temp = sorted(Vs[:left] + Vs[Length - right:])
                for o in range(i):
                    temp.pop(0)
                sumv = sum(temp)
                left -= 1
                right += 1
                if sumv > maxv:
                    maxv = sumv

print(maxv)

Fixed submission:
N, K = list(map(int, input().split()))
Vs = list(map(int, input().split()))
Length = len(Vs)
maxv = 0
for i in range(K + 1):
    count = K - i
    left = count
    right = 0
    for m in range(count + 1):
        if 0 <= left <= Length and 0 <= right <= Length:
            for p in range(i + 1):
                temp = sorted(Vs[:left] + Vs[Length - right:])
                for o in range(p):
                    if temp:
                        temp.pop(0)
                    else:
                        break
                sumv = sum(temp)
                if sumv > maxv:
                    maxv = sumv
            left -= 1
            right += 1

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

Ls = [0] * M
Rs = [0] * M

for i in range(M):
    Ls[i], Rs[i] = list(map(int, input().split()))

count = 0
for i in range(N):
    judge = True
    for k in range(M):
        L = Ls[k]
        R = Rs[k]
        if not (L <= i + 1 <= R):
            judge = False
    if judge:
        count += 1
print(count)


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

maxvL = 0
minvR = 1000000
for i in range(M):
    L, R = list(map(int, input().split()))
    if maxvL < L:
        maxvL = L
    if minvR > R:
        minvR = R

count = 0
for i in range(N):
    if maxvL <= i + 1 <= minvR:
        count += 1
print(count)
Buggy python submission (verdict: Time Limit Exceeded):
R, G, B, N = list(map(int, input().split()))

count = 0

len_r = N // R + 2
len_g = N // G + 2
for ix in range(len_r):
    for iy in range(len_g):
        sum = N - (R * ix + G * iy)
        if sum >= 0 and sum % B == 0:
            count += 1
        if R * ix + G + iy > N:
            break

print(count)

Fixed submission:
R, G, B, N = list(map(int, input().split()))

count = 0

len_r = N // R + 2
for ix in range(len_r):
    len_g = (N - (R * ix)) // G + 2
    for iy in range(len_g):
        t = N - (R * ix + G * iy)
        if t >= 0 and t % B == 0:
            count += 1
print(count)

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

sum = 0
count = 0

len_R = N // R + 1
len_G = N // G + 1
len_B = N // B + 1

for ix in range(N // R + 2):
    for iy in range(N // G + 2):
        sum = N - (R * ix + G * iy)
        if sum >= 0 and sum % B == 0:
            count += 1
        if R * ix + G + iy > N:
            break
    if R * ix > N:
        break

print(count)

Fixed submission:
R, G, B, N = list(map(int, input().split()))

count = 0

len_r = N // R + 2
for ix in range(len_r):
    len_g = (N - (R * ix)) // G + 2
    for iy in range(len_g):
        t = N - (R * ix + G * iy)
        if t >= 0 and t % B == 0:
            count += 1
print(count)

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

sum = 0
count = 0

len_R = N // R + 1
len_G = N // G + 1
len_B = N // B + 1

for ix in range(N // R + 2):
    for iy in range(N // G + 2):
        sum = N - (R * ix + G * iy)
        if sum % B == 0:
            if sum / B >= 0:
                count += 1
        sum = R * ix + G + iy
        if sum > N:
            break
    sum = R * ix
    if sum > N:
        break

print(count)

Fixed submission:
R, G, B, N = list(map(int, input().split()))

count = 0

len_r = N // R + 2
for ix in range(len_r):
    len_g = (N - (R * ix)) // G + 2
    for iy in range(len_g):
        t = N - (R * ix + G * iy)
        if t >= 0 and t % B == 0:
            count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
s = list(input())
t = list(input())

s.sort()
t.sort()
t.reverse()

result = ""
for i in range(len(s)):
    if s[i] < t[i]:
        result = "Yes"
        break

if result == "":
    result = "No"

print(result)

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

s.sort()
t.sort()
t.reverse()

size = min(len(s), len(t))
result = ""

for i in range(size):
    if s[i] < t[i]:
        result = "Yes"
        break

if result == "":
    if s[0:size] == t[0:size]:
        if len(s) < len(t):
            result = "Yes"
        else:
            result = "No"
    else:
        result = "No"

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



argv=sys.argv

if argv[2] == "+":
    print(int(argv[1]) + int(argv[3]))
elif argv[2] =="-":
    print(int(argv[1]) - int(argv[3]))

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


if argv[1] == "+":
    print(int(argv[0]) + int(argv[2]))
elif argv[1] =="-":
    print(int(argv[0]) - int(argv[2]))
Buggy python submission (verdict: Runtime Error):
import math

n=int(input())

res=1
for _ in range(n):
    x=int(input())
    res=res//math.gcd(res,x)*x
print(res)


Fixed submission:
#from math import gcd
from fractions import gcd

n=int(input())

res=1
for _ in range(n):
    x=int(input())
    res=res//gcd(res,x)*x
print(res)
Buggy python submission (verdict: Time Limit Exceeded):
from queue import Queue

INF=float('inf')

n=int(input())
g=[[] for _ in range(n)]
for _ in range(n-1):
    u,v,w=map(int,input().split())
    g[u-1].append((v-1,w))
    g[v-1].append((u-1,w))

q,k=map(int,input().split())
ds=[INF]*n
que=Queue()
que.put((k-1,0))
while not que.empty():
    u,d=que.get()
    if ds[u] != INF:
        continue
    ds[u]=d
    for v,w in g[u]:
        que.put((v,d+w))

for _ in range(q):
    u,v=map(int,input().split())
    print(ds[u-1]+ds[v-1])


Fixed submission:
from queue import Queue

INF=float('inf')

n=int(input())
g=[[] for _ in range(n)]
for _ in range(n-1):
    u,v,w=map(int,input().split())
    g[u-1].append((v-1,w))
    g[v-1].append((u-1,w))

q,k=map(int,input().split())
ds=[INF]*n
ds[k-1]=0
que=Queue()
que.put((k-1,0))
while not que.empty():
    u,d=que.get()
    for v,w in g[u]:
        if ds[v]==INF:
            ds[v]=d+w
            que.put((v,d+w))

for _ in range(q):
    u,v=map(int,input().split())
    print(ds[u-1]+ds[v-1])

Buggy python submission (verdict: Time Limit Exceeded):
from queue import Queue

INF=float('inf')

n=int(input())
g=[[] for _ in range(n)]
for _ in range(n-1):
    u,v,w=map(int,input().split())
    g[u-1].append((v-1,w))
    g[v-1].append((u-1,w))

q,k=map(int,input().split())
ds=[INF]*n
que=Queue()
que.put((k-1,0))
while not que.empty():
    u,d=que.get()
    if ds[u] != INF:
        continue
    ds[u]=d
    for v,w in g[u]:
        que.put((v,d+w))

for _ in range(q):
    u,v=map(int,input().split())
    print(ds[u-1]+ds[v-1])


Fixed submission:
from queue import Queue

INF=float('inf')

n=int(input())
g=[[] for _ in range(n)]
for _ in range(n-1):
    u,v,w=map(int,input().split())
    g[u-1].append((v-1,w))
    g[v-1].append((u-1,w))

q,k=map(int,input().split())
ds=[INF]*n
ds[k-1]=0
que=Queue()
que.put((k-1,0))
while not que.empty():
    u,d=que.get()
    for v,w in g[u]:
        if ds[v]==INF:
            ds[v]=d+w
            que.put((v,d+w))

for _ in range(q):
    u,v=map(int,input().split())
    print(ds[u-1]+ds[v-1])
Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input().split())
print((a * b / (a + b)))


Fixed submission:
a, b = map(int, input().split())
print((a * b / (a + b)))
Buggy python submission (verdict: Time Limit Exceeded):
s = int(input())
x1=0
y1=0
x2=0
y2=0
x3=0
y3=0
# x2y3-y2x3=s
cnt=0
i=0
while(1):
    cnt=i*i
    if cnt>s: break
    i+=1
x2=i-1
y3=i-1
y2=-1
x3=s-(i-1)**2
print(x1+1,y1+1,x2+1,y2+1,x3+1,y3+1)


Fixed submission:
import math
s = int(input())
x1=0
y1=0
x2=0
y2=0
x3=0
y3=0
i=math.ceil(s**(1/2))
x2=i
y3=i
y2=1
x3=(i)**2-s
print(x1,y1,x2,y2,x3,y3)
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
if (a <= b):
    print(a)
else:
    print(a-1

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

Buggy python submission (verdict: Runtime Error):
a, b = input().split()
if (a <= b):
    print(a)
else:
    print(a-1)

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

Buggy python submission (verdict: Runtime Error):
a, b = (map(int, input().split()))
if (a <= b):
    print(a)
else:
    print(a-1

Fixed submission:
a, b = map(int, input().split())
if (a <= b):
    print(a)
else:
    print(a-1)
Buggy python submission (verdict: Runtime Error):
a = int(input())
s = input()

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


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

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

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

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


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

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

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

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


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

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

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

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

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

if a>=3200:
	print(s)
else :
	print("red")
Buggy python submission (verdict: Runtime Error):
a,b= map(int(input()).split())
if (a*b)%2==0:
  print("Even")
else :
  print("Odd")


Fixed submission:
a,b= map(int, (input()).split())
if (a*b)%2==0:
  print("Even")
else :
  print("Odd")

Buggy python submission (verdict: Runtime Error):
a,b= int(input( )).split()
if (a*b)%2=0:
  print("Even")
else :
  print("Odd")


Fixed submission:
a,b= map(int, (input()).split())
if (a*b)%2==0:
  print("Even")
else :
  print("Odd")

Buggy python submission (verdict: Runtime Error):
a,b= int(input()).split()
if (a*b)%2=0:
  print("Even")
else :
  print("Odd")

Fixed submission:
a,b= map(int, (input()).split())
if (a*b)%2==0:
  print("Even")
else :
  print("Odd")
Buggy python submission (verdict: Runtime Error):
import Foundation

class Node{
    var next:[Node]=[]
    var ten:Int=0
    init() {
    }
    func plus(xs:Int){
        self.ten += xs
        if !self.next.isEmpty{
           // print("!self.next.isEmpty :",!self.next.isEmpty)
            for i in 0...self.next.count-1{
              //  print("i:",i)
                self.next[i].plus(xs:xs)
            }
        }
    }
}

func readInts(by separator: Character = " ") -> [Int] {
    return readLine()!.split(separator:separator).map { Int($0)! }
}

let n:[Int] = readInts()

var node:[Node]=[]

for i in 1...n[0]{
    node.append(Node())
}

for i in 1...n[0]-1{
    let a:[Int]=readInts()
    //print("a:",a)
    node[a[0]-1].next.append(node[a[1]-1])
   // print(node[a[0]-1].next)
}

for i in 1...n[1]{
    let p:[Int]=readInts()
  //  print("p:",p)
    node[p[0]-1].plus(xs:p[1])
}

node.map{print(($0).ten)}
    



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

if a >= 3200:
    print(s)
else:
    print("red")
Buggy python submission (verdict: Runtime Error):
n = int(input())

a=[int(x) for x in input().split()]

b=0
for i in range(n):
   b = b + 1/a[i]
b=1/b
print(b)



Fixed submission:
n = int(input())

a=[int(x) for x in input().split()]

b=0
for i in range(n):
   b = b + 1/a[i]
b=1/b
print(b)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a=[]
for i in range(n):
    a.append(int(input()))
b=0
for i in range(n):
   b = b + 1/a[i]
b=1/b
print(b)



Fixed submission:
n = int(input())

a=[int(x) for x in input().split()]

b=0
for i in range(n):
   b = b + 1/a[i]
b=1/b
print(b)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a=[]
for i in range(n):
    a.append(int(input()))
b=0
for i in range(n):
   b = b + 1/a[i]
b=1/b
print(b)



Fixed submission:
n = int(input())

a=[int(x) for x in input().split()]

b=0
for i in range(n):
   b = b + 1/a[i]
b=1/b
print(b)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a=[]
for i in range(n):
    a.append(int(input()))
b=0
for i in range(n):
   b = b + 1/a[i]
b=1/b
print(b)



Fixed submission:
n = int(input())

a=[int(x) for x in input().split()]

b=0
for i in range(n):
   b = b + 1/a[i]
b=1/b
print(b)
Buggy python submission (verdict: Runtime Error):
a = input()
b = input()
c = input()

print(int(a)*int(b)/2)


Fixed submission:
AB,BC,CA = map(int,input().split())
print(int(AB*BC/2))

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

print(int(a)*int(b)/2)


Fixed submission:
AB,BC,CA = map(int,input().split())
print(int(AB*BC/2))

Buggy python submission (verdict: Runtime Error):
a = input("a:")
b = input("b:")
c = input("c:")

print(int(int(a)*int(b)/2))


Fixed submission:
AB,BC,CA = map(int,input().split())
print(int(AB*BC/2))

Buggy python submission (verdict: Runtime Error):
a = input("a:")
b = input("b:")
c = input("c:")

print(int(int(a)*int(b)/2))


Fixed submission:
AB,BC,CA = map(int,input().split())
print(int(AB*BC/2))

Buggy python submission (verdict: Runtime Error):
a = input("a:")
b = input("b:")
c = input("c:")

print(int(int(a)*int(b)/2))


Fixed submission:
AB,BC,CA = map(int,input().split())
print(int(AB*BC/2))
Buggy python submission (verdict: Runtime Error):

n=int(input())
a=[]
a.append(2)
k=2
for i in range(55):
    while k < 55555 :
        k += 1
        b=k
        for j in a:
            if k%j==0:
                b=0
    
        if b==k:
            a.append(k)
            break
 
ans=[]
for j in range(len(a)):
    if len(ans) < n:
        if a[j] % 5 == 1:
            ans.append(a[j])
            
            
print(*ans)

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

if a > b:
    a -= 1
print(a)

Buggy python submission (verdict: Runtime Error):

a,b=map(int,input().split())
x=[0,0,-1,1]
y=[-1,1,0,0]
d=[[0]*a for x in range(b)]
for i in range(b):
    d[i]=list(input())
    
result="Yes"

for i in range(b):
    for j in range(a):
        if d[i][j] == '#':
            check=0
            for xv,yv in zip(x,y):
                if 0 <= xv + j < a  and 0 <= yv + i < b:
                    if d[i+yv][j+xv] == '#':
                        check=1
                        #break
        
            if check==0:
                result="No"
                #break
            
                        
print(result)


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

if a > b:
    a -= 1
print(a)
Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
k = int(input())
m = 0
o = 0


for n in range(0,100):
    if a%(100-n) == b%(100-n) == 0:
        m += 1
        o = 100-n
    if m == k:
        break


print(o)

Fixed submission:
a,b,k = (int(x) for x in input().split())
m = 0
o = 0


for n in range(0,100):
    if a%(100-n) == b%(100-n) == 0:
        m += 1
        o = 100-n
    if m == k:
        break


print(o)
Buggy python submission (verdict: Runtime Error):
l, r = map(int, input().split())
l, r = l%2019, r%2019
mi = 9999
if r*(r-1)<2019:
    print(l*(l+1))
elif r==0 or l==0:
    print(0)
else:
    for i in range(l, r-1):
        for j in range(i+1, r):
            if (i/3).is_integer() and (j/673).is_integer():
                mi = (i/3)*((i/3)+1)
            elif (i/673).is_integer() and (j/3).is_integer():
                mi = (i/673)*((i/673)+1)
            else:
                mi = min(mi, (i*j)%2019)
    print(mi)

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

Buggy python submission (verdict: Runtime Error):
l, r = map(int, input().split())
l, r = l%2019, r%2019
mi = 9999
if r*(r-1)<2019:
    print(l*(l+1))
elif r==0 or l==0:
    print(0)
else:
    for i in range(l, r-1):
        for j in range(i+1, r):
            if (i/3).is_integer() and (j/673).is_integer():
                print((i/3)*((i/3)+1))
            elif (i/673).is_integer() and (j/3).is_integer():
                print((i/673)*((i/673)+1))
            else:
                mi = min(mi, (i*j)%2019)
    print(mi)  

Fixed submission:
n, a, b = map(int, input().split())
print(min(a*n, b))
Buggy python submission (verdict: Runtime Error):
import math
a, b, c, d = map(int, input().split())
cd = c*d//math.gcd(c, d)

print(b-(b//c+b//d-b//cd) - ((a-1)-((a-1)//c+(a-1)//d-(a-1)//cd)))

Fixed submission:
from fractions import gcd
a, b, c, d = map(int, input().split())
cd = c*d//gcd(c, d)

print(b-(b//c+b//d-b//cd) - ((a-1)-((a-1)//c+(a-1)//d-(a-1)//cd)))
Buggy python submission (verdict: Runtime Error):
n,x = map(int, input().split())
l = list(map(int, input().split()))
cnt = 1

for i in range(2,n+2):
  if sum(l[:i-1]) <= x:
    cnt += 1
    
print(cnt)

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

if x < a:
  print(0)
else:
  print(10)
Buggy python submission (verdict: Time Limit Exceeded):
n,k = map(int, input().split())
h = list(map(int, input().split()))

dp = [-1]*(n+1)
dp[0] = 0

for i in range(n-1):
  for j in range(1,k+1):
    if i+j==n:
      break
    if dp[i+j] == -1:
      dp[i+j] = dp[i] + abs(h[i]-h[i+j])
    else:
      dp[i+j] = min(dp[i+j], dp[i] + abs(h[i]-h[i+j]))
  
print(dp[n-1])

Fixed submission:
n,k = map(int, input().split())
h = list(map(int, input().split()))

dp = [0]*(n)
dp[0] = 0

for i in range(1, n):
  j = max(0, i-k)
  dp[i] = min([dpk + abs(h[i]-hk) for dpk, hk in zip(dp[j:i], h[j:i])])
  
print(dp[n-1])

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

dp = [10**10]*(n+1)
dp[0] = 0

for i in range(n):
  for j in range(1,k+1):
    if i+j==n:
      break
    dp[i+j] = min(dp[i+j], dp[i] + abs(h[i]-h[i+j]))
  print(dp)
  
print(dp[n-1])

Fixed submission:
n,k = map(int, input().split())
h = list(map(int, input().split()))

dp = [0]*(n)
dp[0] = 0

for i in range(1, n):
  j = max(0, i-k)
  dp[i] = min([dpk + abs(h[i]-hk) for dpk, hk in zip(dp[j:i], h[j:i])])
  
print(dp[n-1])
Buggy python submission (verdict: Runtime Error):
dp = [[0]*3 for i in range(n)]
dp[0] = abc[0]

for i in range(1,n):
    dp[i][0] = max(dp[i][1:3]) + abc[i][0]
    dp[i][1] = max(dp[i][0], dp[i][2]) + abc[i][1]
    dp[i][2] = max(dp[i][0:2]) + abc[i][2]
max(dp[n-1])

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

dp = [[0]*3 for i in range(n)]
dp[0] = abc[0]

for i in range(1,n):
    dp[i][0] = max(dp[i-1][1:3]) + abc[i][0]
    dp[i][1] = max(dp[i-1][0], dp[i-1][2]) + abc[i][1]
    dp[i][2] = max(dp[i-1][0:2]) + abc[i][2]
print(max(dp[n-1]))
Buggy python submission (verdict: Runtime Error):
#include<stdio.h>
main(void)
{
    int a,b,c;
    scanf("%d,%d,%d", &a,&b,&c);
    if(a + b >= c){
        printf("Yes");
    } else {
        printf("No");
    }
}


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

if (int(a) + int(b) >= int(c)):
    print ('Yes')
else:
    print ('No')

Buggy python submission (verdict: Runtime Error):
a,b,c = input(),input(),input()

if (int(a) + int(b) >= int(c)):
    print ('Yes')
else:
    print ('No')

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

if (int(a) + int(b) >= int(c)):
    print ('Yes')
else:
    print ('No')

Buggy python submission (verdict: Runtime Error):
print ('A B C = ?')
a,b,c = input(),input(),input()

if (int(a) + int(b) >= int(c)):
    print ('Yes')
else:
    print ('No')

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

if (int(a) + int(b) >= int(c)):
    print ('Yes')
else:
    print ('No')

Buggy python submission (verdict: Runtime Error):
print ('A B C = ?')
a,b,c = input(),input(),input()

if (a + b >= c):
    print ('Yes')
else:
    print ('No')


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

if (int(a) + int(b) >= int(c)):
    print ('Yes')
else:
    print ('No')

Buggy python submission (verdict: Runtime Error):
print ('A B C = ?')
a,b,c = input(),input(),input()

if (a + b >= c):
    print ('Yes')
else:
    print ('No')

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

if (int(a) + int(b) >= int(c)):
    print ('Yes')
else:
    print ('No')
Buggy python submission (verdict: Runtime Error):
from bisect import *
n = int(input())
abc = [sorted(list(map(int, input().split()))) for i in range(3)]
print(sum([bisect.bisect_left(abc[0], b)*(n-bisect.bisect_right(abc[2], b)) for b in abc[1]]))

Fixed submission:
import bisect
n = int(input())
abc = [sorted(list(map(int, input().split()))) for i in range(3)]
print(sum([bisect.bisect_left(abc[0], b)*(n-bisect.bisect_right(abc[2], b)) for b in abc[1]]))

Buggy python submission (verdict: Runtime Error):
import bisect
import numpy as np
n = int(input())
abc = [sorted(list(map(int, input().split()))) for i in range(3)]

unko = np.zeros(n)
for c in abc[2]:
  unko[:bisect.bisect_left(abc[1], c)] += 1
s = 0

print()
for i in range(len(abc[1])):
  s += bisect.bisect_left(abc[0], abc[1][i])*unko[i]
  
print(int(s))

Fixed submission:
import bisect
n = int(input())
abc = [sorted(list(map(int, input().split()))) for i in range(3)]
print(sum([bisect.bisect_left(abc[0], b)*(n-bisect.bisect_right(abc[2], b)) for b in abc[1]]))

Buggy python submission (verdict: Time Limit Exceeded):
import bisect
import numpy as np
n = int(input())
abc = [sorted(list(map(int, input().split()))) for i in range(3)]

unko = np.zeros(n)
for c in abc[2]:
  unko[:bisect.bisect_left(abc[1], c)] += 1
s = 0
for i,b in enumerate(abc[1]):
  s += bisect.bisect_left(abc[0], b)*unko[i]
  
print(int(s))

Fixed submission:
import bisect
n = int(input())
abc = [sorted(list(map(int, input().split()))) for i in range(3)]
print(sum([bisect.bisect_left(abc[0], b)*(n-bisect.bisect_right(abc[2], b)) for b in abc[1]]))
Buggy python submission (verdict: Time Limit Exceeded):
a, b, x = map(int, input().split())
print(sum([1 if i%x==0 else 0 for i in range(a, b+1)]))

Fixed submission:
a, b, x = map(int, input().split())
print(int(b//x) - int((a-1)//x))