Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
S = input()
T = input()
if (len(S) + 1 ==  len(T)) and (T.index(S) == 0):
    print('yes')
else:
    print('no')

Fixed submission:
S = input()
T = input()
if S == T[:-1]:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Time Limit Exceeded):
import itertools
import math


def gcd(a: int, b: int, c: int) -> int:
    return math.gcd(math.gcd(a, b), c)


def main() -> None:
    k = int(input())

    s = sum(gcd(a, b, c) for a, b, c in itertools.product(range(1, k + 1), repeat=3))
    print(s)


if __name__ == "__main__":
    main()


Fixed submission:
import itertools
import math


def gcd(a: int, b: int, c: int) -> int:
    return math.gcd(math.gcd(a, b), c)


def main() -> None:
    k = int(input())

    one_to_k = range(1, k + 1)
    s1 = sum(one_to_k)
    s2 = sum(math.gcd(a, b) for a, b in itertools.combinations(one_to_k, 2))
    s3 = sum(gcd(a, b, c) for a, b, c in itertools.combinations(one_to_k, 3))
    print(s1 + 6 * s2 + 6 * s3)


if __name__ == "__main__":
    main()
Buggy python submission (verdict: Time Limit Exceeded):
import collections

S = input()
Q = int(input())

d = collections.deque(S)

for _ in range(Q):
    Qi = input()
    if Qi == "1":
        d.reverse()
    else:
        T, F, C = Qi.split()
        if F == "1":
            d.appendleft(C)
        else:
            d.append(C)

print("".join(d))


Fixed submission:
import collections


class Formatter:
    def __init__(self, s):
        self._d = collections.deque(s)
        self._d_reverse = collections.deque(reversed(s))

    def reverse(self):
        self._d, self._d_reverse = self._d_reverse, self._d

    def append(self, s):
        self._d.append(s)
        self._d_reverse.appendleft(s)

    def appendleft(self, s):
        self._d.appendleft(s)
        self._d_reverse.append(s)

    def __iter__(self):
        return iter(self._d)


S = input()
Q = int(input())

d = Formatter(S)

for _ in range(Q):
    Qi = input()
    if Qi == "1":
        d.reverse()
    else:
        T, F, C = Qi.split()
        if F == "1":
            d.appendleft(C)
        else:
            d.append(C)

print("".join(d))
Buggy python submission (verdict: Time Limit Exceeded):
import sys


def fusion(xs):
    if len(xs) < 2:
        yield from xs
    elif xs[0] == xs[1]:
        yield from fusion(xs[1:])
    else:
        yield xs[0]
        yield from fusion(xs[1:])


def main():
    sys.setrecursionlimit(101010)
    N = input()
    S = input()
    print(sum(1 for _ in fusion(S)))


if __name__ == "__main__":
    main()


Fixed submission:
N = int(input())
S = input()

count = 1
for i in range(N - 1):
    if S[i] != S[i + 1]:
        count += 1

print(count)

Buggy python submission (verdict: Runtime Error):
def fusion(xs):
    if len(xs) < 2:
        yield from xs
    elif xs[0] == xs[1]:
        yield from fusion(xs[1:])
    else:
        yield xs[0]
        yield from fusion(xs[1:])


N = input()
S = input()
print(sum(1 for _ in fusion(S)))


Fixed submission:
N = int(input())
S = input()

count = 1
for i in range(N - 1):
    if S[i] != S[i + 1]:
        count += 1

print(count)
Buggy python submission (verdict: Runtime Error):
S = str(input())
T = str(input())
t = int(len(T)) - 2

if S == T[:t]
  print('Yes')
else:
  print('No')

Fixed submission:
S = str(input())
T = str(input())
t = int(len(T)) - 1
U = T[:t]

if S == U:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
S = str(input())
T = str(input())
t = int(len(T)) - 2

if S == T[:t]
  print(Yes)
else:
  No


Fixed submission:
S = str(input())
T = str(input())
t = int(len(T)) - 1
U = T[:t]

if S == U:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
S = str(input())
T = str(input())

if S == T[0:len(T)-2]:
  print(Yes)
else:
  No


Fixed submission:
S = str(input())
T = str(input())
t = int(len(T)) - 1
U = T[:t]

if S == U:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
S = str(input())
T = str(input())

if S + .  == T:
  print(Yes)
else:
  No


Fixed submission:
S = str(input())
T = str(input())
t = int(len(T)) - 1
U = T[:t]

