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

Fixed submission:
import sys
input = sys.stdin.readline

n = int(input())
A = list(map(int,input().split()))

dp = [[-float("INF")]*(n+1) for i in range(n+1)]
low = [-float("INF")]*(n+1)
m = 0
a,b = A[:2]
dp[a][b] = 0
dp[b][a] = 0
low[a] = 0
low[b] = 0
base = 0

for _ in range(1,n):
    a,b,c = A[3*_-1:3*_+2]
    q = []
    if a==b==c:
        base += 1
        continue
    m1 = max(m,max(dp[a][a],dp[b][b],dp[c][c])+1)
    for j in range(3):
        q.append((a,b,max(m,dp[c][c]+1)))
        for i in range(1,n+1):
            q.append((a,i,low[i]))
        if a==b:
            for i in range(1,n+1):
                q.append((c,i,dp[a][i]+1))
                m1 = max(m1,dp[a][i]+1)
        a,b,c = b,c,a
    for a,b,v in q:
        dp[a][b] = max(dp[a][b],v)
        dp[b][a] = max(dp[b][a],v)
        low[a] = max(low[a],v)  
        low[b] = max(low[b],v)      
    m = m1
print(max(m,dp[A[-1]][A[-1]]+1)+base)

Buggy submission (verdict: Runtime Error):
n = int(input())
A = list(map(int,input().split()))

dp = [[-2]*(n+1) for i in range(n+1)]
low = [-2]*(n+1)
col = [-2]*(n+1)
m = 0
dp[A[0]][A[1]] = 0
low[A[0]] = 0
col[A[1]] = 0
base = 0

for _ in range(1,n):
    a,b,c = A[3*_-1:3*_+2]
    q = []
    if a==b==c:
        base += 1
        continue
    if a==b or b==c or c==a:
        if b==c:
            a,b,c = b,c,a
        elif c==a:
            a,b,c = a,c,b
        v = max(m,dp[c][c]+1)
        q.append((3,a,a,v))
        q.append((0,a,v))
        q.append((1,a,v))
        v1 = -2
        for i in range(1,n+1):
            if max(low[i],dp[i][a]+1)>= 0:
                dp[i][c] = max(dp[i][c],low[i],dp[i][a]+1)
                v1 = max(v1,dp[i][c])
                if dp[i][c] > low[i]:
                    q.append((0,i,dp[i][c]))
        q.append((1,c,v1))
        v2 = -2
        for i in range(1,n+1):
            if max(col[i],dp[a][i]+1)>= 0:
                dp[c][i] = max(dp[c][i],col[i],dp[a][i]+1)
                v2 = max(v2,dp[c][i])
                if dp[c][i] > col[i]:
                    q.append((1,i,dp[c][i]))
        q.append((0,c,v2))
        q.append((2,0,max(v,v1,v2)))
    
    else:
        for j in range(3):
            v = max(m,dp[c][c]+1)
            q.append((3,a,b,v))
            q.append((0,a,v))
            q.append((1,a,v))
            
            for i in range(1,n+1):
                if low[i]>= 0:
                    dp[i][c] = low[i]
        
            for i in range(1,n+1):
                if col[i]>= 0:
                    dp[c][i] = col[i]
   
            q.append((2,0,max(v,v1,v2)))

            a,b,c = b,c,a
    for l in q:
        if l[0] == 0:
            low[l[1]] = max(low[l[1]],l[2])
        elif l[0] == 1:
            col[l[1]] = max(col[l[1]],l[2])
        elif l[0] == 2:
            m = max(m,l[2])
        else:
            dp[l[1]][l[2]] = max(dp[l[1]][l[2]],l[3])
        
print(max(m,dp[A[-1]][A[-1]]+1)+base)
Problem p02659 (python)

Fixed submission:
from decimal  import *
a,b = input().split()

b = Decimal(b)
a = Decimal(a)
ans = a*b
print(int(ans))

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

b = decimal(b)

ans = a*b
print(int(ans))
Problem p02729 (python)

