Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
import sys
sys.setrecursionlimit(10000)
N,M = map(int,input().split())
graph = [[] for i in range(10**5 + 10)]
dp = [-1 for i in range(10**5 + 10)]

for i in range(M):
    x,y = map(int,input().split())
    graph[x-1].append(y-1)
    
def rec(v):
    if dp[v] != -1:
        return dp[v]
    tmp = 0
    for x in graph[v]:
        r = rec(x)+1
        if tmp < r:
            tmp = r
    dp[v] = tmp
    return dp[v]

result = 0
for i in range(N):
    r = rec(i)
    result = r if r>result else result
print(result)

Fixed submission:
import sys
sys.setrecursionlimit(100000)
N,M = map(int,input().split())
graph = [[] for i in range(10**5 + 10)]
dp = [-1 for i in range(10**5 + 10)]

for i in range(M):
    x,y = map(int,input().split())
    graph[x-1].append(y-1)
    
def rec(v):
    if dp[v] != -1:
        return dp[v]
    tmp = 0
    for x in graph[v]:
        r = rec(x)+1
        if tmp < r:
            tmp = r
    dp[v] = tmp
    return dp[v]

result = 0
for i in range(N):
    r = rec(i)
    result = r if r>result else result
print(result)

Buggy python submission (verdict: Runtime Error):
N,M = map(int,input().split())
graph = [[] for i in range(10**5 + 10)]
dp = [-1 for i in range(10**5 + 10)]

for i in range(M):
    x,y = map(int,input().split())
    graph[x-1].append(y-1)
    
def rec(v):
    if dp[v] != -1:
        return dp[v]
    tmp = 0
    for x in graph[v]:
        r = rec(x)+1
        if tmp < r:
            tmp = r
    dp[v] = tmp
    return dp[v]

result = 0
for i in range(N):
    r = rec(i)
    result = r if r>result else result
print(result)

Fixed submission:
import sys
sys.setrecursionlimit(100000)
N,M = map(int,input().split())
graph = [[] for i in range(10**5 + 10)]
dp = [-1 for i in range(10**5 + 10)]

for i in range(M):
    x,y = map(int,input().split())
    graph[x-1].append(y-1)
    
def rec(v):
    if dp[v] != -1:
        return dp[v]
    tmp = 0
    for x in graph[v]:
        r = rec(x)+1
        if tmp < r:
            tmp = r
    dp[v] = tmp
    return dp[v]

result = 0
for i in range(N):
    r = rec(i)
    result = r if r>result else result
print(result)
Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
N,M,Q = map(int,input().split())
vote = np.array([[0 for _ in range(N)] for _ in range(N)])
for i in range(M):
    l,r = map(int,input().split())
    vote[:l,r-1:] += 1
for i in range(Q):
    p,q = map(int,input().split())
    print(vote[p-1][q-1])

Fixed submission:
N,M,Q = map(int,input().split())
vote = [[0 for _ in range(N+1)] for _ in range(N+1)]
cum = [[0 for _ in range(N+1)] for _ in range(N+1)]
for i in range(M):
    l,r = map(int,input().split())
    vote[l][r] += 1
for i in range(1,N+1):
    for j in range(1,N+1):
        cum[i][j] = vote[i][j]+cum[i-1][j]+cum[i][j-1]-cum[i-1][j-1]
for i in range(Q):
    p,q = map(int,input().split())
    print(cum[q][q]-cum[q][p-1]-cum[p-1][q]+cum[p-1][p-1])

Buggy python submission (verdict: Runtime Error):
import numpy as np
N,M,Q = map(int,input().split())
vote = np.array([[0 for _ in range(N)] for _ in range(N)])
for i in range(M):
    l,r = map(int,input().split())
    vote[:l,r-1:] += 1
for i in range(Q):
    p,q = map(int,input().split())
    print(vote[p-1][q-1])

Fixed submission:
N,M,Q = map(int,input().split())
vote = [[0 for _ in range(N+1)] for _ in range(N+1)]
cum = [[0 for _ in range(N+1)] for _ in range(N+1)]
for i in range(M):
    l,r = map(int,input().split())
    vote[l][r] += 1