if S == U:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
S = str(input())
T = str(input())

if .S == T:
  print(Yes)
else:
  No


Fixed submission:
S = str(input())
T = str(input())
t = int(len(T)) - 1
U = T[:t]

if S == U:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
s = [input() for i in range(2)]
if s[0] = s[1][:-1]:
  print('Yes')
else:
  print("No")


Fixed submission:
s = [input() for i in range(2)]
if s[0] == s[1][:-1]:
  print('Yes')
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
#include <stdio.h>
int main (void){
    int i;
    char S[20], T[20];
    scanf("%s%s", S, T);
    for(i=0;S[i]!='\0';i++){
        if(S[i]==T[i]){
            printf("Yes\n");
            
        }else printf("No\n");
    return 0;
    }

Fixed submission:
S = input()
T = input()
 
if T[:-1] == S:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
s = input()

if 'hi' in s:
  print('Yes')
else:
  print('No)

Fixed submission:
s = input()

if len(s.replace('hi', '')) == 0:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
num = lambda c: chr(c+64)
s = str(input())

for i in range(1,26):
	if s == num(i).lower:
      print(num(i+1))



Fixed submission:
s = str(input())

print(chr(ord(s) + 1))
Buggy python submission (verdict: Runtime Error):
l1 = list(map(int,input().split()))
l2 = list(map(int,input().split()))

if l[1] == 1:
  print('1')
else:
  print('0')

Fixed submission:
l1 = list(map(int,input().split()))
l2 = list(map(int,input().split()))

if l2[1] == 1:
  print('1')
else:
  print('0')
Buggy python submission (verdict: Runtime Error):
a, op, b = input().split()

if op == '+':
  print(a + b)
else:
  print(a - b)

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

if o == "+":
  print(int(a) + int(b))
elif o == "-":
  print(int(a) - int(b))

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

if op == '+':
  print(a + b)
else:
  print(a - b)

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

if o == "+":
  print(int(a) + int(b))
elif o == "-":
  print(int(a) - int(b))
Buggy python submission (verdict: Time Limit Exceeded):
a, b, x = map(int, input().split())

l = []

for i in range(a, b+1):
  l.append(i)
  
co = 0

for i in range(len(l)):
  if l[i] % x == 0:
    co += 1

print(co)

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

print(b//x - (a-1)//x)
Buggy python submission (verdict: Runtime Error):
[a,b,t] = (input().split(" "))
print((t//a)*b)

Fixed submission:
[a,b,t] = map(int,input().split(" "))
print((t//a)*b)
Buggy python submission (verdict: Runtime Error):
s = input()


if s=='SUN':
    ans = 7
elif s=='MON':
    ans = 6
elif s=='TUE':
    ans = 5
elif s=='TWED':
    ans = 4
elif s=='THU':
    ans = 3
elif s=='FRI':
    ans = 2
elif s=='SAT':
    ans = 1

print(ans)


Fixed submission:
s = input()


if s=='SUN':
    ans = 7
elif s=='MON':
    ans = 6
elif s=='TUE':
    ans = 5
elif s=='WED':
    ans = 4
elif s=='THU':
    ans = 3
elif s=='FRI':
    ans = 2
elif s=='SAT':
    ans = 1

print(ans)
Buggy python submission (verdict: Runtime Error):
import numpy as np
n = int(input())
a = list(map(int,input().split()))

a = np.array(a)



print(*np.argsort(a)+1)

Fixed submission:
import numpy as np
n = int(input())
a = list(map(int,input().split()))

a = np.array(a)



print(*np.argsort(a)+1)

Buggy python submission (verdict: Runtime Error):
import numpy as np
n = int(input())
a = list(map(int,input().split()))

a = np.array(a)

'''
for i in range(1,n+1):
    result.append(a.index(i)+1)
'''


print(*np.argsort(a)+1)

Fixed submission:
import numpy as np
n = int(input())
a = list(map(int,input().split()))

a = np.array(a)



print(*np.argsort(a)+1)

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

result = []
for i in range(1,n+1):
    result.append(a.index(i)+1)

print(*result)


Fixed submission:
import numpy as np
n = int(input())
a = list(map(int,input().split()))

a = np.array(a)



print(*np.argsort(a)+1)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())

s = 0
for i in range(n):
    s += i

print(s)

Fixed submission:
n = int(input())
s = n * (n-1)//2
print(s)
Buggy python submission (verdict: Runtime Error):
k,x =list(map(int,input().split()))

start = x - k+1
end = x + k-1

ans = ''
for i in range(start,end+1):
    ans += f'{i} '
ans = ans[:-1]

print(ans)


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

start = x - k+1
end = x + k-1

ans = ''
for i in range(start,end+1):
    ans += '{} '.format(i)
ans = ans[:-1]

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
from collections import Counter
n = int(input())
s = []
for i in range(n):
    s.append(Counter(input()))



ans = 0
for i in range(n):
    for j in range(i+1,n):
        if s[i]==s[j]:
            ans += 1
print(ans)


Fixed submission:
n = int(input())
d = {}
for _ in range(n):
    s = ''.join(sorted(input()))
    if s not in d:
        d[s] = 0
    d[s] += 1



ans = 0
for i in d.values():
    ans += int(i*(i-1)/2)
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
from collections import Counter
n = int(input())
s = []
for i in range(n):
    s.append(input())
cou = []

for i in range(n):
    cou.append(Counter(s[i]))

ans = 0
for i in range(n):
    for j in range(i+1,n):
        if cou[i]==cou[j]:
            ans += 1
print(ans)


Fixed submission:
n = int(input())
d = {}
for _ in range(n):
    s = ''.join(sorted(input()))
    if s not in d:
        d[s] = 0
    d[s] += 1



ans = 0
for i in d.values():
    ans += int(i*(i-1)/2)
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
from collections import Counter
n = int(input())
s = []
for i in range(n):
    s.append(input())

ans = 0
for i in range(n):
    for j in range(i+1,n):
        if Counter(s[i]) == Counter(s[j]):
            ans += 1
print(ans)


Fixed submission:
n = int(input())
d = {}
for _ in range(n):
    s = ''.join(sorted(input()))
    if s not in d:
        d[s] = 0
    d[s] += 1



ans = 0
for i in d.values():
    ans += int(i*(i-1)/2)
print(ans)
Buggy python submission (verdict: Runtime Error):

a = input().split()
N = int(a[0])
H = a[1:]
len(H)



for i in range(len(H)):

    if(i==0):
        pass
    elif( int(H[-(i+1)]) >= 1 + int(H[-i]) ):
        answer = "No"
        break
    elif(int(H[-(i+1)]) == 1 + int(H[-i])):
        tem = 1
    else:
        tem = 0

    answer = "Yes"


print(answer)

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

tem =0

for i in range(n):

    if(i==0):
        pass
    elif( int(h[-(i+1)]) > 1 + int(h[-i]) - tem ):
        answer = "No"
        break
    elif(int(h[-(i+1)]) == 1 + int(h[-i]) - tem  ):
        tem = 1
    else:
        tem = 0

    answer = "Yes"


print(answer)
Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
A=[int(x) for x in input().split()]
S=0
for i in range(N):
  for j in range(i+1,N):
    if j-i==A[i]+A[j]:
      S+=1
print(S)


Fixed submission:
# 解答みた
N=int(input())
A=[int(x) for x in input().split()]
X={}
Y={}
for i in range(N):
  L=i+A[i]
  R=i-A[i]
  X[L]=X[L]+1 if L in X else 1
  Y[R]=Y[R]+1 if R in Y else 1
ans=0
for n in X:
  if n in Y:
    ans+=X[n]*Y[n]
print(ans)
Buggy python submission (verdict: Runtime Error):
import sys
r = int(sys.stdin.readline())
if r < 1200: print("ABC")
elif r < 2800: print("ARC")
else print("AGC")

Fixed submission:
import sys
r = int(sys.stdin.readline())
if r < 1200: print("ABC")
elif r < 2800: print("ARC")
else: print("AGC")
Buggy python submission (verdict: Time Limit Exceeded):
import sys
n, m = map(int, sys.stdin.readline().split())
req = [ list(sorted(map(int, sys.stdin.readline().split())))
        for _ in range(m) ]
req.sort(reverse=True)
cutlist = []
for a, b in req:
    cut = False
    for i in cutlist:
        if a <= i and i < b:
            cut = True
            break
    if not cut:
        cutlist.append(a)
print(len(cutlist))


Fixed submission:
import sys
n, m = map(int, sys.stdin.readline().split())
req = [ list(sorted(map(int, sys.stdin.readline().split())))
        for _ in range(m) ]
req.sort(reverse=True)
lastcut = None
c = 0
for a, b in req:
    if lastcut is None or a > lastcut or lastcut >= b:
        lastcut = a
        c += 1
print(c)

Buggy python submission (verdict: Time Limit Exceeded):
import sys
n, m = map(int, sys.stdin.readline().split())
req = [ list(sorted(map(int, sys.stdin.readline().split())))
        for _ in range(m) ]
req.sort(reverse=True)
c = 0
while req:
    i = req[0][0]
    c += 1
    newreq = []
    for r in req:
        if r[1] <= i:
            newreq.append(r)
    req = newreq
print(c)

Fixed submission:
import sys
n, m = map(int, sys.stdin.readline().split())
req = [ list(sorted(map(int, sys.stdin.readline().split())))
        for _ in range(m) ]
req.sort(reverse=True)
lastcut = None
c = 0
for a, b in req:
    if lastcut is None or a > lastcut or lastcut >= b:
        lastcut = a
        c += 1
print(c)
Buggy python submission (verdict: Runtime Error):
import sys
import math

t = int(sys.stdin.readline())
for _ in range(t):
    a, b, c, d = map(int, sys.stdin.readline().split())
    if a < b:
        print("No")
    elif d < b:
        print("No")
    elif c >= b:
        print("Yes")
    else:
        g = math.gcd(b, d)
        if b - g + (a % g) > c:
            print("No")
        else:
            print("Yes")

Fixed submission:
import sys

def gcd(x, y):
    x, y = sorted([x, y])
    while y % x:
        y, x = x, y % x
    return x

t = int(sys.stdin.readline())
for _ in range(t):
    a, b, c, d = map(int, sys.stdin.readline().split())
    if a < b:
        print("No")
    elif d < b:
        print("No")
    elif c >= b:
        print("Yes")
    else:
        g = gcd(b, d)
        if b - g + (a % g) > c:
            print("No")
        else:
            print("Yes")
Buggy python submission (verdict: Runtime Error):
X=int(input())
N=0
n=0
N=X//500
n=(X-N*500)//5
input(N*1000+5*n)

Fixed submission:
X=int(input())
N=0
n=0
if X==0:
    print(0)
else:
    N=X//500
    n=(X-N*500)//5
    print(N*1000+5*n)
Buggy python submission (verdict: Runtime Error):
from operator import itemgetter
n=int(input())
xl=[list(map(int,input().split()))for i in range(n)]
R=[list(xl[i][0]-xl[i][1],xl[i][0]+xl[i][1]) for i in range(n)]
r=sorted([(R[i][0],R[i][1]) for i in range(n)],key=itemgetter(1))
s=r[0][1]
ans=1
for i in range(n-1):
    if r[i+1][0]>=s:
        s=r[i+1][1]
        ans+=1
print(ans)

Fixed submission:
from operator import itemgetter
n=int(input())
xl=[list(map(int,input().split()))for i in range(n)]
R=[(xl[i][0]-xl[i][1],xl[i][0]+xl[i][1]) for i in range(n)]
r=sorted([(R[i][0],R[i][1]) for i in range(n)],key=itemgetter(1))
s=r[0][1]
ans=1
for i in range(n-1):
    if r[i+1][0]>=s:
        s=r[i+1][1]
        ans+=1
print(ans)

Buggy python submission (verdict: Runtime Error):
from operator import itemgetter
n=int(input())
xl=[list(map(int,input().split()))for i in range(N)]
R=[list(xl[i][0]-xl[i][1],xl[i][0]+xl[i][1]) for i in range(n)]
r=sorted([(R[i][0],R[i][1]) for i in range(n)],key=itemgetter(1))
s=r[0][1]
ans=1
for i in range(n-1):
    if r[i+1][0]>=s:
        s=r[i+1][1]
        ans+=1
print(ans)

Fixed submission:
from operator import itemgetter
n=int(input())
xl=[list(map(int,input().split()))for i in range(n)]
R=[(xl[i][0]-xl[i][1],xl[i][0]+xl[i][1]) for i in range(n)]
r=sorted([(R[i][0],R[i][1]) for i in range(n)],key=itemgetter(1))
s=r[0][1]
ans=1
for i in range(n-1):
    if r[i+1][0]>=s:
        s=r[i+1][1]
        ans+=1
print(ans)

Buggy python submission (verdict: Runtime Error):
from operator import itemgetter
n=int(input())
xl=[list(map(int,input().split()))for i in range(N)]
R=[list(xl[i][0]-xl[i][1],xl[i][0]+xl[i][1]) for i in range(n)]
r=sorted([(R[i][0],R[i][1]) for i in range(n)],key=itemgetter(1))
s=r[0][1]
ans=1
for i in range(n-1):
    if r[i+1][0]>s:
        s=r[i+1][1]
        ans+=1
print(ans)

Fixed submission:
from operator import itemgetter
n=int(input())
xl=[list(map(int,input().split()))for i in range(n)]
R=[(xl[i][0]-xl[i][1],xl[i][0]+xl[i][1]) for i in range(n)]
r=sorted([(R[i][0],R[i][1]) for i in range(n)],key=itemgetter(1))
s=r[0][1]
ans=1
for i in range(n-1):
    if r[i+1][0]>=s:
        s=r[i+1][1]
        ans+=1
print(ans)

Buggy python submission (verdict: Runtime Error):
from operator import itemgetter
n=int(input())
xl=[list(map(int,input().split()))for i in range(N)]
R=[list(xl[i][0]-xl[i][1],xl[i][0]+xl[i][1]) for i in range(n)]
r=sorted([(R[i][0],R[i][1]) for i in range(n)],key=itemgetter(1))
s=r[0][1]
ans=1
for i in range(1,n):
    if r[i][0]>s:
        s=r[i][1]
        ans+=1
print(ans)

Fixed submission:
from operator import itemgetter
n=int(input())
xl=[list(map(int,input().split()))for i in range(n)]
R=[(xl[i][0]-xl[i][1],xl[i][0]+xl[i][1]) for i in range(n)]
r=sorted([(R[i][0],R[i][1]) for i in range(n)],key=itemgetter(1))
s=r[0][1]
ans=1
for i in range(n-1):
    if r[i+1][0]>=s:
        s=r[i+1][1]
        ans+=1
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
A,B,K=map(int,input().split())
for i in range(K):
    if A>0 :
        A=A-1
    elif B>0 :
        B=B-1
    else :
        break
print(A,B)

Fixed submission:
A,B,K=map(int,input().split())
if A>=K :
    print(A-K,B)
elif A+B>=K :
    print(0,A+B-K)
else :
    print(0,0)
Buggy python submission (verdict: Runtime Error):
あ

Fixed submission:
A,B=map(int,input().split())
import math
print(math.ceil((B-1)/(A-1)))
Buggy python submission (verdict: Runtime Error):
A,B=int(input())
print(max(A+B,A-B,A*B))

Fixed submission:
A,B=map(int,input().split())
print(max(A+B,A-B,A*B))
Buggy python submission (verdict: Runtime Error):
N,L=map(int,input().split())
souwa=(L-1)*N+N*(N+1)//2
print(souwa-L if L>=0 else souwa if -N+1<=L<0 else souwa-(L+i-1) )

Fixed submission:
N,L=map(int,input().split())
souwa=(L-1)*N+N*(N+1)//2
print(souwa-L if L>=0 else souwa if -N+1<=L<0 else souwa-(L+N-1) )
Buggy python submission (verdict: Time Limit Exceeded):
K,S=map(int,input().split())
N=0
for X in range(K+1):
    for Y in range(K+1):
        for Z in range(K+1):
            if X+Y+Z==S:
                N+=1
print(N)

Fixed submission:
K,S=map(int,input().split())
N=0
for X in range(K+1):
    for Y in range(K+1):
            if X+Y<=S and S-Y-X<=K:
                N+=1
print(N)

Buggy python submission (verdict: Time Limit Exceeded):
K,S=map(int,input().split())
N=0
for X in range(K+1):
    for Y in range(K+1):
        for Z in range(K+1):
            if X+Y+Z==S:
                N+=1
print(N)

Fixed submission:
K,S=map(int,input().split())
N=0
for X in range(K+1):
    for Y in range(K+1):
            if X+Y<=S and S-Y-X<=K:
                N+=1
print(N)
Buggy python submission (verdict: Runtime Error):
S = input()
T = input()
S = list(S)
T = list(T)
l = len(S)
if S == T[:-1] and l<=10 and l>=1 and S.islower():
    print(True)
else:
    print(False)

Fixed submission:
S = input()
T = input()
l = len(S)
if S == T[:-1] and l<=10 and l>=1 and S.islower():
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
moji = [input() for i in range(2)]
if len(moji[0]) >= 1 and len(moji[0]) <= 10 and len(moji[0])+1 = len(moji[1]):
  print("Yes")
else:
  print("No")

Fixed submission:
moji = [input() for i in range(2)]
if len(moji[0]) >= 1 and len(moji[0]) <= 10 and len(moji[0])+1 == len(moji[1]) and moji[0] == moji[1][:len(moji[0])]:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
moji = [input() for i in range(2)]
if len(moji(0)) >= 1 and len(moji(0)) <= 10 and len(moji(0))+1 = len(moji(1)):
  print("Yes")
else:
  print("No")

Fixed submission:
moji = [input() for i in range(2)]
if len(moji[0]) >= 1 and len(moji[0]) <= 10 and len(moji[0])+1 == len(moji[1]) and moji[0] == moji[1][:len(moji[0])]:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
def main():
    s = str(input()).split(' ');
    cnt = []
    for n1 in s:
        cnt.append(0)
        for n2 in s:
            if n1 == n2:
                cnt[-1] += 1
#    print(cnt)
    for i in cnt[:-1]:
        if i == 2:
            print('Yes')
            break
    else:
        print('No')


main()


Fixed submission:
def main():
    s = str(input()).split(' ');
    cnt = []
    for n1 in s:
        cnt.append(0)
        for n2 in s:
            if n1 == n2:
                cnt[-1] += 1
#    print(cnt)
    for i in cnt[:-1]:
        if i == 2:
            print('Yes')
            break
    else:
        print('No')


main()

Buggy python submission (verdict: Runtime Error):

def main():
    s = input().split(' ');
    cnt = []
    for n1 in s:
        cnt.append(0)
        for n2 in s:
            if n1 == n2:
                cnt[-1] += 1
#    print(cnt)
    for i in cnt[:-1]:
        if i == 2:
            print('Yes')
            break
    else:
        print('No')


main()


Fixed submission:
def main():
    s = str(input()).split(' ');
    cnt = []
    for n1 in s:
        cnt.append(0)
        for n2 in s:
            if n1 == n2:
                cnt[-1] += 1
#    print(cnt)
    for i in cnt[:-1]:
        if i == 2:
            print('Yes')
            break
    else:
        print('No')


main()

Buggy python submission (verdict: Runtime Error):

def main():
    s = input().split(' ');
    cnt = []
    for n1 in s:
        cnt.append(0)
        for n2 in s:
            if n1 == n2:
                cnt[-1] += 1
#    print(cnt)
    for i in cnt[:-1]:
        if i == 2:
            print('Yes')
            break
    else:
        print('No')


main()


Fixed submission:
def main():
    s = str(input()).split(' ');
    cnt = []
    for n1 in s:
        cnt.append(0)
        for n2 in s:
            if n1 == n2:
                cnt[-1] += 1
#    print(cnt)
    for i in cnt[:-1]:
        if i == 2:
            print('Yes')
            break
    else:
        print('No')


main()
Buggy python submission (verdict: Runtime Error):
s=input()
t=input()
if s==t[:-1]
	print("Yes")
else:
  	print("No")

Fixed submission:
s=input()
t=input()
if s==t[:-1]:
	print("Yes")
else:
  	print("No")

Buggy python submission (verdict: Runtime Error):
s = input()
t = input()
if s==t[:-1]
	print("Yes")
else:
  	print("No")

Fixed submission:
s=input()
t=input()
if s==t[:-1]:
	print("Yes")
else:
  	print("No")

Buggy python submission (verdict: Runtime Error):
s = input()
t = input()
if s==t[:-1]
	print("Yes")
else:
  print("No")

Fixed submission:
s=input()
t=input()
if s==t[:-1]:
	print("Yes")
else:
  	print("No")

Buggy python submission (verdict: Runtime Error):
s,t=map(int,input().split())
print("No" if t>=s else "Yes")

Fixed submission:
s=input()
t=input()
if s==t[:-1]:
	print("Yes")
else:
  	print("No")

Buggy python submission (verdict: Runtime Error):
s,t=map(int,input().split())
print("Yes" if t>=s else "No")

Fixed submission:
s=input()
t=input()
if s==t[:-1]:
	print("Yes")
else:
  	print("No")

Buggy python submission (verdict: Runtime Error):
s,t=map(int,input().split())
print("Yes" if t>s else "No")

Fixed submission:
s=input()
t=input()
if s==t[:-1]:
	print("Yes")
else:
  	print("No")