Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
#!/usr/bin/python

from sets import Set
import sys

def main(argv):
    line = sys.stdin.readline()
    while line:
        N, M = map(lambda x: int(x), line.split(" ", 2))

        services_1 = Set([])
        services_n = []
        for i in xrange(M):
            a, b = map(lambda x: int(x), sys.stdin.readline().split(" ", 2))
            if a == 1:
                services_1.add(b)
            if b == N:
                services_n.append(a)

        if 1 in services_n:
            print("POSSIBLE")

        result = "IMPOSSIBLE"
        for service in services_n:
            if service == 1 or service in services_1:
                result = "POSSIBLE"
                break
        print result                

        line = sys.stdin.readline()

if __name__ == "__main__":
    main(sys.argv)

Fixed submission:
#!/usr/bin/python

import sys

def main(argv):
    for line in sys.stdin:
        print("ABC{0}".format(int(line)))

if __name__ == "__main__":
    main(sys.argv)

Buggy python submission (verdict: Runtime Error):
#!/usr/bin/python

import sys

def main(argv):
    line = sys.stdin.readline()
    while line:
        N, M = map(lambda x: int(x), line.split(" ", 2))

        services_1 = set()
        services_n = []
        for i in xrange(M):
            a, b = map(lambda x: int(x), sys.stdin.readline().split(" ", 2))
            if a == 1:
                services_1.add(b)
            if b == N:
                services_n.append(a)

        if 1 in services_n:
            print("POSSIBLE")

        result = "IMPOSSIBLE"
        for service in services_n:
            if service == 1 or service in services_1:
                result = "POSSIBLE"
                break
        print result                

        line = sys.stdin.readline()

if __name__ == "__main__":
    main(sys.argv)

Fixed submission:
#!/usr/bin/python

import sys

def main(argv):
    for line in sys.stdin:
        print("ABC{0}".format(int(line)))

if __name__ == "__main__":
    main(sys.argv)
Buggy python submission (verdict: Time Limit Exceeded):
#!/usr/bin/python

import sys

def main(argv):
    line = sys.stdin.readline()
    while line:
        N, M = map(lambda x: int(x), line.split(" ", 2))

        services_1 = []
        services_n = []
        for i in xrange(M):
            a, b = map(lambda x: int(x), sys.stdin.readline().split(" ", 2))
            if a == 1:
                services_1.append(b)
            if b == N:
                services_n.append(a)

        if 1 in services_n:
            print("POSSIBLE")

        result = "IMPOSSIBLE"
        for service in services_n:
            if service == 1 or service in services_1:
                result = "POSSIBLE"
                break
        print result                

        line = sys.stdin.readline()

if __name__ == "__main__":
    main(sys.argv)

Fixed submission:
#!/usr/bin/python

import sys

def main(argv):
    line = sys.stdin.readline()
    while line:
        N, M = map(lambda x: int(x), line.split(" ", 2))

        services_1 = {}
        services_n = []
        for i in xrange(M):
            a, b = map(lambda x: int(x), sys.stdin.readline().split(" ", 2))
            if a == 1:
                services_1[b] = True
            if b == N:
                services_n.append(a)

        if 1 in services_n:
            print("POSSIBLE")

        result = "IMPOSSIBLE"
        for service in services_n:
            if service == 1 or service in services_1:
                result = "POSSIBLE"
                break
        print result                

        line = sys.stdin.readline()

if __name__ == "__main__":
    main(sys.argv)
Buggy python submission (verdict: Time Limit Exceeded):
#!/usr/bin/python

import math
import sys

def main(argv):
    for line in sys.stdin:
        n = int(line)

        print math.factorial(n) % (10 ** 9 + 7)

if __name__ == "__main__":
    main(sys.argv)

Fixed submission:
#!/usr/bin/python

import math
import sys

def main(argv):
    for line in sys.stdin:
        n = int(line)

        answer = 737935835
        if n < 50000:
            answer = math.factorial(n)
        elif n > 50000:
            for i in xrange(50001, n + 1):
                answer = (answer * i) % (10**9 + 7)
        print answer % (10**9 + 7)

if __name__ == "__main__":
    main(sys.argv)

Buggy python submission (verdict: Time Limit Exceeded):
#!/usr/bin/python

import sys