Fixed submission:
n,m = map(int,input().split())
print(n*(n-1)//2+m*(m-1)//2)

Buggy submission (verdict: Runtime Error):
def main():
    import numpy as np
    h,w,k = map(int,input().split())
    l = [list(input()) for i in range(h)]

    def check(lis):
        lis.append(h)
        num = [0]*(len(lis))
        ans = 0
        for i in range(w):
            ch = 0
            num2 = [0]*(len(lis))
            for j in range(h):
                
                if l[j][i] == "1":
                    if j <= lis[ch]:
                        num2[ch] += 1
                    else:
                        ch += 1
                        num2[ch] += 1
            if max(num2) > k:
                return float("INF")
            else:
                for i in range(len(num)):
                    num[i] += num2[i]
                    if num[i] > k:
                        ans += 1
                        num = num2
                        break 
            
            
        return ans

    ans = 10**9

    for i in range(2**(h-1)):
        count = 0
        lis1 = []
        for j in range(h-1):
            if (i >> j) & 1:
                lis1.append(j)
                count += 1
        
        ans = min(ans,count+check(lis1))
        
    print(ans)
if __name__ == "__main__":
    main()
Problem p02763 (python)

Fixed submission:
import bisect

n = int(input())
s = list(input())
q = int(input())
l = [[] for i in range(26)]
for i in range(n):
    l[ord(s[i])-ord("a")].append(i)


for i in range(q):
    x,y,z = input().split()
    if int(x) == 1:
        if s[int(y)-1] == z:
            continue
        index = bisect.bisect_left(l[ord(s[int(y)-1])-ord("a")],int(y)-1)
        l[ord(s[int(y)-1])-ord("a")].pop(index)
        index = bisect.bisect_left(l[ord(z)-ord("a")],int(y)-1)
        l[ord(z)-ord("a")].insert(index,int(y)-1)
        s[int(y)-1] = z
    if int(x) == 2:
        count = 0
        for j in l:
            index = bisect.bisect_left(j,int(y)-1)
            if index < len(j) and j[index] < int(z):
                count += 1
        print(count)

Buggy submission (verdict: Runtime Error):
import bisect

n = int(input())
s = list(input())
q = int(input())
l = [[] for i in range(26)]
for i in range(n):
    l[ord(s[i])-ord("a")].append(i)


for i in range(q):
    x,y,z = input().split()
    if int(x) == 1:
        if s[int(y)-1] == z:
            continue
        index = bisect.bisect_left(l[ord(s[int(y)-1])-ord("a")],int(y)-1)
        l[ord(s[int(y)-1])-ord("a")].pop(index)
        index = bisect.bisect_left(l[ord(z)-ord("a")],int(y)-1)
        l[ord(z)-ord("a")].insert(index,int(y)-1)
    if int(x) == 2:
        count = 0
        for j in l:
            index = bisect.bisect_left(j,int(y)-1)
            if index < len(j) and j[index] < int(z):
                count += 1
        print(count)

Buggy submission (verdict: Runtime Error):
import bisect

n = int(input())
s = list(input())
q = int(input())
l = [[] for i in range(26)]
for i in range(n):
    l[ord(s[i])-ord("a")].append(i)
print(l)

for i in range(q):
    x,y,z = input().split()
    if int(x) == 1:
        if s[int(y)-1] == z:
            continue
        index = bisect.bisect_left(l[ord(s[int(y)-1])-ord("a")],int(y)-1)
        l[ord(s[int(y)-1])-ord("a")].pop(index)
        index = bisect.bisect_left(l[ord(z)-ord("a")],int(y)-1)
        l[ord(z)-ord("a")].insert(index,int(y)-1)
    if int(x) == 2:
        count = 0
        for j in l:
            index = bisect.bisect_left(j,int(y)-1)
            if index < len(j) and j[index] < int(z):
                count += 1
        print(count)
Problem p02781 (python)

Fixed submission:
n = int(input())
k = int(input())

dp = [[[0]*(2) for i in range(k+1)] for j in range(len(str(n))+1)]

dp[0][0][0] = 1

for i in range(len(str(n))):
    for j in range(k+1):
        for m in range(2):
            nd = int(str(n)[i])
            for l in range(10):
                ni = i+1
                nj = j
                nm = m
                if l != 0:
                    nj += 1
                if nj > k:
                    continue
                if nm == 0:
                    if  l > nd:
                        continue
                    elif l < nd:
                        nm = 1
                dp[ni][nj][nm] += dp[i][j][m]
print(dp[len(str(n))][k][0]+dp[len(str(n))][k][1])

Buggy submission (verdict: Runtime Error):
n = int(input())
k = int(input())
import math
def comb(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

count = 0
for i in range(1,len(str(n))):
    if i >= k:
        count += 9*comb(i-1,k-1)*(9**(k-1))
        

if k == 1:
    count += int(str(n)[0])
    print(count)
    exit()
if k == 2:
    count += (int(str(n)[0])-1)*9*(len(str(n))-1)
    
    count2 = 0
    for i in range(1,len(str(n))-1):
        if i >= 1:
            count2 += 9*comb(i-1,0)*(9**(0))
    count += int(str(n)[1])    
    print(count+count2)
    exit()

if k == 3:
    count += (int(str(n)[0])-1)*comb(len(str(n))-1,2)*81
    for i in range(1,len(str(n))-1):
        if i >= 2:
            count += 9*comb(i-1,2-1)*(9**(2-1))
    count += (int(str(n)[1])-1)*9*(len(str(n))-2)
    
    count2 = 0
    for i in range(1,len(str(n))-2):
        if i >= 1:
            count2 += 9*comb(i-1,0)*(9**(0))
    count += int(str(n)[2])    
    print(count+count2)
    exit()
Problem p02793 (python)

Fixed submission:
import fractions
n = int(input())
l = list(map(int,input().split()))
if n == 1:
    print(1)
    exit()

def lcm(a,b):
    return a*b//fractions.gcd(a,b)
ans = l[0]
for i in range(1,n):
    ans = lcm(ans,l[i])
    

mod = 10**9+7
a = 0
for i in range(n):
    a += ans//l[i]
    
print(a%mod)

Buggy submission (verdict: Runtime Error):
import fractions
n = int(input())
l = list(map(int,input().split()))

ans = l[0]*l[1]/fractions.gcd(l[0],l[1])
for i in range(2,n):
    ans = ans*l[i]/fractions.gcd(ans,l[i])

mod = 10**9+7
a = 0
for i in range(n):
    a += ans//l[i]
    a %= mod
print(int(a%mod))
Problem p02851 (python)

Fixed submission:
n,k = map(int,input().split())
l = list(map(int,input().split()))
mo = [0]
mod = [0]
for i in range(n):
    a = l[i]%k
    mo.append((a+mo[-1])%k)
    mod.append((mo[-1]-(i+1))%k)
dic = {0:1}
le = 1
ans = 0
for i in range(1,n+1):
    if le < k:
        if mod[i] in dic:
            ans += dic[mod[i]]
            dic[mod[i]] += 1
        else:
            dic[mod[i]] = 1
        le += 1
    else:
        dic[mod[i-k]] -= 1
        if mod[i] in dic:
            ans += dic[mod[i]]
            dic[mod[i]] += 1
        else:
            dic[mod[i]] = 1
    
print(ans)

Buggy submission (verdict: Runtime Error):
n,k = map(int,input().split())
l = list(map(int,input().split()))
mo = [0]
mod = [0]
for i in range(n):
    a = l[i]%k
    mo.append((a+mo[-1])%k)
    mod.append((mo[-1]-(i+1))%k)
dic = {0:1}
le = 1
ans = 0
for i in range(1,n+1):
    if le < k:
        if mod[i] in dic:
            ans += dic[mod[i]]
            dic[mod[i]] += 1
        else:
            dic[mod[i]] = 1
        le += 1
    else:
        dic[mod[i-k]] -= 1
        if mod[i] in dic:
            ans += dic[mod[i]]
            dic[mod[i]] += 1
        else:
            dic[mod[i]] = 1
    print(dic)
print(ans)
Problem p02862 (python)

Fixed submission:
def nCr(n,r,mod = 10**9+7):
    r = min(n-r,r)
    numer = denom = 1
    for i in range(1,r+1):
        numer = numer * (n+1-i) %mod
        denom = denom * i % mod
    return numer * pow(denom,mod-2,mod) %mod
    
x,y = map(int,input().split())
if (x+y) %3 != 0 or not (x <= 2*y and y <= 2*x ):
    print(0)
    exit()
    
a = (x + y) //3
n = y - a

print(nCr(a,n))

Buggy submission (verdict: Runtime Error):
a = (x + y) //3
n = (2*x-y)//3
m = a-n
print(n,m)
def nCr(n,r,mod):
    r = min(r, n-r)
    fact = rial=1
    for i in range(1,r+1):
        fact *= (n+1-i) % mod
        rial *= i %mod
    return fact * pow(rial,mod-2,mod) %mod
    
if (x + y) %3 == 0:
    if 0 < n and 0 < m and (x+y)%3==0:
       
        print(nCr(a,n,mod))
        
    else: 
        print(0)
    
else:
    print(0)
Problem p02879 (python)

Fixed submission:
a,b = map(int,input().split())
if a > 9 or b > 9:
  print(-1)
else:
  print(a*b)

Buggy submission (verdict: Runtime Error):
import math
a,b,x = map(int,input().split())
h = x/(a**2)
if b//2 >= h:

    d = 2*h*a/b

    sin = math.degrees(math.acos(d/((d**2+b**2)**0.5)))
    print(sin)
else:
    d = 2*(b-h)*a/a
    sin = math.degrees(math.acos(d/((d**2+a**2)**0.5)))
    print(90-sin)
Problem p02897 (python)

Fixed submission:
n = int(input())
if n%2==0:
  print(1/2)
else:
  print((n//2+1)/n)

Buggy submission (verdict: Runtime Error):
import fractions

  
def isprime(x):
    count = 1
    for i in range(2,int(x**0.5)+1):
        if x % i == 0:
            count += 1
      
    return count

a,b = map(int,input().split())
g = fractions.gcd(a,b)



ans=0
for i in range(1,int(g**0.5)+1):
    if g % i == 0:
        if isprime(i) == 1:
            ans += 1
        if i != g//i:
            if isprime(g//i) == 1:
                ans += 1
       

print(ans)
Problem p02933 (python)

Fixed submission:
if int(input()) >= 3200:
  print(input())
else:
  print("red")

Buggy submission (verdict: Runtime Error):
from collections import deque

n,q = map(int,input().split())
E = [[] for i in range(n)]
for i in range(n-1):
    a,b = map(int,input().split())
    E[a-1].append(b-1)
    E[b-1].append(a-1)
 

score = [0]*n
for i in range(q):
    a,b = map(int,input().split())
    score[a-1] += b

def bfs(i):
    s = -1
    q = deque([])
    q.append((i-1,s))
    while q:
        
        num,bef = q.pop()
        for j in E[num]:
            if j == bef:
                continue
            else:
                score[j] += score[num]
                q.append((j,num))
            
    return score
print(*bfs(1))
Problem p02987 (python)

Fixed submission:
s = list(input())

s.sort()

if s[0] == s[1] and s[2] == s[3]:
  if s[0] != s[2] and s[1] != s[2]:
    print("Yes")
    exit()
print("No")

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

s.sort()

if s[0] == s[1] and s[2] == s[3]:
  if s[0] != s[2] and s[1] != s[2]:
    print("Yes")
    exit()
print("No")
Problem p03011 (python)

Fixed submission:
a,b,c = map(int,input().split())
print(a+b+c-max(a,b,c))

Buggy submission (verdict: Runtime Error):
h,w = map(int,input().split())
l = [list(input()) for i in range(h)]

c = [[[-1]*2 for i in range(w)] for i in range(h)]

def count(x,y):

    if c[x][y][0] == -1:
        n = 0
        while x+n < h and l[x+n][y] == ".":
            n += 1
        for i in range(n):
            c[x+i][y][0] = n
        
    if c[x][y][1] == -1:
        n = 0
        while y+n < w and l[x][y+n] == ".":
            n += 1
        for i in range(n):
            c[x][y+i][1] = n

    return c[x][y][0]+c[x][y][1]
ans = 0
for i in range(h):
    for j in range(w):
        if l[i][j] == ".":
            ans = max(ans,count(i,j))
print(ans-1)
Problem p03013 (python)

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

check = [1]*(n+1)
check.append(0)
check.append(0)
for i in range(m):
    a = int(input())
    check[a] = 0
    

count = [0]*(n+2)

mod = 10**9+7
if check[0]==1:
    count[0] = 1
    
elif count[0] == 0:
    count[1] = 1

for i in range(1,n+2):
    count[i] += count[i-1] + count[i-2]
    count[i] %= mod
    if check[i] == 0:
        count[i] = 0
    
    
print(count[n]%mod)

Buggy submission (verdict: Runtime Error):
n,m = map(int,input().split())

check = [1]*(n)
check.append(0)
check.append(0)
be = int(input())
check[be-1] = 0
check[be-2] = 2
for i in range(m-1):
    a = int(input())
    if a == be+1:
        print(0)
        exit()
    else:
        check[a-1] = 0
        check[a-2] = 2
        be = a
        

count = [0]*(n+2)

mod = 10**9+7
if check[0]==1:
    count[0] = 1
    count[1] = 2
elif count[0] == 0:
    count[1] = 1

for i in range(1,n-1):
    if check[i+1] == 0:
        count[i+2] = count[i]%mod
    else:
        if check[i+1] == 1 or check[i+1] == 2:
            count[i+1] += count[i]%mod
        if check[i+2] == 1 or check[i+2] == 2:
            count[i+2] += count[i]%mod
    
print(count[n-1]%mod)

Buggy submission (verdict: Runtime Error):
n,m = map(int,input().split())

check = [1]*(n)
check.append(0)
check.append(0)
be = int(input())
check[be-1] = 0
check[be-2] = 2
for i in range(m-1):
    a = int(input())
    if a == be+1:
        print(0)
        exit()
    else:
        check[a-1] = 0
        check[a-2] = 2
        be = a
        

count = [0]*(n+2)

mod = 10**9+7
if check[0]==1:
    count[0] = 1
    count[1] = 2
elif count[0] == 0:
    count[1] = 1

for i in range(1,n-1):
    if check[i+1] == 0:
        count[i+2] = count[i]%mod
    else:
        if check[i+1] == 1 or check[i+1] == 2:
            count[i+1] += count[i]%mod
        if check[i+2] == 1 or check[i+2] == 2:
            count[i+2] += count[i]%mod
    
print(count[n-1]%mod)
Problem p03073 (python)

Fixed submission:
s = list(input())

count = 0
for i in range(1,len(s)):
  if s[i] == s[i-1]:
    if s[i] == "0":
      s[i] = "1"
    else:
      s[i] = "0"
    count += 1
    
print(count)

Buggy submission (verdict: Runtime Error):
s = list(input())
count = 0
for i in range(1,n):
  if s[i] == s[i-1]:
    if s[i] == "0":
      s[i] = "1"
    else:
      s[i] = "0"
    count += 1
print(count)
Problem p03075 (python)

Fixed submission:
l = []
for i in range(5):
  a = int(input())
  l.append(a)
k = int(input())
for i in range(4):
  for j in range(i+1,5):
    if l[j] - l[i] > k:
      print(":(")
      exit()
    
print("Yay!")

Buggy submission (verdict: Runtime Error):
l = []
for i in range(5):
  a = int(input())
  l.append(a)
k = int(input())
for i in range(4):
  for j in range(i+1,5)
  if l[j] - l[i] > k:
    print(":(")
    exit()
    
print("Yay!")
Problem p03137 (python)

Fixed submission:
n,m = map(int,input().split())
if n >= m:
  print(0)
  exit()
l = list(map(int,input().split()))
l.sort()
ans = []
for i in range(m-1):
  ans.append(l[i+1]-l[i])
  
ans.sort()
mi = 0
for i in range(m-2,m-1-n,-1):
  mi += ans[i]
print(sum(ans)-mi)

Buggy submission (verdict: Runtime Error):
n,m = map(int,input().split())
if n >= m:
  print(o)
  exit()
l = list(map(int,input().split()))
l.sort()
ans = []
for i in range(m-1):
  ans.append(l[i+1]-l[i])
  
ans.sort()
mi = 0
for i in range(m-2,m-1-n,-1):
  mi += ans[i]
print(sum(ans)-mi)
Problem p03208 (python)

Fixed submission:
n,k = map(int,input().split())
l = [int(input()) for i in range(n)]
l.sort()
ans = l[-1]
for i in range(n-k+1):
  ans = min(ans,l[i+k-1]-l[i])
  if ans == 0:
    print(0)
    exit()
  
print(ans)

Buggy submission (verdict: Runtime Error):
n,k = map(int,input().split())
l = [int(input()) for i in range(n)]
l.sort()
ans = l[-1]
for i in range(n-k):
  ans = min(ans,l[i+k]-l[i])
  if ans = 0
  print(0)
  exit()
  
print(ans)
Problem p03253 (python)

Fixed submission:
n,m = map(int,input().split())
l = []
i = 2
if m == 1 or n == 1:
    print(1)
    exit()
while m != 1:
    if m%i == 0:
        l.append(0)
        while m%i == 0:
            l[-1] += 1
            m //= i
    i += 1

mod = 10**9+7 
fact = [1,1]
finv = [1,1]
inv = [0,1]
 
for i in range(2,n+max(l)+5):
    fact.append((fact[-1]*i)%mod)
    inv.append((inv[mod%i]*(mod-mod//i))%mod)
    finv.append((finv[-1]*inv[-1])%mod)
 
def nCr(n,r,mod):
    if r > n:
        return 0
    else: 
        return fact[n]*finv[r]*finv[n-r]%mod

ans = 1

for i in l:
    ans *= nCr(n+i-1,n-1,mod)
    ans %= mod
print(ans)

Buggy submission (verdict: Runtime Error):
n,m = map(int,input().split())
l = []
i = 2
while m != 1:
    if m%i == 0:
        l.append(0)
        while m%i == 0:
            l[-1] += 1
            m //= i
    i += 1

mod = 10**9+7 
fact = [1,1]
finv = [1,1]
inv = [0,1]
 
for i in range(2,n+max(l)+5):
    fact.append((fact[-1]*i)%mod)
    inv.append((inv[mod%i]*(mod-mod//i))%mod)
    finv.append((finv[-1]*inv[-1])%mod)
 
def nCr(n,r,mod):
    if r > n:
        return 0
    else: 
        return fact[n]*finv[r]*finv[n-r]%mod

ans = 1

for i in l:
    ans *= nCr(n+i-1,n-1,mod)
    ans %= mod
print(ans)
Problem p03426 (python)

Fixed submission:
h,w,d = map(int,input().split())
px = [0]*(h*w+1)
py = [0]*(h*w+1)
for i in range(h):
    l = list(map(int,input().split()))
    for j in range(w):
        px[l[j]],py[l[j]] = i,j  

count =[0]*(h*w+1)
for i in range(d+1,h*w+1):
    count[i] = count[i-d]+abs(px[i]-px[i-d])+abs(py[i]-py[i-d])

n = int(input())
for i in range(n):
    a,b = map(int,input().split())
    print(count[b]-count[a])

Buggy submission (verdict: Runtime Error):
h,w,d = map(int,input().split())
l = [list(map(int,input().split())) for i in range(h)]
ans = [[0]*(h*w) for i in range(d)]

for i in range(h):
    for j in range(w):
        ans[l[i][j]%d][l[i][j]//d] = (l[i][j],i,j)

count =[0]*(h*w+1)
for i in range(2,len(ans[0])):
    if ans[0][i] == 0:
        break
    count[ans[0][i][0]] = count[ans[0][i-1][0]] + abs(ans[0][i][1]-ans[0][i-1][1])+abs(ans[0][i][2]-ans[0][i-1][2])
for i in range(1,d):
    for j in range(1,len(ans[i])):
        if ans[i][j] == 0:
            break
        count[ans[i][j][0]] = count[ans[i][j-1][0]] + abs(ans[i][j][1]-ans[i][j-1][1])+abs(ans[i][j][2]-ans[i][j-1][2])

n = int(input())
for i in range(n):
    a,b = map(int,input().split())
    print(count[b]-count[a])
Problem p03652 (python)

Fixed submission:
n,m = map(int,input().split())
a = [list(map(int,input().split())) for i in range(n)]
count = [0]*(m+1)
for i in a:
    count[i[0]] += 1
l = [0]*n
ans = max(count)
s = set()
for i in range(m-1):
    M = max(count)
    ind = count.index(M)
    s.add(ind)

    for j in range(n):
        if a[j][l[j]] == ind:

            count[ind] -= 1
            while a[j][l[j]] in s:
                l[j] += 1
            count[a[j][l[j]]] += 1
    ans = min(ans,max(count))

print(ans)

Buggy submission (verdict: Runtime Error):
n,m = map(int,input().split())
a = [list(map(int,input().split())) for i in range(n)]
count = [0]*(m+1)
for i in a:
    count[i[0]] += 1
l = [0]*n
ans = max(count)
s = set()
for i in range(n-1):
    M = max(count)
    ind = count.index(M)
    s.add(ind)

    for j in range(n):
        if a[j][l[j]] == ind:

            count[ind] -= 1
            while a[j][l[j]] in s:
                l[j] += 1
            count[a[j][l[j]]] += 1
    ans = min(ans,max(count))

print(ans)
Problem p03723 (python)

Fixed submission:
l = list(map(int,input().split()))
count = 0
while True:
    if l[0] == l[1] == l[2]:
        if l[1]%2 == 0:
            print(-1)
            exit()
    for i in range(3):
        if l[i]%2 == 1:
            print(count)
            exit()
    count += 1
    l[0],l[1],l[2] = (l[1]+l[2])//2,(l[0]+l[2])//2,(l[1]+l[0])//2

Buggy submission (verdict: Runtime Error):
l = list(map(int,input().split()))
count = 0
while True:
    if l[0] == l[1] == l[2]:
        if l[1]%2 == 0:
            print(-1)
            exit(9)
    for i in range(3):
        if l[i]%2 == 1:
            print(count)
            exit()
    count += 1
    l[0],l[1],l[2] = (l[1]+l[2])//2,(l[0]+l[2])//2,(l[1]+l[0])//2
Problem p03774 (python)

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

ans = []

for i in a:
  count = 10**10
  check = 0
  for j in range(m):
    if count > abs(i[0]-b[j][0])+abs(i[1]-b[j][1]):
      check = j+1
      count = abs(i[0]-b[j][0])+abs(i[1]-b[j][1])
    
  ans.append(check)
for i in ans:
  print(i)

Buggy submission (verdict: Runtime Error):
n,m = map(int,input().split())
a = [list(map(int,input().split())) for i in range(n)]
b = [list(map(int,input().split())) for i in range(n)]

ans = []

for i in a:
  count = 10**10
  check = 0
  for j in range(m):
    if count > abs(i[0]-b[j][0])+abs(i[1]-b[j][1]):
      check = j+1
      count = abs(i[0]-b[j][0])+abs(i[1]-b[j][1])
    
  ans.append(check)
for i in ans:
  print(i)
Problem p03822 (python)

Fixed submission:
import sys
sys.setrecursionlimit(10**5)
from collections import defaultdict

n = int(input())
e = [[] for i in range(n)]
for i in range(1,n):
    x = int(input())
    e[x-1].append(i)

def dfs(x):

    count = len(e[x])
    if count == 0:
        return 0
    d = defaultdict(int)
    ma = 0
    s = set()
    for nex in e[x]:
        v = dfs(nex)
        d[v] += 1
        s.add(v)
        ma = max(ma,v)
    now = count
    bef = 0
    for v in sorted(list(s),reverse=True):
        bef += d[v]
        now = max(now,bef+v)
    return now

print(dfs(0))

Buggy submission (verdict: Runtime Error):
n = int(input())
e = [[] for i in range(n)]
for i in range(1,n):
    x = int(input())
    e[x-1].append(i)

def dfs(x):
    count = len(e[x])
    if count == 0:
        return 0
    now = 0
    for nex in e[x]:
        now = max(now,dfs(nex))    
    return max(count,now+1)

print(dfs(0))