for i in range(1,N+1):
    for j in range(1,N+1):
        cum[i][j] = vote[i][j]+cum[i-1][j]+cum[i][j-1]-cum[i-1][j-1]
for i in range(Q):
    p,q = map(int,input().split())
    print(cum[q][q]-cum[q][p-1]-cum[p-1][q]+cum[p-1][p-1])
Buggy python submission (verdict: Runtime Error):
import math
from scipy.special import comb

def comb(n, r, mod):
    num = 1
    denom = 1
    for i in range(r):
        denom = (denom * (i+1)) % mod
        num = (num * (n-i)) % mod
    return num*pow(denom, mod-2, mod)

n, a, b = map(int,input().split())

mod = 10**9 + 7

sum = pow(2, n, mod) - 1
sum -= comb(n, a, mod)
sum -= comb(n, b, mod)

print(int(sum % mod))


Fixed submission:
def com(n, r, mod):
    num = 1
    denom = 1
    for i in range(r):
        denom = (denom * (i+1)) % mod
        num = (num * (n-i)) % mod
    return num*pow(denom, mod-2, mod)

n, a, b = map(int,input().split())

mod = 10**9 + 7

sum = pow(2, n, mod) - 1
sum -= com(n, a, mod)
sum -= com(n, b, mod)

print(int(sum % mod))

Buggy python submission (verdict: Runtime Error):
import math
from scipy.special import comb

def comb(n, r, mod):
    num = 1
    denom = 1
    for i in range(r):
        denom = (denom * (i+1)) % mod
        num = (num * (n-i)) % mod
    return num*pow(denom, mod-2, mod)

n, a, b = map(int,input().split())

mod = 10**9 + 7

sum = pow(2, n, mod) - 1
sum -= comb(n, a, mod)
sum -= comb(n, b, mod)

print(int(sum % mod))


Fixed submission:
def com(n, r, mod):
    num = 1
    denom = 1
    for i in range(r):
        denom = (denom * (i+1)) % mod
        num = (num * (n-i)) % mod
    return num*pow(denom, mod-2, mod)

n, a, b = map(int,input().split())

mod = 10**9 + 7

sum = pow(2, n, mod) - 1
sum -= com(n, a, mod)
sum -= com(n, b, mod)

print(int(sum % mod))

Buggy python submission (verdict: Runtime Error):
import math
from scipy.special import comb

def comb(n, r, mod):
    num = 1
    denom = 1
    for i in range(r):
        denom = (denom * (i+1)) % mod
        num = (num * (n-i)) % mod
    return num*pow(denom, mod-2, mod)

n, a, b = map(int,input().split())

mod = 10**9 + 7

sum = pow(2, n, mod) - 1
sum -= comb(n, a, mod)
sum -= comb(n, b, mod)

print(int(sum % mod))


Fixed submission:
def com(n, r, mod):
    num = 1
    denom = 1
    for i in range(r):
        denom = (denom * (i+1)) % mod
        num = (num * (n-i)) % mod
    return num*pow(denom, mod-2, mod)

n, a, b = map(int,input().split())

mod = 10**9 + 7

sum = pow(2, n, mod) - 1
sum -= com(n, a, mod)
sum -= com(n, b, mod)

print(int(sum % mod))
Buggy python submission (verdict: Time Limit Exceeded):
import collections

n = int(input())
s = [input() for i in range(n)]

s.sort()

word = []
num = []
list = []
word.append(s[0])
num.append(1)

for i in range(1, len(s)):
    if s[i] != s[i-1]:
        word.append(s[i])
        num.append(1)
    else:
        num[len(word)-1] += 1

for i in range(len(word)):
    if num[i] == max(num):
        list.append(word[i])

list.sort()

for i in list:
    print(i)


Fixed submission:
n = int(input())

d = {}
for i in range(n):
    s = input()
    if s in d:
        d[s] += 1
    else:
        d[s] = 1