def main(argv):
    for line in sys.stdin:
        n = int(line)

        power = 1
        for i in xrange(1, n + 1):
            power *= i

        print power % (10 ** 9 + 7)

if __name__ == "__main__":
    main(sys.argv)

Fixed submission:
#!/usr/bin/python

import math
import sys

def main(argv):
    for line in sys.stdin:
        n = int(line)

        answer = 737935835
        if n < 50000:
            answer = math.factorial(n)
        elif n > 50000:
            for i in xrange(50001, n + 1):
                answer = (answer * i) % (10**9 + 7)
        print answer % (10**9 + 7)

if __name__ == "__main__":
    main(sys.argv)
Buggy python submission (verdict: Time Limit Exceeded):
#!/usr/bin/python

import sys

def main(argv):
    for line in sys.stdin:
        k, s = line.rstrip("\n").split(" ")
        k = int(k)
        s = int(s)
        counter = 0
        for x in xrange(0, k + 1):
            for y in xrange(x, k + 1):
                for z in xrange(y, k + 1):
                    if (x+y+z) == s:
                        if x == y and y == z:
                            counter += 1
                        elif x == y or y == z or x == z:
                            counter += 3
                        else: 
                            counter += 6
        print counter

if __name__ == "__main__":
    main(sys.argv)

Fixed submission:
#!/usr/bin/python

import sys

def main(argv):
    for line in sys.stdin:
        k, s = line.rstrip("\n").split(" ")
        k = int(k)
        s = int(s)
        counter = 0
        for x in xrange(0, k + 1):
            for y in xrange(x, k + 1):
                if x + y <= s:
                    z = s - x - y
                    if z >= y and z <= k:
                        if (x+y+z) == s:
                            if x == y and y == z:
                                counter += 1
                            elif x == y or y == z or x == z:
                                counter += 3
                            else: 
                                counter += 6
        print counter

if __name__ == "__main__":
    main(sys.argv)

Buggy python submission (verdict: Time Limit Exceeded):
#!/usr/bin/python

import sys

def main(argv):
    for line in sys.stdin:
        k, s = line.rstrip("\n").split(" ")
        k = int(k)
        s = int(s)
        counter = 0
        for x in xrange(0, k + 1):
            for y in xrange(0, k + 1):
                for z in xrange(0, k + 1):
                    if (x+y+z) == s:
                        counter += 1
        print counter

if __name__ == "__main__":
    main(sys.argv)

Fixed submission:
#!/usr/bin/python

import sys

def main(argv):
    for line in sys.stdin:
        k, s = line.rstrip("\n").split(" ")
        k = int(k)
        s = int(s)
        counter = 0
        for x in xrange(0, k + 1):
            for y in xrange(x, k + 1):
                if x + y <= s:
                    z = s - x - y
                    if z >= y and z <= k:
                        if (x+y+z) == s:
                            if x == y and y == z:
                                counter += 1
                            elif x == y or y == z or x == z:
                                counter += 3
                            else: 
                                counter += 6
        print counter

if __name__ == "__main__":
    main(sys.argv)
Buggy python submission (verdict: Runtime Error):
#!/usr/bin/python

import re
import sys

TOKENS = ["dream", "dreamer", "erase", "eraser"]

def check(s):
    if s in TOKENS:
        return "YES"
    else:
        if len(s) > 5 and s[-5:] in [TOKENS[0], TOKENS[2]]:
            return check(s[0:-5])
        elif len(s) > 6 and s[-6:] == TOKENS[3]:
            return check(s[0:-6])
        elif len(s) > 7 and s[-7:] == TOKENS[1]:
            return check(s[0:-7])
    return "NO"

def main(argv):
    for line in sys.stdin:
        print check(line.rstrip("\n"))

if __name__ == "__main__":
    main(sys.argv)

Fixed submission:
#!/usr/bin/python

import re
import sys

PATTERN = re.compile("(dream|dreamer|erase|eraser)+$")

def main(argv):
    for line in sys.stdin:
        s = line.rstrip("\n")
        if PATTERN.match(s):
            print "YES"
        else:
            print "NO"

if __name__ == "__main__":
    main(sys.argv)
Buggy python submission (verdict: Runtime Error):
X = input()
Y = input()
Z = input()
A = X
B = Y
C = Z
# swap the contents of the boxes A and B
temp = B
B = A
A = temp
print(A + " " + B + " " + C)
# swap the contents of the boxes A and C
swapAC = C
C = A
A = swapAC
print(A + " " + B + " " + C)


