Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
b,k = map(int,input().split())
a = list(map(int,input().split()))

i = 0
his = []
n = 0
his.append(0)
while(1):
    #print(his)
    i = a[i] - 1
    if i not in his:
        his.append(i)
    else:
        n = len(his)-his.index(i)
        break
m = len(his) - n
p = 0
if k > m:
    p = (k-m)%n + m
else:
    p = k
i = 0
#print(n,m,p)
for j in range(p):
    #print(a[i])
    i = a[i] - 1
print(i+1)



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

i = 0
check = [True]*b
his = []
n = 0
his.append(0)
while(1):
    #print(his)
    i = a[i] - 1
    if check[i]:
        check[i] = False
        his.append(i)
    else:
        n = len(his)-his.index(i)
        break
m = len(his) - n
p = 0
if k > m:
    p = (k-m)%n + m
else:
    p = k
i = 0
#print(n,m,p)
for j in range(p):
    #print(a[i])
    i = a[i] - 1
print(i+1)
Buggy python submission (verdict: Runtime Error):
def inN():
    return int(input())
def inL():
    return list(map(int,input().split()))
def inNL(n):
    return [list(map(int,input().split())) for i in range(n)]

a,b,n = inL()

i = 0

l = [0]*(b+1)
for i in range(1,min(b,n)+1):
    l[i] = int(a*i/b)-a*int(i/b)


print(max(l)) 


Fixed submission:
def inN():
    return int(input())
def inL():
    return list(map(int,input().split()))
def inNL(n):
    return [list(map(int,input().split())) for i in range(n)]

a,b,n = inL()

x = min(b-1,n)
print(int(a*x/b)-a*int(x/b))

Buggy python submission (verdict: Runtime Error):
def inN():
    return int(input())
def inL():
    return list(map(int,input().split()))
def inNL(n):
    return [list(map(int,input().split())) for i in range(n)]

a,b,n = inL()

i = 0

l = [0]*b
for i in range(1,min(b,n)+1):
    l[i] = int(a*i/b)-a*int(i/b)
    #if (q <= p):
        #break

print(max(l)) 


Fixed submission:
def inN():
    return int(input())
def inL():
    return list(map(int,input().split()))
def inNL(n):
    return [list(map(int,input().split())) for i in range(n)]

a,b,n = inL()

x = min(b-1,n)
print(int(a*x/b)-a*int(x/b))
Buggy python submission (verdict: Runtime Error):
n,k = map(int,input().split())
a = list(map(int,input().split()))
cost = [0] * n
cost[1] = abs(a[1]-a[0])
mi = 999999
for i in range(1,n):
    for j in range(max(0,i-k),i):
        #print(j,mi)
        mi = min(mi,cost[j]+abs(a[i]-a[j]))
    cost[i] = mi
    mi = 999999
#print(cost)
print(cost[n])

Fixed submission:
import sys
n,k = map(int,input().split())
a = list(map(int,input().split()))
cost = [0] * n
cost[1] = abs(a[1]-a[0])
mi = sys.maxsize
for i in range(1,n):
    for j in range(max(0,i-k),i):
        mi = min(mi,cost[j]+abs(a[i]-a[j]))
        #print(j,mi)
    
    cost[i] = mi
    mi = sys.maxsize
