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

Fixed submission:
# -*- coding: utf-8 -*-
from copy import deepcopy


def main():
    problems = int(input())
    solve_times = [int(e) for e in input().split()]
    drinks = int(input())

    for i in range(drinks):
        solve_times_copy = deepcopy(solve_times)
        problem_idx, solve_time = [int(e) for e in input().split()]
        problem_idx -= 1
        solve_times_copy[problem_idx] = solve_time
        print(sum(solve_times_copy))


main()

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
from copy import deepcopy


def main():
    problems = int(input())
    solve_times = [int(e) for e in input().split()]
    drinks = int(input())

    for i in range(drinks):
        solve_times_copy = deepcopy(solve_times_copy)
        problem_idx, solve_time = [int(e) for e in input().split()]
        problem_idx -= 1
        solve_times_copy[problem_idx] = solve_time
        print(sum(solve_times_copy))


main()

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
from copy import deepcopy


def main():
    problems = int(input())
    solve_times = [int(e) for e in input().split()]
    drinks = int(input())

    for i in range(drinks):
        solve_times_copy = deepcopy(solve_times_copy)
        problem_idx, solve_time = [int(e) for e in input().split()]
        problem_idx -= 1
        solve_times_copy[problem_idx] = solve_time
        print(sum(solve_times_copy))


print(main())
Problem p04030 (python)

Fixed submission:
# -*- coding: utf-8 -*-

def list_n():
    return [int(e) for e in input().split()]


def list_s():
    return [s for e in input().split()]


def main(s):
    ret = []
    for c in s:
        if c in ['0', '1']:
            ret.append(c)
        else:
            if ret:
                ret.pop()
    return ''.join(ret)


if __name__ == '__main__':
    s = input()
    print(main(s))

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-

def list_n():
    return [int(e) for e in input().split()]


def list_s():
    return [s for e in input().split()]


def main(s):
    ret = []
    for c in s:
        if c in ['0', '1']:
            ret.append(c)
        else:
            if c:
                ret.pop()
    return ''.join(ret)


if __name__ == '__main__':
    s = input()
    print(main(s))
Problem p03760 (python)

Fixed submission:
O = list(input())
E = list(input())
password = []
if len(O) - len(E) == 0:
    for i in range(len(O)):
        password.append(O[i])
        password.append(E[i])
elif len(O) - len(E) == 1:
    for i in range(len(E)):
        password.append(O[i])
        password.append(E[i])
    password.append(O[len(O)-1])
password = "".join(password)

print(password)

Buggy submission (verdict: Runtime Error):
O = list(input())
E = list(input())
password = []
if len(O) - len(E) == 0:
    for i in range(len(O)):
        password.append(O[i])
        password.append(E[i])
elif len(O) - len(E) == 1:
    for i in range(len(E)):
        password.append(O[i])
        password.append(E[i])
    password.append(O[len(O)])
password = "".join(password)

print(password)
Problem p03761 (python)

Fixed submission:
from collections import Counter
n = int(input())
if n == 1:
    s0 = list(input())
    s0.sort()
    print("".join(s0))
else:
    s0 = list(input())
    s1 = list(input())
    match = list((Counter(s0) & Counter(s1)).elements())
    for i in range(n-2):
        s = list(input())
        match = list((Counter(match) & Counter(s)).elements())
    match.sort()
    print("".join(match))

Buggy submission (verdict: Runtime Error):
from collections import Counter
n = int(input())
s0 = list(input())
s1 = list(input())
match = list((Counter(s0) & Counter(s1)).elements())
for i in range(n-2):
    s = list(input())
    match = list((Counter(match) & Counter(s)).elements())
match.sort()
print("".join(match))
Problem p03992 (python)

Fixed submission:
s = input()
output=""
for i in range(4):
    output +=s[i]
output += " "
for i in range(8):
    output +=s[i+4]
print(output)