Fixed submission:
X, Y, Z = input().split()
A = X
B = Y
C = Z
# swap the contents of the boxes A and B
temp = B
B = A
A = temp
# swap the contents of the boxes A and C
swapAC = C
C = A
A = swapAC
print(A, B, C)
Buggy python submission (verdict: Runtime Error):
N,A,B = map(int,input().split())

T = int(N/(A+B))
S = N%(A+B)


if S<A:
	print(T*A+S)
else:
	print(T*A+A)



Fixed submission:
N = list(input())
if N[0] == N[1] == N[2]:
	print("No")
else :
	print("Yes")
Buggy python submission (verdict: Runtime Error):
S = str(input())
D = ["SUN","MUN","TUE","WED","THU","FRI","SAT"] 
print(7-D.index(S))

Fixed submission:
S = str(input())
D = ["SUN","MON","TUE","WED","THU","FRI","SAT"] 
print(7-D.index(S))
Buggy python submission (verdict: Runtime Error):
import sys
N = int(input())
S = list(map(str,input().split()))
if N % 2 == 0:
	T_1 = S[:int(len(S)/2)]
	T_2 = S[int(len(S)/2):]
	for i in range(len(T_1)):
		if T_1[i] != T_2[i]:
	 		print("No")
	 		sys.exit()
		
	 print("Yes")
	 sys.exit()
else:
	print("No")

Fixed submission:
import sys
N = int(input())
# S = list(map(str,input().split()))
S = list(input())
if N % 2 == 0:
	T_1 = S[:int(len(S)/2)]
	T_2 = S[int(len(S)/2):]
	# print(T_1)
	# print(T_2)
	for i in range(len(T_1)):
		if T_1[i] != T_2[i]:
			print("No")
			sys.exit()	
	print("Yes")
	sys.exit()
else:
	print("No")
Buggy python submission (verdict: Runtime Error):

A,B = (int(x) for x in input().split())
if A >=10 or B >:
	print(-1)
else:
    print(A*B)


Fixed submission:
A,B = (int(x) for x in input().split())
if A >=10 or B >=10:
	print(-1)
else:
    print(A*B)
Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
votes = list(map(int, input().split()))
min_votes: float = sum(votes) * 1.0 / (4*M)
votes_greater_than_min = list(filter(lambda x: x >= min_votes, votes))
if len(votes_greater_than_min) >= M:
    print('Yes')
else:
    print('No')


Fixed submission:
N, M = map(int, input().split())
votes = list(map(int, input().split()))
min_votes = sum(votes) * 1.0 / (4*M)
votes_greater_than_min = list(filter(lambda x: x >= min_votes, votes))
if len(votes_greater_than_min) >= M:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
K, N=map(int, input().split())
A=list(map(int, input().split()))

box = []
for i in range(N):
    d = abs(A[i-1]-A[i])
    if d>K/2:
        d = K - d
    box.append(d)
print(K-max(d))

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

box = []
for i in range(N):
    d = abs(A[i-1]-A[i])
    if d>K/2:
        d = K - d
    box.append(d)
print(K-max(box))

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

box = []
for i in range(N):
    a = abs(A[i-1]-A[i])
    if a>K/2:
        a = K - a
    box.append(a)
box.extend(box)
dis = []
for i in range(N):
    d = sum(box[i:i+N-1])
    dis.append(d)

print(min(dis))

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

box = []
for i in range(N):
    d = abs(A[i-1]-A[i])
    if d>K/2:
        d = K - d
    box.append(d)
print(K-max(box))

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

box = []
for i in range(N):
    a = abs(A[i-1]-A[i])
    if a>K/2:
        a = K - a
    box.append(a)
box.extend(box)
dis = []
for i in range(N):
    d = sum(box[i:i+N-1])
    dis.append(d)

print(min(dis))

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

box = []
for i in range(N):
    d = abs(A[i-1]-A[i])
    if d>K/2:
        d = K - d
    box.append(d)
print(K-max(box))
Buggy python submission (verdict: Runtime Error):
n,k=map(int, input().split()) 
p=list(map(int, input().split()))