#print(cost)
print(cost[n-1])
Buggy python submission (verdict: Runtime Error):
class Data:
    def __init__(self,n):
        self.n = n
        self.abc = []
        self.sum = 0
        self.history = [-1]*n
        self.ava = [[1,2],[0,2],[0,1]]

    def change_his(self,i):
        a = self.abc[i-1][self.history[i]] + max(self.abc[i][self.ava[self.history[i]][0]],self.abc[i][self.ava[self.history[i]][1]])
        b = max(self.abc[i-1][self.ava[self.history[i]][0]],self.abc[i-1][self.ava[self.history[i]][1]]) + self.abc[i][self.history[i]]
        if a>b:
            self.history[i] = self.abc[i].index( max(self.abc[i][self.ava[self.history[i]][0]],self.abc[i][self.ava[self.history[i]][1]]))
            
        elif a==b:
            self.history[i] = self.abc[i].index( max(self.abc[i][self.ava[self.history[i]][0]],self.abc[i][self.ava[self.history[i]][1]]))
        else:
            self.history[i-1] = self.abc[i].index(max(self.abc[i-1][self.ava[self.history[i]][0]],self.abc[i-1][self.ava[self.history[i]][1]]))
            if(self.history[i-1]==self.history[i-2]):
                self.change_his(i-1)
        return

    def input_abc(self):
        for i in range(self.n):
            self.abc.append(list(map(int,input().split())))

    def init(self):
        #print(self.abc)
        self.history[0] = self.abc[0].index(max(self.abc[0]))
    
    def count(self):
        for i in range(self.n):
            self.sum += self.abc[i][self.history[i]]

def main():
    n = int(input())
    data = Data(n)
    data.input_abc()
    data.init()
    for i in range(1,n):
        data.history[i] = data.abc[i].index(max(data.abc[i]))
        if(data.history[i-1] == data.history[i]):
            data.change_his(i)
    data.count()
    print(data.sum)

if __name__ == "__main__":
    main()

Fixed submission:
class Data:
    def __init__(self,n):
        self.n = n
        self.abc = []
        self.dp = [[0,0,0]]

    def input_abc(self):
        for i in range(self.n):
            self.abc.append(list(map(int,input().split())))
    
    def chmax(self,i,j,k):
        a = self.dp[i-1][j] + self.abc[i-1][k]
        b = self.dp[i][k]
        if (a>b):
            self.dp[i][k] = a
        #print("j",j,"k",k,a,b,"\n",self.dp)
def main():
    n = int(input())
    data = Data(n)
    data.input_abc()
    for i in range(1,n+1):
        data.dp.append([0,0,0])
        for j in range(3):
            for k in range(3):
                if j != k:
                    data.chmax(i,j,k)
    print(max(data.dp[i]))

if __name__ == "__main__":
    main()
Buggy python submission (verdict: Runtime Error):
def val(lst):
    m = list([lst[i] for i in range(len(lst)) if lst[i] < 0])
    p = list([lst[i] for i in range(len(lst)) if lst[i] >= 0])
    if (len(m) == 0):
        return max(p)
    elif(len(p) == 0):
        return abs(min(m))
    elif abs(min(m)) > max(p):
        return abs(min(m))+max(p)*2
    else:
        return abs(min(m))*2 + max(p)

n,k = map(int,input().split())
x = list(map(int,input().split()))
sa = n-k
p = 0
for i in range(len(x)):
    if x[i] >= 0:
        p = i
        break

start = 0
if p-k > 0:
    start = p-k
    
end = p+1
if end+k > len(x):
    end = len(x)-k+1

value = []
for i in range(start,end):
    lst = x[i:i-sa if i-sa <= 0 else None]
    print(i,":",i-sa)
    print(lst)
    value.append(val(lst))
print(min(value))

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

mi = sys.maxsize

for i in range(n-k+1):
    l = x[i]
    r = x[i+k-1]
    #print(l,r)
    vall = abs(l) + abs(r - l)
    valr = abs(r) + abs(r - l)
    mi = min(mi,min(vall,valr))

print(mi)
Buggy python submission (verdict: Runtime Error):
n = int(input())
f = True

if n%7 == 0:
    print("Yes")
    f = False

while(n > 0)and(f):
    if(n%4 == 0):
        print("Yes")
        f = False
    n -= 7
if(f):
    print("No")