list = []
maxnum = max(d.values())

for i in d:
    if d[i] == maxnum:
        list.append(i)
list.sort()
for i in list:
    print(i)

Buggy python submission (verdict: Time Limit Exceeded):
import collections

n = int(input())
s = [input() for i in range(n)]
c = collections.Counter(s)

list = []

for i in range(len(c)):
    if c.most_common()[i][1] == c.most_common()[0][1]:
        list.append(c.most_common()[i][0])
    else:
        break

list.sort()
for i in list:
    print(i)


Fixed submission:
n = int(input())

d = {}
for i in range(n):
    s = input()
    if s in d:
        d[s] += 1
    else:
        d[s] = 1

list = []
maxnum = max(d.values())

for i in d:
    if d[i] == maxnum:
        list.append(i)
list.sort()
for i in list:
    print(i)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = [input() for i in range(n)]

s.sort()

num = [0 for i in range(n)]

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

for i in range(n):
    if num[i] == max(num):
        print(s[i])


Fixed submission:
n = int(input())

d = {}
for i in range(n):
    s = input()
    if s in d:
        d[s] += 1
    else:
        d[s] = 1

list = []
maxnum = max(d.values())

for i in d:
    if d[i] == maxnum:
        list.append(i)
list.sort()
for i in list:
    print(i)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int,input().split()))

flag = True

for b in a:
    if a.count(b) >= 2:
        flag = False
        break


if flag:
    print('YES')
else:
    print('NO')


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

if len(set(a)) == n:
    print('YES')
else:
    print('NO')

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

flag = True

for b in a:
    if a.count(b) >= 2:
        flag = False


if flag:
    print('YES')
else:
    print('NO')


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

if len(set(a)) == n:
    print('YES')
else:
    print('NO')

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

flag = True

for i in range(n):
    for j in range(n):
        if i != j and a[i] == a[j]:
            flag = False

if flag:
    print('YES')
else:
    print('NO')


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

if len(set(a)) == n:
    print('YES')
else:
    print('NO')
Buggy python submission (verdict: Time Limit Exceeded):
n, k = map(int,input().split())
p = list(map(int,input().split()))

s = []

for i in range(n-k+1):
    s.append(0)
    for j in range(k):
        s[i] += p[i+j]

m = max(s)/2 + k/2

print(m)


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

s = []
sum = 0
for i in range(k):
    sum += p[i]

s.append(sum)

for i in range(1, n-k+1):
    sum = sum - p[i-1] + p[i+k-1]
    s.append(sum)

m = max(s)/2 + k/2

print(m)

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

max = 0

for i in range(n-k+1):
    sum = 0
    for j in range(k):
        sum += p[i+j]
    if sum > max:
        max = sum
        m = i


ave = 0
for i in range(m, m+k):
    ave += (p[i] + 1)/2

print(ave)


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

s = []
sum = 0
for i in range(k):
    sum += p[i]

s.append(sum)

for i in range(1, n-k+1):
    sum = sum - p[i-1] + p[i+k-1]
    s.append(sum)

m = max(s)/2 + k/2

print(m)
Buggy python submission (verdict: Runtime Error):
import math

h, n = map(int,input().split())
a = list(map(int,input().split()))
sum = 0
for i in range(n):
    sum += a[i]

if sum >= h:
    print('Yes')
else:
    print('No')


Fixed submission:
import math
h, a = map(int,input().split())
num = math.ceil(h/a)

print(num)

Buggy python submission (verdict: Runtime Error):
h, n = map(int,input().split())
a = list(map(int,input().split()))
sum = 0
for i in range(n):
    sum += a[i]

if sum >= h:
    print('Yes')
else:
    print('No')


Fixed submission:
import math
h, a = map(int,input().split())
num = math.ceil(h/a)

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

for i in range(k):
    if a >= 1:
        a -= 1
    elif b >= 1:
        b -= 1

print('{} {}'.format(a, b))


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

if a >= k:
    a = a - k
    print('{} {}'.format(a, b))