new_p = [(1+i)/2 for i in p]
box=[]
sec_box=[]
s=0
for i in range(n):
    s = sum(new_p[:i])
    box.append(s)
    if i>k:
        sec_box.append(box[i]-box[i-k])
print(max(sec_box))
    

Fixed submission:
n,k=map(int, input().split()) 
p=list(map(int, input().split()))
E = []
for e in p:
    E.append( (1+e)/2 )

s=0
for i in range(k):
    s += E[i]
    
box=[]
box.append(s)
for i in range(k,n):
    s += E[i] - E[i-k]
    box.append(s)
    
print(max(box))
Buggy python submission (verdict: Runtime Error):
a,b=map(int, input().split()) 
if A % b !=0:
    print(a//b+1)
else:
    print(a//b)

Fixed submission:
a,b=map(int, input().split()) 
if a % b !=0:
    print(a//b+1)
else:
    print(a//b)
Buggy python submission (verdict: Runtime Error):
a,b=map(int, input().split())
print(b+a)

Fixed submission:
a,b=map(str, input().split())
print(b+a)

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

Fixed submission:
a,b=map(str, input().split())
print(b+a)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
over_box = [i for i in range(N,10**6)]
primes = [2]
for i in range(3, N, 2):
    all(i % p != 0 for p in primes) and primes.append(i)
for i in over_box:
    if N ==2:
        print(2)
        break
    elif all(i % p != 0 for p in primes):
        print(i)
        break

Fixed submission:
N = int(input())
box = [i for i in range(N,100004)]
box = [i for i in box if not i % 2==0]
box = [i for i in box if not i % 3==0]
box = [i for i in box if not i % 5==0]
box = [i for i in box if not i % 7==0]
primes = [2]
for i in range(3, N, 2):
    all(i % p != 0 for p in primes) and primes.append(i)
for i in box:
    if N ==2:
        print(2)
        break
    elif all(i % p != 0 for p in primes):
        print(i)
        break
Buggy python submission (verdict: Runtime Error):
s=str(input())
even = ["L". "U", "D"]
odd = ["R", "U", "D"]
a = []
b = []
for i in range(len(str)):
     if i%2 == 0:
            if s[i] in even:
                a.apend(True) 
            else:
                a.apend(False)
     elif i%2 i= 0:
            if s[i] in odd:
                b.apend(True) 
            else:
                b.apend(False)
if all(a) and all(b):
    print('Yes')
else:
    print('No')

Fixed submission:
s=str(input())
even = ["L","U", "D"]
odd = ["R", "U", "D"]
a = []
b = []
for i in range(len(s)):
     if (i+1)%2 == 0:
            if s[i] in even:
                a.append(True) 
            else:
                a.append(False)
     elif (i+1)%2 != 0:
            if s[i] in odd:
                b.append(True) 
            else:
                b.append(False)
if all(a) and all(b):
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
N = int(input())
box = list(map(int, input().split()))
count = 0
for i in range(N):
    if box%2 ==0:
        box/=2
        count ++
    elif box%2 !=0:
        break
print(count)

Fixed submission:
import numpy as np
N = int(input())
box = list(map(int, input().split()))
box = np.array(box)
count=0
while(True):
  if any([i % 2 != 0 for i in box]):
    break
  elif all([i % 2 == 0 for i in box]):
    box /= 2
    count +=1
print(count)
Buggy python submission (verdict: Runtime Error):
a,b=map(int, input().split()) 
if (a+b)%3 ==0 or a%==0 or b%==0:
    print("Possible")
else:
    print("Impossible")

Fixed submission:
a,b=map(int, input().split()) 
if (a+b)%3 ==0 or a%3==0 or b%3==0:
    print("Possible")
else:
    print("Impossible")
Buggy python submission (verdict: Runtime Error):
a,b,h=map(int, input().split())
print((a+b)*h/2)

Fixed submission:
a=int(input()) 
b=int(input()) 
h=int(input()) 

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

Buggy python submission (verdict: Runtime Error):
a,b,c,d = map(int,input().split())
print(max(a*b,c*d))

Fixed submission:
a = int(input())
b = int(input())
h = int(input())

print(int((a + b) * h / 2))
Buggy python submission (verdict: Runtime Error):
import sys
N, K = list(map(int, input().split()))
A_N = list(map(int, input().split()))
B = []
b = 0
for i in range(N-1):
    for j in range(N-1):
        if i <= j:
            b = A_N[i] * A_N[j+1]
            B.append(b)
            b = 0
B = sorted(B)
# print(B)
print(B[K-1])




Fixed submission:
import sys
A, B, C = list(map(str, input().split()))

if A == B and A != C and B != C:
    print("Yes")
elif B == C and B != A and C != A:
    print("Yes")
elif C == A and C != B and A != B:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
import sys
import collections

N = int(input())
A_i = list(map(int, input().split()))
A_i = [i for i in A_i if 1 <= i and i <= 10**9]

if not 2 <= N or not N <= 2*10**5:
    print("error:N")
    sys.exit()

if len(collections.Counter(A_i)) == len(A_i):
    print("Yes")
else:
    print("No")

Fixed submission:
import sys

Ball = list(map(str, input().split()))
Quantity = list(map(int,input().split()))
U = str(input())

S = Ball[0]
T = Ball[1]
A = Quantity[0]
B = Quantity[1]

if not 1 <= len(S) or not len(S) <= 10:
    print("error:S_length")
    sys.exit()    
if not 1 <= len(T) or not len(T) <= 10:
    print("error:T_length")
    sys.exit()   
if S == T:
    print("error:S==T")
    sys.exit()
if S != U and T != U:
    print("error:S=U or S=T")
    sys.exit()
if not 1<= A or not B <= 10:
    print("error:A,B")
    sys.exit()

if U == S:
    A -= 1
if U == T:
    B -= 1
print(A,B)
Buggy python submission (verdict: Runtime Error):
import sys
import math

H = int(input())
count = 0

if not 1 <= H or not H <= 10**12:
    print("error:1≤H≤10^12である必要があります")
    sys.exit()

while True:
    if H <= 0:
        break
    H = math.floor(H / 2)
    count = 1 + 2*count
print(count)


Fixed submission:
import sys

I = list(map(int, input().split()))
H = I[0]
A = I[1]
count = 0

if not 1 <= H or not H <= 10**4 or not 1 <= A or not A <= 10**4:
    print("error:1≤H≤10000,1≤A≤10000である必要があります")
    sys.exit()
# print("H =",H, "A =",A)

while True:
    H -= A
    count += 1
    # print("H =",H, "A =",A)
    if H <= 0:
        break
print(count)
Buggy python submission (verdict: Runtime Error):
s=input();
ans =0
for n in set(i for i in s[2::]):
  if s.count(n)==2:
    ans+=1
print('Yes' if ans>1 else 'No'

Fixed submission:
s=input()[2::];print('Yes' if len(set(s[:2]))==1 and len(set(s[2:]))==1 else 'No')
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
N = list(map(int,input().split()))
N.sort()
for i in range(b):
    if N:
        N.pop()
print(sum(N))

Fixed submission:
h = int(input())

result = 0
i = 1
while h > 0:
    h = h // 2
    result = result + i
    i *= 2

print(result)
Buggy python submission (verdict: Runtime Error):
n = list(map(int,input().split()))
print(n[1] n[2] n[3])

Fixed submission:
n = list(map(int,input().split()))
print(n[2],n[0],n[1])
Buggy python submission (verdict: Runtime Error):
n = list(map(int,input().split()))
vote = list(map(int,input().split()))
a = sum(vote)/(4*n[1])
result = 0
for i in range(n[0]):
  if vote[i]=>a:
    result += 1
if result<n[1]:
  print('No')
else:
  print('Yes')

Fixed submission:
n = list(map(int,input().split()))
vote = list(map(int,input().split()))
a = sum(vote)/(4*n[1])
result = 0
for i in range(n[0]):
  if vote[i]>=a:
    result += 1
if result<n[1]:
  print('No')
else:
  print('Yes')
Buggy python submission (verdict: Time Limit Exceeded):
n = list(map(int,input().split()))
a = n[0]
b = n[1]
while 1>0:
  c=a
  if a>b:
    a=a-b
  else:
    a=b-a
  if c<=a:
    break
print(c)

Fixed submission:
n = list(map(int,input().split()))
a = n[0]
b = n[1]
c = a%b
d = b - c
if d<c:
    print(d)
else:
    print(c)

Buggy python submission (verdict: Time Limit Exceeded):
n = list(map(int,input().split()))
a = n[0]
b = n[1]
while 1>0:
  c=a
  if a>b:
    a=a-b
  else:
    a=b-a
  if c<a:
    break
print(c)

Fixed submission:
n = list(map(int,input().split()))
a = n[0]
b = n[1]
c = a%b
d = b - c
if d<c:
    print(d)
else:
    print(c)
Buggy python submission (verdict: Runtime Error):
line = input()

calc = int(line) * int(calc) * int(calc) / 27

print(str(calc))

Fixed submission:
line = int(input())
calc = line * line * line / 27

print(str(calc))
Buggy python submission (verdict: Runtime Error):
S = str(input())
if (S[3]) == (S[4]):
    if (S[5]) == (S[6]):
        print("Yes")
    else:
        print("No")
else:
    print("No")

Fixed submission:
S = str(input())
if (S[2]) == (S[3]):
    if (S[4]) == (S[5]):
        print("Yes")
    else:
        print("No")

else:
    print("No")

Buggy python submission (verdict: Runtime Error):
S = str(input())
if (S[3]) == (S[4]):
    if (S[5]) == (S[6]):
        print("Yes")
else:
    print("No")


Fixed submission:
S = str(input())
if (S[2]) == (S[3]):
    if (S[4]) == (S[5]):
        print("Yes")
    else:
        print("No")

else:
    print("No")
Buggy python submission (verdict: Runtime Error):
N = int(input())
S, T = map(str,input().split())
for i in N:
     print(S[i] + T[i],end="")


Fixed submission:
N = int(input())
S, T = map(str,input().split())
for i in range(N):
     print(S[i] + T[i],end="")

Buggy python submission (verdict: Runtime Error):
N = int(input())
S, T = map(int,input().split())
for i in N:
     print(S[i] + T[i],end="")

Fixed submission:
N = int(input())
S, T = map(str,input().split())
for i in range(N):
     print(S[i] + T[i],end="")

Buggy python submission (verdict: Runtime Error):
N = int(input())
S, T = map(int,input().split())
for i in range(N):
     print(S[i] + T[i])

Fixed submission:
N = int(input())
S, T = map(str,input().split())
for i in range(N):
     print(S[i] + T[i],end="")

Buggy python submission (verdict: Runtime Error):
N = int(input())
S, T = map(int,input().split())
for i in N:
     print(S[i] + T[i])    

Fixed submission:
N = int(input())
S, T = map(str,input().split())
for i in range(N):
     print(S[i] + T[i],end="")

Buggy python submission (verdict: Runtime Error):
N = int(input())
S, T = map(int,input().split())
for i in N:
    print(S + T)
    print(S[i] + T[i])

Fixed submission:
N = int(input())
S, T = map(str,input().split())
for i in range(N):
     print(S[i] + T[i],end="")

Buggy python submission (verdict: Runtime Error):
N = int(input())
S, T = map(int,input().split())
for i in N:
    print(S + T)
print(S[i] + T[i])

Fixed submission:
N = int(input())
S, T = map(str,input().split())
for i in range(N):
     print(S[i] + T[i],end="")

Buggy python submission (verdict: Runtime Error):
N = int(input())
S, T = map(int,input().split())
for i in N:
    print(S + T)


Fixed submission:
N = int(input())
S, T = map(str,input().split())
for i in range(N):
     print(S[i] + T[i],end="")

Buggy python submission (verdict: Runtime Error):
N = int(input())
S = int(input())
T = int(input())
for i in N:
    print(S + T)


Fixed submission:
N = int(input())
S, T = map(str,input().split())
for i in range(N):
     print(S[i] + T[i],end="")

Buggy python submission (verdict: Runtime Error):
N = int(input())
S = int(input())
T = int(input())
for i in N:
    print(S + T)


Fixed submission:
N = int(input())
S, T = map(str,input().split())
for i in range(N):
     print(S[i] + T[i],end="")
Buggy python submission (verdict: Runtime Error):
mport itertools

n,m = map(int, input().split())
print(len(list(itertools.combinations(range(m),2))) + len(list(itertools.combinations(range(n),2))))

Fixed submission:
import itertools

n,m = map(int, input().split())
print(len(list(itertools.combinations(range(m),2))) + len(list(itertools.combinations(range(n),2))))