Fixed submission:
n,k = map(int,input().split())
print(-(-(n%k) // k))
Buggy python submission (verdict: Time Limit Exceeded):
def cont(ob,j):
    if (ob <= 0):
            return 0
    for i in range(len(j)):
        ob -= j[i]
        if (ob <= 0):
            return i+1
    return 9999

d,ob = map(int,input().split())
lst = []
point = []
kai = [[0 for i in range(ob//100)] for j in range(d)]

for i in range(d):
    lst =[]
    a = list(map(int,input().split()))
    for j in range(a[0]):
        lst.append((i+1)*100)
    lst[j] += a[1]
    point.append(lst)


for i in range(len(kai)):
    for j in range(len(kai[0])):
        if i == 0:
            kai[i][j] = cont((j+1)*100,point[i])
        else:
            if(sum(point[i])<(j+1)*100):
                a = kai[i-1][j]
                b = len(point[i]) + kai[i-1][j-sum(point[i])//100 ]
                if a>b:
                    kai[i][j] = b
                else:
                    kai[i][j] = a
            else:
                a = kai[i-1][j]
                b = cont((j+1)*100,point[i])
                if a>b:
                    kai[i][j] = b
                else:
                    kai[i][j] = a
        #print(kai)

#print(point)
print(kai[len(kai)-1][len(kai[0])-1])




Fixed submission:
def cont(ob,j):
    if (ob <= 0):
            return 0
    for i in range(len(j)):
        ob -= j[i]
        if (ob <= 0):
            return i+1
    return 9999
 
d,ob = map(int,input().split())
lst = []
point = []
kai = [[0 for i in range(ob//100)] for j in range(d)]
 
for i in range(d):
    lst =[]
    a = list(map(int,input().split()))
    for j in range(a[0]):
        lst.append((i+1)*100)
    lst[j] += a[1]
    point.append(lst)
 
 
for i in range(len(kai)):
    for j in range(len(kai[0])):
        if i == 0:
            kai[i][j] = cont((j+1)*100,point[i])
        else:
            if(sum(point[i])<(j+1)*100):
                a = kai[i-1][j]
                b = len(point[i]) + kai[i-1][j-sum(point[i])//100 ]
                if a>b:
                    kai[i][j] = b
                else:
                    kai[i][j] = a
            else:
                a = kai[i-1][j]
                b = cont((j+1)*100,point[i])
                if a>b:
                    kai[i][j] = b
                else:
                    kai[i][j] = a
        #print(kai)
 
#print(point)
print(kai[len(kai)-1][len(kai[0])-1])
Buggy python submission (verdict: Runtime Error):
from functools import reduce
from fractions import gcd
n = input()
a = list(map(int,input().split()))
gd = reduce(gcd,a)
m = reduce(lambda a,b: a*b,a)/gd -1
sum = sum(map(lambda x: m%x,a))

print(int(sum))

Fixed submission:
from functools import reduce
from fractions import gcd

n = input()
a = list(map(int,input().split()))
gd = reduce(gcd,a)
m = reduce(lambda a,b: a*b,a)//gd -1
sum = sum(map(lambda x: m%x,a))

print(int(sum))

Buggy python submission (verdict: Runtime Error):
from numpy import array,lcm
n = input()
a = array([int(e) for e in input().split()])
m = lcm.reduce(a) - 1
sum = 0

for i in range(len(a)):
    sum += m%a[i]

print(sum)

Fixed submission:
from functools import reduce
from fractions import gcd

n = input()
a = list(map(int,input().split()))
gd = reduce(gcd,a)
m = reduce(lambda a,b: a*b,a)//gd -1
sum = sum(map(lambda x: m%x,a))

print(int(sum))

Buggy python submission (verdict: Runtime Error):
import numpy as np
n = input()
a = np.array([int(e) for e in input().split()])
m = np.lcm.reduce(a) - 1
sum = 0

for i in range(len(a)):
    sum += m%a[i]
print(sum)


Fixed submission:
from functools import reduce
from fractions import gcd

n = input()
a = list(map(int,input().split()))
gd = reduce(gcd,a)
m = reduce(lambda a,b: a*b,a)//gd -1
sum = sum(map(lambda x: m%x,a))

print(int(sum))
Buggy python submission (verdict: Runtime Error):
nums = [int(e) for e in input().split()]
if(num[1] == 100):
    print(pow(100,nums[0])*(nums[1]+1))
else:
    print(pow(100,nums[0])*nums[1])

Fixed submission:
nums = [int(e) for e in input().split()]
if(nums[1] == 100):
    print(pow(100,nums[0])*(nums[1]+1))
else:
    print(pow(100,nums[0])*nums[1])
Buggy python submission (verdict: Time Limit Exceeded):
lst = [2184, 2126, 1721, 1800, 1024, 2528, 3360, 1945, 1280, 1776]
n = input()
lst = [int(e) for e in input().split()]
count = 0
f = True
while(f):
    f = False
    for i in range(len(lst)):
        if(lst[i]%2 == 0):
            m = i
            f = True
            break

    if(f):
        count += 1
    else:
        break

    for i in range(len(lst)):
        if (lst[i]%2 == 0)and(lst[i] > lst[m]):
            m = i

    for i in range(len(lst)):
        if (i == m):
            lst[i] = int(lst[i]/2)
        else:
            lst[i] *= 3 
print(count)

Fixed submission:
n = input()
lst = [int(e) for e in input().split()]

count = 0
m = 0
f = True
while(f):
    f = False
    for i in range(m,len(lst)):
        if(lst[i]%2 == 0):
            m = i
            f = True
            break
    if(f):
        count += 1
    else:
        break

    lst[m] = int(lst[m]/2)

print(count)
Buggy python submission (verdict: Time Limit Exceeded):
N,Y = map(int,input().split())
satu = [10000,5000,1000]
lst = []
flag = True
for i in range(N+1):
    for j in range(N+1):
        if(N-i-j)>=0:
            lst.append([i,j,N-i-j])
        else:
            break

for i in range(len(lst)):
    gaku = 10000*lst[i][0] + 5000*lst[i][1] + 1000*lst[i][2]
    if gaku == Y:
        print(lst[i][0],lst[i][1],lst[i][2])
        flag = False
        break
if flag:
    print("-1 -1 -1")


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

satu = [1000,5000,10000]

sen = [1000 * i for i in range(n+1)]
gsen = [5000 * i for i in range(n+1)]
man = [10000 * i for i in range(n+1)]

#print(sen,gsen,man)
for i in range(n+1):
    for j in range(n+1-i):
        if man[i]+ gsen[j] + sen[n-i-j] == y:
            print(i,j,n-i-j)
            exit()

print("-1 -1 -1")

Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
N,Y = map(int,input().split())
satu = np.array([10000,5000,1000])
lst = []
flag = True
for i in range(N+1):
    for j in range(N+1):
        if(N-i-j)>=0:
            lst.append(np.array([i,j,N-i-j]))
for i in range(len(lst)):
    gaku = np.dot(satu,lst[i])
    if gaku == Y:
        print(lst[i][0],lst[i][1],lst[i][2])
        #print("{} {} {}".format(lst[i]))
        flag = False
        break
if flag:
    print("-1 -1 -1")


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

satu = [1000,5000,10000]

sen = [1000 * i for i in range(n+1)]
gsen = [5000 * i for i in range(n+1)]
man = [10000 * i for i in range(n+1)]

#print(sen,gsen,man)
for i in range(n+1):
    for j in range(n+1-i):
        if man[i]+ gsen[j] + sen[n-i-j] == y:
            print(i,j,n-i-j)
            exit()

print("-1 -1 -1")

Buggy python submission (verdict: Runtime Error):
import numpy as np
N,Y = map(int,input().split())
satu = np.array([10000,5000,1000])
lst = []
flag = True
for i in range(N+1):
    for j in range(N+1):
        if(N-i-j)>=0:
            lst.append(np.array([i,j,N-i-j]))
for i in range(len(lst)):
    gaku = np.dot(satu,lst[i])
    if gaku == Y:
        print(lst[i][0],lst[i][1],lst[i][2])
        #print("{} {} {}".format(lst[i]))
        flag = False
        break
if flag:
    print("-1 -1 -1")


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

satu = [1000,5000,10000]

sen = [1000 * i for i in range(n+1)]
gsen = [5000 * i for i in range(n+1)]
man = [10000 * i for i in range(n+1)]

#print(sen,gsen,man)
for i in range(n+1):
    for j in range(n+1-i):
        if man[i]+ gsen[j] + sen[n-i-j] == y:
            print(i,j,n-i-j)
            exit()

print("-1 -1 -1")
Buggy python submission (verdict: Time Limit Exceeded):
k,s = map(int,input().split())
cnt = 0
for x in range(k+1):
    for y in range(k+1):
        for z in range(k+1):
            if(x+y+z)==s:
                cnt += 1
            elif(x+y+z)>s:
                break
print(cnt)

Fixed submission:
k,s = map(int,input().split())
cnt = 0
for x in range(k+1):
    for y in range(k+1):
        z = s-x-y
        if(z>=0 and z<=k):
            cnt += 1
print(cnt)

Buggy python submission (verdict: Time Limit Exceeded):
k,s = map(int,input().split())
cnt = 0
for x in range(k+1):
    for y in range(k+1):
        for z in range(k+1):
            if(x+y+z)==s:
                cnt += 1
print(cnt)

Fixed submission:
k,s = map(int,input().split())
cnt = 0
for x in range(k+1):
    for y in range(k+1):
        z = s-x-y
        if(z>=0 and z<=k):
            cnt += 1
print(cnt)

Buggy python submission (verdict: Time Limit Exceeded):
k,s = map(int,input().split())
cnt = 0
for x in range(k+1):
    for y in range(k+1):
        for z in range(k+1):
            if(x+y+z)==s:
                cnt += 1
print(cnt)

Fixed submission:
k,s = map(int,input().split())
cnt = 0
for x in range(k+1):
    for y in range(k+1):
        z = s-x-y
        if(z>=0 and z<=k):
            cnt += 1
print(cnt)
Buggy python submission (verdict: Time Limit Exceeded):
x,k,d=map(int,input().split())

x=abs(x)

for i in range(k):
    x=abs(x-d)
print(x)

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

x=abs(x)
kai=x//d
if kai==k:
    print(x%d)
elif kai>k:
    print(x-k*d)
else:
  right=x%d
  left=abs(x%d-d)

  if (kai+k)%2==0:
      print(right)
  else:
      print(left)
Buggy python submission (verdict: Runtime Error):
x=int(input)
if x >=30:
  print("Yes")
else:
  print('No')

Fixed submission:
x=int(input())
if x >=30:
  print("Yes")
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
s=input()
t=input()

sum = 0

for i in range (len(t)):
  if s(i) != t(i):
    sum = sum + 1 
print(sum)

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

sum = 0

for i in range (len(t)):
  if s[i] != t[i] :
    sum = sum + 1 
print(sum)
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a=list(map(int,input().split()))
b=1

for i in range(n):
  b=b*a[i]
if b>10**18:
  print(-1)
else:
  print(b)

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
b=1
for i in range(n):
  if a[i]==0:
    b=0

for i in range(n):
  b=b*a[i]
  if b>10**18:
    b=-1
    break
  
print(b)
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())

int(a*b)

Fixed submission:
import math
from decimal import Decimal
a,b=map(Decimal,input().split())

print(math.floor(a*b))
Buggy python submission (verdict: Runtime Error):
import math
a,b,h,m=map(int,input().split())

if 30*h+m/2-6*m>=0:
  x=30*h+m/2-6*m
else:
  x=6*m-30*h-m/2
  
print((a^2+b^2-2*a*b*math.cos(x))**(1/2))



Fixed submission:
import math
a,b,h,m=map(int,input().split())

if 30*h+m/2-6*m>=0:
  x=30*h+m/2-6*m
else:
  x=6*m-30*h-m/2
  
print((a**2+b**2-2*a*b*math.cos(math.radians(x)))**(1/2))
Buggy python submission (verdict: Runtime Error):
a,b,c,k=map(int,input().split())

if k<=a:
  print(a)
elif a<k and k<=a+b:
  print(a)
else:
  print(2a+b-k)

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

if k<=a:
  print(k)
elif a<k and k<=a+b:
  print(a)
else:
  print(2*a+b-k)
Buggy python submission (verdict: Runtime Error):
k=int(input())
a,b=int(input().split())

if b-a>=k-1:
  print('OK')
else:
  print('NG')

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

i=0

while True:
  if (a+i)%k==0:
    print('OK')
    break
  
  if  a+i==b:
    print('NG')
    break
  
  i+=1
Buggy python submission (verdict: Runtime Error):
N,M=map(int,input().split())
a = list(map(int, input().split()))
list.sort(a, reverse=True)

if a[M-1] < sum(a)/(4*M) :
  print("No")
else:
  print("Yes")


Fixed submission:
X,Y,Z=map(int,input().split())
print(Z,X,Y)
Buggy python submission (verdict: Runtime Error):
X=int(input())
A=math.floor(X/500)
B=math.floor((X-A*500)/5)
print(A*1000+B*5)

Fixed submission:
X=int(input())
A=int(X/500)
B=int((X-A*500)/5)
print(A*1000+B*5)
Buggy python submission (verdict: Runtime Error):
s=input()
n=len(s)
p=n//2
t=1

for i in range(p):
    if s[i]==s[p-1-i]:
        t=1
    else:
        t=0
        break;

x=1

for i in range(p):
    if s[p+1+i]==s[n-1-i]:
        x=1
   else:
       x=0
       break

y=1

for i in range(n):
    if s[i]==s[n-1-i]:
        y=1
   else:
       y=0
       break

if (t==1 and x==1 and y==1):
    print('Yes')
else:
    print('No')

Fixed submission:
s=input()
n=len(s)
p=n//2
t=1

for i in range(p):
    if s[i]==s[p-1-i]:
        t=1
    else:
        t=0
        break;

x=1

for i in range(p):
    if s[p+1+i]==s[n-1-i]:
        x=1
    else:
       x=0
       break

y=1

for i in range(n):
    if s[i]==s[n-1-i]:
        y=1
    else:
       y=0
       break

if (t==1 and x==1 and y==1):
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int(input().split()))
if a==b and a!=c:
  print("Yes")
elif b==c and b!=a:
  print("Yes")
elif c==a and c!=b:
  print("Yes")
else:
  print("No")
  


Fixed submission:
a,b,c=map(int,input().split())
if a==b and a!=c:
  print("Yes")
elif b==c and b!=a:
  print("Yes")
elif c==a and c!=b:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
a,b,c=int(input().split())
if a==b and a!=c:
  print("Yes")
elif b==c and b!=a:
  print("Yes")
elif c==a and c!=b:
  print("Yes")
else:
  print("No")
  


Fixed submission:
a,b,c=map(int,input().split())
if a==b and a!=c:
  print("Yes")
elif b==c and b!=a:
  print("Yes")
elif c==a and c!=b:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
a,b,c=int(input())
if a==b and a!=c:
  print("Yes")
elif b==c and b!=a:
  print("Yes")
elif c==a and c!=b:
  print("Yes")
else:
  print("No")
  


Fixed submission:
a,b,c=map(int,input().split())
if a==b and a!=c:
  print("Yes")
elif b==c and b!=a:
  print("Yes")
elif c==a and c!=b:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
A,B,C=int(input())
if A==B and A!=C:
  print("Yes")
elif B==C and B!=A:
  print("Yes")
elif C==A and C!=B:
  print("Yes")
else:
  print("No")
  


Fixed submission:
a,b,c=map(int,input().split())
if a==b and a!=c:
  print("Yes")
elif b==c and b!=a:
  print("Yes")
elif c==a and c!=b:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
A,B,C=int(input())
if A=B and A!=C:
  print("Yes")
elif B=C and B!=A:
  print("Yes")
elif C=A and C!=B:
  print("Yes")
else:
  print("No")
  

Fixed submission:
a,b,c=map(int,input().split())
if a==b and a!=c:
  print("Yes")
elif b==c and b!=a:
  print("Yes")
elif c==a and c!=b:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
A,B,C=int(input())
if A==B,A!=C: 
   print("Yes")
  elif B==C,B!=A:
      print("Yes")
  elif C==A,C!=B:
    print("Yes")
  else:
    print("No")
       

Fixed submission:
a,b,c=map(int,input().split())
if a==b and a!=c:
  print("Yes")
elif b==c and b!=a:
  print("Yes")
elif c==a and c!=b:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
s=input()

l=len(s)

for i in range(l):
  s[i]="x"
  
  
print(s)


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

l=len(s)

for i in range (l):
  a=a+"x"
print(a)

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

l=len(s)

for i in range(l):
  s[i]=x
  
  
print(s)

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

l=len(s)

for i in range (l):
  a=a+"x"
print(a)
Buggy python submission (verdict: Runtime Error):
h,n=map(int,input().split())
a=list(map(int,input().spliy()))
sum=0
for i in n:
  sum=sum+a[i]
  
if sum >=h:
  print('Yes')
else:
  print('No')


Fixed submission:
h,n=map(int,input().split())
a=list(map(int,input().split()))
sum=0
for i in a:
  sum=sum+i
  
if sum >=h:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
h,n=map(int,input().split())
a=list(map(int,input().spliy()))
sum=0
for i in a:
  sum=sum+i
  
if sum >=h:
  print('Yes')
else:
  print('No')

Fixed submission:
h,n=map(int,input().split())
a=list(map(int,input().split()))
sum=0
for i in a:
  sum=sum+i
  
if sum >=h:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
a,b=map(str,input().split())

if int(a)>=int(b):
  print(str(a)*b)
else:
  print(str(b)*a)


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

if n==m:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Time Limit Exceeded):
a,b,k=map(int,input().split())

i=0
while i<k:
  if a>0:
    a=a-1
    i=i+1
  elif b>0:
    b=b-1
    i=i+1
print(a,b)
  


Fixed submission:
a, b, k = map(int,input().split())
if k >= a + b:
  print("0 0")
elif k>a:
  print ("0 "+str(a+b-k))
else:
  print(str(a-k)+" "+str(b))

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

i=0
while i<k:
  if a>0:
    a=a-1
    i=i+1
  elif b>0:
    b=b-1
    i=i+1
print(a,b)
  

Fixed submission:
a, b, k = map(int,input().split())
if k >= a + b:
  print("0 0")
elif k>a:
  print ("0 "+str(a+b-k))
else:
  print(str(a-k)+" "+str(b))

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

i=o
while i<k:
  if a>0:
    a=a-1
    i=i+1
  elif b>0:
    b=b-1
    i=i+1
print(a,b)
  

Fixed submission:
a, b, k = map(int,input().split())
if k >= a + b:
  print("0 0")
elif k>a:
  print ("0 "+str(a+b-k))
else:
  print(str(a-k)+" "+str(b))
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = input
count = 0
for i in range(n-1):
  if s[i]  != s[i+1];
    count = count + 1
print(count)

Fixed submission:
n = int(input())
s = input()
count = 1
for i in range(n-1):
  if s[i+1]  != s[i]:
    count = count + 1
print(count)
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())

if c > a-b:
  print(b+c-q)
else:
  print(0)

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

if c > a-b:
  print(b+c-a)
else:
  print(0)