elif k <= a + b:
    b = b - (k - a)
    a = 0
    print('{} {}'.format(a, b))
else:
    a = 0
    b = 0
    print('{} {}'.format(a, b))
Buggy python submission (verdict: Runtime Error):
import numpy as np
n, m = map(int, input().split())

v = np.zeros((n, m))
a = np.zeros((n,2))


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


aSorted = sorted(a, key=lambda ai: ai[0])

mc = 0
ans = 0
for ai, bi in aSorted:
    if mc + bi <= m:
        mc += bi
        ans += bi * ai
    else:
        mm = m - mc
        ans += mm * ai
        break
print(int(ans))


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

a = np.zeros((n,2))


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


aSorted = sorted(a, key=lambda ai: ai[0])

mc = 0
ans = 0
for ai, bi in aSorted:
    if mc + bi <= m:
        mc += bi
        ans += bi * ai
    else:
        mm = m - mc
        ans += mm * ai
        break
print(int(ans))
Buggy python submission (verdict: Runtime Error):
n,a,b = map(int,input().split())
if a==0:
    print(0)
else :
    x = n/(a+b)
    y =n%(a+b)
    print(x*a+y)

    

Fixed submission:
x = set(input())
print('No' if len(x)==1 else 'Yes')
Buggy python submission (verdict: Runtime Error):
n = int(input())
print(n\\2)

Fixed submission:
import math
n = int(input())
print(math.ceil(n/2))
Buggy python submission (verdict: Runtime Error):
n,k = int(input().split())
if n >= 10:
    print(k)
else :
    print(k+100*(10-n))    

Fixed submission:
n,k = map(int,input().split())
if n >= 10:
    print(k)
else :
    print(k+100*(10-n))
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))
for i in range(a):
    if i%2==0:
        if i%3 !=0 or i%5 !=0:
            print('DENIED')
print('APPROVED')

        
        
                

Fixed submission:
List= list(map(int,input().split()))
List=set(List)
if len(List)==2:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
List= list(int,input().split())
List=set(List)
if len(List)==2:
    print('Yes')
else:
    print('No') 

Fixed submission:
List= list(map(int,input().split()))
List=set(List)
if len(List)==2:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
List= sorted(list(int,input().split()))
if len(List)==2:
    print('Yes')
else:
    print('No') 

Fixed submission:
List= list(map(int,input().split()))
List=set(List)
if len(List)==2:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
List= sorted(int,input().split())
if len(List)==2:
    print('Yes')
else:
    print('No') 

Fixed submission:
List= list(map(int,input().split()))
List=set(List)
if len(List)==2:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))
for i in range(a):
    if i%2==0:
        if i%3 !=0 and i%5 !=0:
            print('DENIED')
            exit()
print('APPROVED')

        
        
                

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
for i in a:
    if i%2==0:
        if i%3 !=0 and i%5 !=0:
            print('DENIED')
            exit()
print('APPROVED')

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))
for i in range(a):
    if i%2==0:
        if i%3 !=0 or i%5 !=0:
            print('DENIED')
print('APPROVED')

        
        
                

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
for i in a:
    if i%2==0:
        if i%3 !=0 and i%5 !=0:
            print('DENIED')
            exit()
print('APPROVED')
Buggy python submission (verdict: Runtime Error):
h,a = map(int,input().split())
print(h\\a)

Fixed submission:
import math
h,a = map(int,input().split())
print(math.ceil(h/a))
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = [int(input()).split() for i range(n)]
print( 'Yes' if max(s) < sum(s)-max(s) else 'No')


Fixed submission:
n = int(input())
s = list(map(int,input().split()))
print( 'Yes' if max(s) < sum(s)-max(s) else 'No')
Buggy python submission (verdict: Runtime Error):
n = int(input())
p = [int(input()).for i in range(n)]
print(sam(p)-p[-1]/2)