Buggy submission (verdict: Runtime Error):
number = int(input())
a = list(map(int,input().split()))
count = 0
for i in range(number):
    for j in range(i,number):
        if a[i] ==j+1 and a[j] == i+1:
            count += 1
print(int(count))
Problem p03993 (python)

Fixed submission:
number = int(input())
a = list(map(int,input().split()))
count = 0
for i in range(number):
    j = a[i]-1
    if a[j] == i + 1:
        count += 1
print(int(count/2))

Buggy submission (verdict: Runtime Error):
number = int(input())
a = list(map(int,input().split()))
count = 0
for i in range(number):
    for j in range(number):
        if a[i] ==j+1 and a[j] == i+1:
            count += 1
print(int(count/2)
Problem p03795 (python)

Fixed submission:
N = int(input())
discount = 0
if N > 15:
    discount = N // 15
print(N * 800 - discount * 200)

Buggy submission (verdict: Runtime Error):
N = int(input())
if N > 15:
    discount = N // 15
print(N * 800 - discount * 200)
Problem p03779 (python)

Fixed submission:
import math
X = int(input())
n = int(math.sqrt(2*X) -2)

def sum(a):
    return a*(a+1)/2

result = 0

for i in range(n,X+1):
    if sum(i)>= X:
        result = i
        break

print(result)

Buggy submission (verdict: Runtime Error):
import math
X = int(input())
n = math.sqrt(2*X) -1

def sum(a):
    x = 0
    for i in range(a+1):
        x += i
    return x

for i in range(n,X+1):
    if sum(i)>= X:
        result = i
        break

print(result)
Problem p04033 (python)

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

if((a<0 and b>0) or a==0 or b==0):
    print("Zero")
elif(a>0):
    print("Positive")
else:
    if((((a-b)*-1)+1)%2==1):
        print("Negative")
    else:
        print("Positive")

Buggy submission (verdict: Runtime Error):
a,b = map(int,raw_input().split())
sum=1
if((a<0 and b>0) or a==0 or b==0):
    print("Zero")
elif(a>0):
    print("Positive")
else:
    for i in range(a,b+1):
        sum*=i
    if(sum>0):
        print("Positive")
    else:
        print("Negative")

Buggy submission (verdict: Runtime Error):
a,b = map(int,raw_input().split())
sum=1
if((a<0 and b>0) or a==0 or b==0):
    print("Zero")
else:
    for i in range(a,b+1):
        sum*=i
    if(sum>0):
        print("Positive")
    else:
        print("Negative")

Buggy submission (verdict: Runtime Error):
a,b = map(int,raw_input().split())
sum=1
for i in range(a,b+1):
    sum*=i
if(sum>0):
    print("Positive")
elif(sum==0):
    print("Zero")
else:
    print("Negative")
Problem p03729 (python)

Fixed submission:
# coding: utf-8 
array = input().split(" ")
flag = True
for i,s in enumerate(array[:(len(array)-1)]):
    if s[-1] != array[i+1][0]:
        flag = False
if flag is True:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
# coding: utf-8 
N,T = [int(i) for i in input().split(" ")]
array = input().split(" ")
ans = 0
fin = 0
for x in array:
    time = int(x)
    if time <= fin:
        ans += (time + T - fin)
    else:
        ans += T
    fin = time + T
print(ans)
Problem p03729 (python)

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

if a[len(a)-1] == b[0] and b[len(b)-1] == c[0]:
    print('YES')
else:
    print('NO')

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

if a[len(a)-1] == b[0] and b[len(b)-1] == c[0]:
    print('YES')
else:
    print(ans)

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

if a[len(a)-1] == b[0] and b[len(b)-1] == c[0]]:
    print('YES')
else:
    print(ans)

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

if a[len(a)-1] == b[0] and b[len(b)-1 == c[0]]:
    print('YES')
else:
    print(ans)

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

if a[len(a)-1] == b[0] and if b[len(b)-1 == c[0]]:
    print('YES')
else:
    print(ans)
Problem p03729 (python)