Fixed submission:
n = int(input())
p = [int(input()) for i in range(n)]
print(sum(p)-max(p)//2)
Buggy python submission (verdict: Runtime Error):
n = input()
s = n.count(+) - n.count(-)
print(s)

Fixed submission:
n = input()
s = n.count('+') - n.count('-')
print(s)
Buggy python submission (verdict: Runtime Error):
n = input()
print(700 + (n.count('o')*100)

Fixed submission:
n = input()
print(700 +100*n.count('o'))
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
n = a-b
print(n%c)

Fixed submission:
a,b,c = [int(input()) for i in range(3)]
n = a-b
print(n%c)

Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
n = a-b
print(n%b)

Fixed submission:
a,b,c = [int(input()) for i in range(3)]
n = a-b
print(n%c)
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
c = a*b
if c%2 = 0:
    print('Even')
else :
    print('Odd')

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

Fixed submission:
a=input()
print(a.count("1"))
Buggy python submission (verdict: Runtime Error):
n = input()
x = sum(map(int,n))
print('Yes' if n%x == 0 else 'No')


Fixed submission:
n = input()
x = sum(map(int,n))
print('Yes' if int(n)%x == 0 else 'No')
Buggy python submission (verdict: Runtime Error):
n = int(input())
print(int(n**.5)

Fixed submission:
n = int(input())
print(int(n**.5)**2)
Buggy python submission (verdict: Runtime Error):
n = (input)
if 9 in n:
    print('Yes')
else:
    print('No') 

Fixed submission:
n = input()
if '9' in n:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
n = int(input())
if '9' in n:
    print('Yes')
else:
    print('No') 

Fixed submission:
n = input()
if '9' in n:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
n = int(input())
if 9 in n:
    print('Yes')
else:
    print('No') 

Fixed submission:
n = input()
if '9' in n:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
n = list[input().split()]
m = sorted(n)
print(m[0]+m[1])

Fixed submission:
n = list(map(int,input().split()))
m = sorted(n)
print(m[0]+m[1])
Buggy python submission (verdict: Runtime Error):
N,M=map(int,input().split())
A=[list(map(int,input().split())) for _ in range(M)]
 
ans=[0]
for a in A:
    ans[a[0]-1]+=1
    ans[a[1]-1]+=1
 
for a in ans:
    print(a)

Fixed submission:
a,b,c = map(int,input().split())
print('Yes' if a<=c<=b else 'No')
Buggy python submission (verdict: Runtime Error):
N,M=map(int,input().split())
A=[list(map(int,input().split())) for _ in range(M)]
 
ans=[0]
for a in A:
    ans[a[0]-1]+=1
    ans[a[1]-1]+=1
 
for a in ans:
    print(a)

Fixed submission:
N,M =map(int,input().split())
c = []
for i in range(M):
    a,b = map(int,input().split())
    c.append(a)
    c.append(b)
for j in range(N):
    print(c.count(j+1))
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
if a+b =< 23:
    print(a+b)
else:
    print(a+b-24)


Fixed submission:
a,b = map(int,input().split())
if a+b <= 23:
    print(a+b)
else:
    print(a+b-24)
Buggy python submission (verdict: Runtime Error):
import math 
n=int(input())
n =math.factorial(n)
m = (10**9) + 7
if n < m:
    prtint(n)
else :
    print(n%m)

Fixed submission:
import math 
n=int(input())
n =math.factorial(n)
m = (10**9) + 7
print(n%m)
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
print(b,a)


Fixed submission:
a,b,c=input().split(",")
print(a,b,c)
Buggy python submission (verdict: Runtime Error):
n = input()
if 'n' in 'aiueo'
    print('vowel')
else:
    print('consonant')


Fixed submission:
n = input()
if n in 'aiueo':
    print('vowel')
else:
    print('consonant')

Buggy python submission (verdict: Runtime Error):
n = input()
List = [a,i,u,e,o]
if 'n' in List:
    print('vowel')
else:
    print('consonant')

Fixed submission:
n = input()
if n in 'aiueo':
    print('vowel')
else:
    print('consonant')

Buggy python submission (verdict: Runtime Error):
n = input()
List = [a,i,u,e,o]
if n in List:
    print('vowel')
else:
    print('consonant')

Fixed submission:
n = input()
if n in 'aiueo':
    print('vowel')
else:
    print('consonant')
Buggy python submission (verdict: Runtime Error):
List = list(map(int,input().split()))
List2 = sorted(List)
print('Yes' if List2[0] + List2[1] == List2[2] else 'No') ) 


Fixed submission:
List = sorted(list(map(int,input().split())))
print('Yes' if List[0] + List[1] == List[2] else 'No')

Buggy python submission (verdict: Runtime Error):
List = list(map(int,input().split()))
List2 = sorted(List)
print('Yes' if List2[0] + List2[1] == List2[3] else 'No') 

Fixed submission:
List = sorted(list(map(int,input().split())))
print('Yes' if List[0] + List[1] == List[2] else 'No')

Buggy python submission (verdict: Runtime Error):
List = list(map,input().split())
List2 = sorted(List)
print('Yes' if List2[0] + List2[1] == List2[3] else 'No') 

Fixed submission:
List = sorted(list(map(int,input().split())))
print('Yes' if List[0] + List[1] == List[2] else 'No')

Buggy python submission (verdict: Runtime Error):
List = list[input().split()]
List2 = sorted(List)
print('Yes' if List2[0] + List2[1] == List2[3] else 'No') 

Fixed submission:
List = sorted(list(map(int,input().split())))
print('Yes' if List[0] + List[1] == List[2] else 'No')
Buggy python submission (verdict: Runtime Error):
S = input()
S_list = [S]
if S_list[1] == S_list[2] == S_list[3] :
  print("No")
else :
  print("Yes")
	

Fixed submission:
S = input()
if S[0] == S[1] == S[2] :
  print("No")
else :
  print("Yes")

Buggy python submission (verdict: Runtime Error):
S = input()
S_list = [S]
if S_list[1] = S_list[2] = S_list[3] :
  print("No")
else :
  print("Yes")
	

Fixed submission:
S = input()
if S[0] == S[1] == S[2] :
  print("No")
else :
  print("Yes")
Buggy python submission (verdict: Runtime Error):
a , b = map(int, input().split())
for i in range(1 , 10100) :
  a1 = int(i*0.08)
  b1 = int(i*0.10)
  if a1 = a and b1 = b :
    print(i)
  else :
    print(-1)

Fixed submission:
a,b = map(int, input().split())
ans = -1
for i in range(1001) :
  a1 = int(i*0.08)
  b1 = int(i*0.1)
  if a1 == a and b1 == b :
    ans = i
    break
print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
a = 0
for i in range(1,N+1) :
  if i%2 = 1 :
    a += 1
print(a/N)
  




Fixed submission:
N = int(input())
a = 0
for i in range(1,N+1) :
  if i%2 == 1 :
    a += 1
print(a/N)
Buggy python submission (verdict: Runtime Error):
s = input()
if s == "Sunny" :
  print("Cloudy")
elif s = "Cloudy":
  print("Rainy")
else :
  print("Sunny")
    
  

Fixed submission:
s = input()
if s == "Sunny" :
  print("Cloudy")
elif s == "Cloudy":
  print("Rainy")
else :
  print("Sunny")
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = input()
k = int(input())
s_list = list(s) 
for i in range(0 , n) :
    if s_list[i] == s_list[k] :
        s_list[i] = "*"
print(s_list)


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

Buggy python submission (verdict: Runtime Error):
7 3 1

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

Buggy python submission (verdict: Runtime Error):
7 3 1

Fixed submission:
a ,b ,c = map(int,input().split())
if a > c> b or b > c > a :
    print("Yes")
else :
    print("No")
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = input()
k = int(input())
s_list = list(s) 
for i in range(0 , n) :
    if s_list[i] == s_list[k] :
        s_list[i] = "*"
a = "".join(s_list)
print(a)

Fixed submission:
n = int(input())
s = input()
k = int(input())
s_list = list(s) 
for i in range(0 , n) :
    if s_list[i] != s_list[k-1] :
        s_list[i] = "*"
a = "".join(s_list)
print(a)