Fixed submission:
l = input().split()
def shiritori (letter):
    if letter[0][-1:] == letter[1][:1]:
        if letter[1][-1:] == letter[2][:1]:
            return(print('YES'))
        else:
            return(print('NO'))
    else:
        return(print('NO'))
shiritori(l)

Buggy submission (verdict: Runtime Error):
l = input().split()
def shiritori (letter):
    if letter[0][-1:] == letter[1][:1]:
        if letter[1][-1:] == letter[2][:1]:
            return('YES')
        else return('NO')
    else return('NO')
shiritori(l)
Problem p03759 (python)

Fixed submission:
n_vec = list(map(int, input().split()))
n1 = n_vec[0]
n2 = n_vec[1]
n3 = n_vec[2]
def abc_057_1(a,b,c):
    if b-a == c-b:
        return(print('YES'))
    else:
        return(print('NO'))
abc_057_1(n1,n2,n3)

Buggy submission (verdict: Runtime Error):
s_vec1 = input()
s_vec2 = input()
def abc_057_2(o,e):
    s_vec3 = []
    for i in range(0,len(e)):
        s_vec3.append(o[i])
        s_vec3.append(e[i])
    if len(o) == len(e):
        pass
    else:
        s_vec3.append(o[i+1])
    return(''.join(s_vec3))
print(abc_057_2(s_vec1,s_vec2))

Buggy submission (verdict: Runtime Error):
s_vec1 = input()
s_vec2 = input()
def abc_057_2(o,e):
    s_vec3 = []
    for i in range(0,len(e)):
        s_vec3.append(o[i])
        s_vec3.append(e[i])
    if len(o) == len(e):
        pass
    else:
        s_vec3.append(o[i+1])
    return(''.join(s_vec3))  
abc_057_2(s_vec1,s_vec2)
Problem p03760 (python)

Fixed submission:
s_vec1 = input()
s_vec2 = input()
def abc_057_2(o,e):
    s_vec3 = []
    for i in range(0,len(e)):
        s_vec3.append(o[i])
        s_vec3.append(e[i])
    if len(o) == len(e):
        pass
    else:
        s_vec3.append(o[i+1])
    return(''.join(s_vec3))
print(abc_057_2(s_vec1,s_vec2))

Buggy submission (verdict: Runtime Error):
s_vec1 = input()
s_vec2 = input()
def abc_057_2(o,e):
    s_vec3 = []
    for i in range(0,len(o)):
    s_vec3.append(o[i])
    s_vec3.append(e[i])
    if len(o) == len(e):
        pass
    else:
        s_vec3.append(o[i+1])
    return(''.join(s_vec3))
Problem p03777 (python)

Fixed submission:
l_vec = input().split()
def classifier1(l) :
    if ((l[0] == 'H') and (l[1] == 'H')) or ((l[0] == 'D') and (l[1] == 'D')) :
        return 'H'
    else :
        return 'D'
print(classifier1(l_vec))

Buggy submission (verdict: Runtime Error):
n_vec = list(map(int, input().split()))
n1 = n_vec[0]
n2 = n_vec[1]
n3 = n_vec[2]
def metricf1(w,a,b) :
    if (a+w < b) :
        return b-a-w
    elif (a-w <= b <= a+w) :
        return 0
    else :
        return a-b-w
print(metricf1(n1,n2,n3))
Problem p03797 (python)

Fixed submission:
N, M = map(int, input().split(' '))
def sunuke_f3(n, m) :
    if n >= m :
        return(m//2)
    else :
        if 2*n < m :
            return(n + (m-2*n)//4)
        else :
            return(m//2)
print(sunuke_f3(N, M))

Buggy submission (verdict: Runtime Error):
def sunuke_f3(n, m) :
    if n >= m :
        return(m//2)
    else :
        if 2*n < m :
            return(n + (m-2*n)//4)
        else :
            return(m//2)
sunuke_f3(N, M)
Problem p03773 (python)

Fixed submission:
l = map(int, raw_input().split())

time=(l[0]+l[1])%24

print time

Buggy submission (verdict: Runtime Error):
import math

N, M = map(int, raw_input().split())
a = []
for i in range(N+M):
    a.append(map(int, raw_input().split()))

b=[]

def mhtn(a,b,c,d):
    return 

for i in range(N):
    best=4*10e8
    num=0
    for j in range(M):
        x=math.fabs(a[i][0]-a[N+j][0])+math.fabs(a[i][1]-a[N+j][1])
        
        if(best>x):
            best=x
            num=j+1
    b.append(num)

for i in b:
    print i

Buggy submission (verdict: Runtime Error):
l = raw_input().split()

time=(l[0]+l[1])%24

print time
Problem p03777 (python)

Fixed submission:
l = raw_input().split(" ")

if l[0]==l[1]:
    print "H"
else:
    print "D"

Buggy submission (verdict: Runtime Error):
l = input().split()

if l[0]==l[1]:
    return "H"
else:
    return "D"
Problem p03759 (python)

Fixed submission:
ns=list(map(int, input().split()))
ns.sort()
if ns[0] + ns[2] == ns[1]*2:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
a=input();b=input();r=[];l=len(lb)
for i in range(l):
    r.append(a[i]); r.append(b[i])
if l != len(b):
    r.append(a[-1])
print(''.join(r))
Problem p03760 (python)

Fixed submission:
import sys
read=lambda:sys.stdin.readline().rstrip()
readi=lambda:int(sys.stdin.readline())
writeln=lambda x:sys.stdout.write(str(x)+"\n")
write=lambda x:sys.stdout.write(x)
a=read();b=read();la,lb=len(a),len(b);r=[]
for i in range(lb):
    r.append(a[i]);r.append(b[i])
if la != lb:
    r.append(a[-1])
print(''.join(r))

Buggy submission (verdict: Runtime Error):
a=input();b=input();r=[];l=len(lb)
for i in range(l):
    r.append(a[i]); r.append(b[i])
if l != len(a):
    r.append(a[-1])
print(''.join(r))

Buggy submission (verdict: Runtime Error):
a=input();b=input();r=[];l=len(lb)
for i in range(l):
    r.append(a[i]); r.append(b[i])
if l != len(b):
    r.append(a[-1])
print(''.join(r))
Problem p03730 (python)

Fixed submission:
a, b, c = map(int, input().split())
flag = True
for i in range(b):
    if ((i+1) * a) % b == c:
        print('YES')
        flag = False
        break
if flag:
    print('NO')

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

for i in range(b):
    if ((i+1) * a) % b == c:
        print('YES')
        exit(1)
print('NO')
Problem p03730 (python)

Fixed submission:
a, b, c = map(int, input().split())
n = max(int(b / a), 1)
p = 'NO'
s = set()
r = n * a % b

while r not in s:
    if r == c:
        p = 'YES'
        break
    else:
        s.add(r)
        n += 1
        r = n * a % b
print(p)

Buggy submission (verdict: Runtime Error):
a, b, c = map(int, input().split())
n = max(int(b / a), 1)
p = 'NO'
s = set()
r = n * a % b

while r not in s:
    if r == c:
        p = 'YES'
        break
    else:
        s.append(r)
        n += 1
        r = n * a % b
print(p)
Problem p03759 (python)

Fixed submission:
a, b, c = map(int, input().split())
if b - a == c - b:
    print('YES')
else:
    print('NO')

Buggy submission (verdict: Runtime Error):
O = list(input())
E = list(input())
s = ''
while O or E:
    if len(E) >= len(O):
        s = E.pop() + s
    else:
        s = O.pop() + s
print(s)

Buggy submission (verdict: Runtime Error):
O = list(input())
E = list(input())
s = ''
while O or E:
    if len(E) >= len(O):
        s = E.pop() + s
    else:
        s = O.pop() + s
print(s)
Problem p03760 (python)

Fixed submission:
O = list(input())
E = list(input())
s = ''
while O or E:
    if len(E) >= len(O):
        s = E.pop() + s
    else:
        s = O.pop() + s
print(s)

Buggy submission (verdict: Runtime Error):
O = input()
E = input()
s = ''
while O or E:
    if len(E) >= len(O):
        s = E.pop() + s
    else:
        s = O.pop() + s
print(s)

Buggy submission (verdict: Runtime Error):
O = input()
E = input()
s = ''
while O or E:
    if len(E) >= len(O):
        s = E.pop() + s
    else:
        s = O.pop() + s
print(s)
Problem p03761 (python)

Fixed submission:
n = int(input())

cnt = [10000] * 26

for i in range(n):
    s = input()
    tmp = [0] * 26
    for c in s:
        tmp[ord(c) - ord('a')] += 1
    for j in range(26):
        cnt[j] = min(cnt[j], tmp[j])

a = ''
for i in range(26):
    if cnt[i]:
        a = a + chr(ord('a') + i) * cnt[i]
print(a)

Buggy submission (verdict: Runtime Error):
n = int(input()) - 1
a = list(input())
while n and a:
    n -= 1
    a = [i for i in a if i in input()]
print(a)

Buggy submission (verdict: Runtime Error):
n = int(input()) - 1
a = list(input())
while n and a:
    a = [i for i in a if i in input()]
print(a)
Problem p03773 (python)

Fixed submission:
a, b = map(int, input().split())
if a + b >= 24:
    print(a + b - 24)
else:
    print(a + b)

Buggy submission (verdict: Runtime Error):
n, m = map(int, input().split())
s = []
d = []
for i in range(n):
    x, y = map(int, input().split())
    s.append([x, y])
for i in range(m):
    x, y = map(int, input().split())
    d.append([x, y])
for i in s:
    a = m
    c = abs(i[0] - d[0][0]) + abs(i[1] - d[1][1])
    for j in range(1, m):
        c_t = abs(i[0] - d[j][0]) + abs(i[1] - d[j][1])
        if c_t < c:
            c = min(c, c_t)
            a = j
    print(a)
Problem p03773 (python)

Fixed submission:
if __name__ == "__main__":
    times = [int(time) for time in input().split()]
    A = times[0]
    B = times[1]
    print((A+B)%24)

Buggy submission (verdict: Runtime Error):
if __name__ == "__main__":
    times = [int(time) for time in input().split()]
    print((A+B)%24)
Problem p03836 (python)

Fixed submission:
def route_x(sx, tx):
    dx = tx - sx
    dx2 = dx if dx >= 0 else -dx
    buf = "R"*dx2 if dx >= 0 else "L"*dx2
    return buf

def route_y(sy, ty):
    dy = ty - sy
    dy2 = dy if dy >= 0 else -dy
    buf = "U"*dy2 if dy >= 0 else "D"*dy2
    return buf

def route(sx, sy, tx, ty):
    return route_x(sx, tx) + route_y(sy, ty)

def route2(sx, sy, tx, ty):
    dx = tx - sx
    dy = ty - sy
    if dx >= 0 and dy >= 0:
        buf = "L" + route_y(sy, ty+1) + route_x(sx-1, tx) + "D"
    if dx >= 0 and dy < 0:
        buf = "U" + route_x(sx, tx+1) + route_y(sy+1, ty) + "L"
    if dx < 0 and dy >= 0:
        buf = "D" + route_x(sx, tx-1) + route_y(sy-1, ty) + "R"
    if dx < 0 and dy < 0:
        buf = "R" + route_y(sy, ty-1) + route_x(sx+1, tx) + "U"
    return buf

if __name__ == "__main__":
    sx, sy, tx, ty = [int(i) for i in input().split()]
    r1 = route(sx, sy, tx, ty) + route(tx, ty, sx, sy)
    r2 = route2(sx, sy, tx, ty) + route2(tx, ty, sx, sy)
    print(r1 + r2)

Buggy submission (verdict: Runtime Error):
ef route(sx, sy, tx, ty):
    dx = tx - sx
    dy = ty - sy
    dx2 = dx if dx >= 0 else -dx
    dy2 = dy if dy >= 0 else -dy
    buf = ""
    for i in range(dx2):
        if dx >= 0:
            buf += "L"
        else:
            buf += "R"
    for i in range(dy2):
        if dy >= 0:
            buf += "U"
        else:
            buf += "D"
    return buf

if __name__ == "__main__":
    sx, sy, tx, ty = [int(i) for i in input().split()]
    r1 = route(sx, sy, tx, ty) + route(tx, ty, sx, sy)
    r2 = "L" + route(sx-1, sy, tx, ty+1)\
             + "DR" + route(tx+1, ty, sx, sy-1) + "U"
    print(r1 + r2)
Problem p03733 (python)

Fixed submission:
def main():
    line = input()
    line = line.split(' ')
    n = int(line[0])
    t = int(line[1])
    line = input()
    line = line.split(' ')
    total = 0
    for i in range(1, n):
        total += min(t, int(line[i]) - int(line[i - 1]))
    print(total+t)


if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
def main():
    line=input()
    line=line.split(' ')
    n=line[0]
    t=line[1]
    line=input()
    line=line.split(' ')
    total=0
    for i in range(1,n):
        total+=min(t,line[i]-line[i-1])
    print(total)
    

if __name__=='__main__':
    main()
Problem p03781 (python)

Fixed submission:
x = int(input().strip())

y = 0
i = 0
while y<x:
  i += 1
  y += i

print(i)

Buggy submission (verdict: Runtime Error):
import sys
[n, k] = [int(x) for x in input().strip().split()]
a = [int(x) for x in input().strip().split()]

a.sort()

if sum(a) < k:
  print(n)
  sys.exit()

s = 0
for i in range(len(a)):
  s += a[i]
  if s >= k:
    break

aa = [x for x in a if x < a[i]]
bb = [x for x in a if x < k]

cc = []
for i in range(len(aa)):
  c = bb[:i] + bb[i+1:]
  t = k - bb[i]
  c.reverse()
  #print(c)
  flg = 0
  j = 0
  s = 0
  f = [0 for x in range(len(c))]
  while True:
    f[j] = 1
    #print(c)
    #print(f)
    s += c[j]
    if s >= t and s < k:
      flg = 1
      #print(c)
      #print(f)
      break
    if s >= k:
      f[j] = 0
      s -= c[j]
    j += 1
    if j == len(c):
      ii = -1
      for jj in range(len(c) - 1):
        if f[jj] == 1:
          ii = jj
      if ii == -1:
        break
      else:
        for l in range(ii, len(c)):
          f[l] = 0
      j = ii + 1
      s = sum([c[l] * f[l] for l in range(len(c))])
  if flg== 0:
    cc.append(bb[i])
#print(cc)
print(len(cc))
Problem p03807 (python)

Fixed submission:
input()
i = [int(x) % 2 for x in input().strip().split()]
if sum(i) % 2 == 0:
  print('YES')
else:
  print('NO')

Buggy submission (verdict: Runtime Error):
n = int(input().strip())
a = [int(x) for x in input().strip().split()]
flg = [-1 for i in range(n)]
b = []
l = [[] for i in range(n)]
for i in range(n - 1):
  b.append([int(x) - 1 for x in input().strip().split()])
for x in b:
  l[x[0]].append(x[1])
  l[x[1]].append(x[0])
 
while True:
  minimum = a[0]
  idx = []
  for i, x in enumerate(a):
    if flg[i] != -1 or x > minimum:
      continue
    if x < minimum:
      minimum = x
      idx =[i]
    else:
      idx.append(i)
  while True:
    w = []
    for i in idx:
      flg[i] = 0
      for x in l[i]:
        if flg[x] == -1 and a[x] != a[i]:
          flg[x] = 1
          w.append(x)
    idx = []
    for i in w:
      for x in l[i]:
        if flg[x] == -1:
          flg[x] = 0
          for y in l[x]:
            if flg[y] == -1 and a[x] > a[y]:
              flg[x] = -1
              break
          if flg[x] == 0:
            idx.append(x)
    if len(idx) == 0:
      break
  if -1 not in flg:
    break

sep = ''
s = ''
for i, x in enumerate(flg):
  if x == 1:
    s += sep + str(i + 1)
    sep = ' '

print(s)
Problem p03760 (python)

Fixed submission:
o = input()
e = input()
r = "".join([i + v for i, v in zip(o, e)])
if len(o) > len(e):
  print(r + o[-1])
else:
  print(r)

Buggy submission (verdict: Runtime Error):
o = input.split()
e = input.split()
print("".join([for i,j in zip(o,e)]))
Problem p03737 (python)

Fixed submission:
N = input().upper()
N = N.split()

print("{}{}{}".format(N[0][0],N[1][0],N[2][0]))

Buggy submission (verdict: Runtime Error):
s = input().split()
s = s.upper()

s1 = s[0][0]
s2 = s[1][0]
s3 = c[2][0]

print(s1+s2+s3)
Problem p03777 (python)

Fixed submission:
a,b = input().split()
if a==b:
  print("H")
else:
  print("D")

Buggy submission (verdict: Runtime Error):
a,b = input().split()
if a==b:
  print(H)
else:
  print(D)
Problem p03737 (python)

Fixed submission:
strs = raw_input()
strs = strs.split()
print strs[0][0].upper() + strs[1][0].upper() + strs[2][0].upper()

Buggy submission (verdict: Runtime Error):
s1 = int(raw_input())
s2 = int(raw_input())
if s1>s2:
    print "GREATER"
elif s1 == s2:
    print "EQUAL"
else:
    print "LESS"

Buggy submission (verdict: Runtime Error):
a,b,c = input().split()
re = a[0].upper() + b[0].upper() + c[0].upper()
print re

Buggy submission (verdict: Runtime Error):
strs = input()
strs = strs.split()
print strs[0][0].upper() + strs[1][0].upper() + strs[2][0].upper()

Buggy submission (verdict: Runtime Error):
input = input()
input = input.strip()
input = input.split(" ")
result = ""
for i in input:
    result += i[0].upper()
return result

Buggy submission (verdict: Runtime Error):
import sys
if __name__ == "__main__":
    input = sys.stdin.readline()
    input = input.strip()
    input = input.split(" ")
    result = ""
    for i in input:
        result += i[0].upper()
    return result

Buggy submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline()
input = input.strip()
input = input.split(" ")
result = ""
for i in input:
    result += i[0].upper()
return result

Buggy submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline()
input = input.strip()
input = input.split(" ")
result = ""
for i in input:
    result += i[0].upper()
return result

Buggy submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline()
input = input.srip()
input = input.split(" ")
result = ""
for i in input:
    result += i[0].upper
return result
Problem p03738 (python)

Fixed submission:
s1 = int(raw_input())
s2 = int(raw_input())
if s1>s2:
    print "GREATER"
elif s1 == s2:
    print "EQUAL"
else:
    print "LESS"

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-

s1 = int(raw_input())
s2 = int(raw_input())
if s1>s2:
    print "GREATER"
elif s1 == s2:
    print "EQUAL"
else:
    print "LESS

Buggy submission (verdict: Runtime Error):
s1 = int(raw_input())
s2 = int(raw_input())
if s1>s2:
    print "GREATER"
if s1 == s2:
    print "EQUAL"
if s1 < s2:
    print "LESS

Buggy submission (verdict: Runtime Error):
s1 = int(raw_input())
s2 = int(raw_input())
if s1>s2:
    print "GREATER"
elif s1 == s2:
    print "EQUAL"
else:
    print "LESS