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

Fixed submission:
def main():
    (n,k),p,c=[[*map(int,t.split())]for t in open(0)]
    m=-10**18
    for i in range(n):
        s=i
        t=1
        x=c[s]
        while p[s]-1!=i:
            s=p[s]-1
            t+=1
            x+=c[s]
        if x>0:
            a=(k//t-1)*x
            if a>m:m=a
            s=i
            for _ in range(k%t+t):
                s=p[s]-1
                a+=c[s]
                if a>m:m=a
        else:
            a=0
            s=i
            for _ in range(min(k,t)):
                s=p[s]-1
                a+=c[s]
                if a>m:m=a
    print(m)
main()

Buggy submission (verdict: Runtime Error):

Problem p02586 (python)

Fixed submission:
c=[[0]*3001for _ in range(3001)]
dp=[[[0]*3001for _ in range(3001)]for _ in range(4)]
h,w,k=map(int,input().split())
for i in range(k):
    y,x,v=map(int,input().split())
    c[y][x]=v
for i in range(1,h+1):
    for j in range(1,w+1):
        x=max(dp[0][i-1][j],dp[1][i-1][j],dp[2][i-1][j],dp[3][i-1][j])
        for k in range(4):
            if k:dp[k][i][j]=max(dp[k][i][j-1],dp[k-1][i][j-1]+c[i][j])
            else:dp[k][i][j]=max(dp[k][i][j-1],x)
        dp[1][i][j]=max(dp[1][i][j],x+c[i][j])
print(max(dp[0][h][w],dp[1][h][w],dp[2][h][w],dp[3][h][w]))

Buggy submission (verdict: Runtime Error):
def main():
    c=[[0]*3001for _ in range(3001)]
    h,w,k=map(int,input().split())
    for i in range(k):
        y,x,v=map(int,input().split())
        c[y][x]=v
    dp=[[0]*(w+1)for _ in range(h+1)]
    for i in range(1,h+1):
        x=y=z=p=0
        for j in range(1,w+1):
            v=c[i][j]
            if v>x:x,y,z=v,x,y
            elif v>y:y,z=v,y
            elif v>z:z=v
            if x+y+z+p<=dp[i-1][j]+v:
                x,y,z=v,0,0
                p=dp[i-1][j]
            dp[i][j]=x+y+z+p
    a=dp[h][w]
    dp=[[[0]*(w+1)for _ in range(h+1)]for _ in range(4)]
    for i in range(1,h+1):
        for j in range(1,w+1):
            x=max(dp[0][i-1][j],dp[1][i-1][j],dp[2][i-1][j],dp[3][i-1][j])
            for k in range(4):
                if k:dp[k][i][j]=max(dp[k][i][j-1],dp[k-1][i][j-1]+c[i][j])
                else:dp[k][i][j]=max(dp[k][i][j-1],x)
            dp[1][i][j]=max(dp[1][i][j],x+c[i][j])
    if a<max(dp[0][h][w],dp[1][h][w],dp[2][h][w],dp[3][h][w]):1/0
    else:print(a)
main()

Buggy submission (verdict: Runtime Error):
def main():
    c=[[0]*3001for _ in range(3001)]
    h,w,k=map(int,input().split())
    for i in range(k):
        y,x,v=map(int,input().split())
        c[y][x]=v
    dp=[[0]*(w+1)for _ in range(h+1)]
    for i in range(1,h+1):
        x=y=z=p=0
        for j in range(1,w+1):
            v=c[i][j]
            if v>x:x,y,z=v,x,y
            elif v>y:y,z=v,y
            elif v>z:z=v
            if x+y+z+p<=dp[i-1][j]+v:
                x,y,z=v,0,0
                p=dp[i-1][j]
            dp[i][j]=x+y+z+p
    a=dp[h][w]
    dp=[[[0]*(w+1)for _ in range(h+1)]for _ in range(4)]
    for i in range(1,h+1):
        for j in range(1,w+1):
            x=max(dp[0][i-1][j],dp[1][i-1][j],dp[2][i-1][j],dp[3][i-1][j])
            for k in range(4):
                if k:dp[k][i][j]=max(dp[k][i][j-1],dp[k-1][i][j-1]+c[i][j])
                else:dp[k][i][j]=max(dp[k][i][j-1],x)
            dp[1][i][j]=max(dp[1][i][j],x+c[i][j])
    if a<max(dp[0][h][w],dp[1][h][w],dp[2][h][w],dp[3][h][w]):1/0
main()
Problem p02599 (python)

Fixed submission:
import sys
from operator import itemgetter
buf = sys.stdin.buffer
input = buf.readline
class BIT:
    def __init__(self, n):
        self.n = n
        self.tree = [0] * (n + 1)
    def add(self, i, x):
        n, tree = self.n, self.tree
        while i <= n:
            tree[i] += x
            i += i & -i
    def sum(self, i):
        tree = self.tree
        s = 0
        while i:
            s += tree[i]
            i -= i & -i
        return s
def main():
    n, q = map(int, input().split())
    res = [0] * q
    *c, = map(int, input().split())
    q = [(i, l, r) for i, (l, r) in enumerate(zip(*[map(int, buf.read().split())] * 2))]
    q.sort(key=itemgetter(2))
    bit = BIT(n + 2)
    add, sum = bit.add, bit.sum
    b = [1] * (n + 1)
    j = 1
    for i, l, r in q:
        while j <= r:
            d = c[j - 1]
            j += 1
            k = b[d]
            b[d] = j
            add(k + 1, 1)
            add(j + 1, -1)
        res[i] = sum(l + 1)
    print(' '.join(map(str, res)))
main()

Buggy submission (verdict: Runtime Error):
import sys
b=sys.stdin.buffer
input=b.readline
def main():
  n,q=map(int,input().split())
  d=[0]*n+[1<<int(i)for i in input().split()]
  for i in range(n-1,0,-1):d[i]=d[i+i]|d[i-~i]
  r=[]
  add=r.append
  for a,b in zip(*[iter(b.read().split())]*2):
    i,s=int(a)+n-1,0
    j=int(b)+n
    while i<j:
      if i&1:
        s|=d[i]
        i+=1
      if j&1:
        j-=1
        s|=d[j]
      i>>=1
      j>>=1
    add(bin(s).count('1'))
  print(' '.join(map(str,r)))
main()
Problem p02609 (python)

Fixed submission:
from functools import*
@lru_cache(None)
def solve(n,m):
  if not n:return 1
  n%=m
  return-~solve(n,bin(n).count('1'))
n=int(input())
s=input()
a=int(s,2)
*x,=map(int,s)
h=sum(x)
try:a,b=a%(h-1),a%(h+1)
except:b=a%(h+1)
for i in range(n):
  if x[i]:
    if not h-1:
      print(0)
      continue
    x[i]=0
    t=(a-pow(2,~i+n,h-1))%(h-1)
  else:
    x[i]=1
    t=(b+pow(2,~i+n,h+1))%(h+1)
  r=solve(t,bin(t).count('1'))
  x[i]^=1
  print(r)

Buggy submission (verdict: Runtime Error):
from functools import*
@lru_cache(None)
def solve(n,m):
  if not n:return 1
  n%=m
  return-~solve(n,bin(n).count('1'))
n=int(input())
s=input()
a=int(s,2)
*x,=map(int,s)
h=sum(x)
a,b=a%(h-1),a%(h+1)
for i in range(n):
  if x[i]:
    x[i]=0
    t=(a-pow(2,~i+n,h-1))%(h-1)
  else:
    x[i]=1
    t=(b+pow(2,~i+n,h+1))%(h+1)
  r=solve(t,bin(t).count('1'))
  x[i]^=1
  print(r)
Problem p02631 (python)

Fixed submission:
n,*a=map(int,open(0).read().split())
x=0
for i in a:x^=i
for i in a:print(x^i)

Buggy submission (verdict: Runtime Error):
for i in a:=[*map(int,[*open(x:=0)][1].split())]:x^=i
for i in a:print(x^i)
Problem p02644 (python)

Fixed submission:
I=9**9
h,a,*m=open(0)
h,w,k,a,b,f,g=map(int,(h+a).split())
d=[I]*h*w
a=~w+a*w+b
d[a]=1
q=[a]
for s in q:
 for y,x in(1,0),(-1,0),(0,1),(0,-1):
  for z in range(k):
   i,j=s//w+y*~z,s%w+x*~z;t=i*w+j
   if(h>i>-1<j<w)-1or'.'<m[i][j]or d[t]<=d[s]:break
   if d[t]==I:q+=t,;d[t]=d[s]+1
print(d[~w+f*w+g]%I-1)

Buggy submission (verdict: Runtime Error):
h,a,*m=open(0)
h,w,k,a,b,f,g=map(int,(h+a).split())
I=h*w
d=[I]*I
a=~w+a*w+b
d[a]=1
q=[a]
for s in q:
 for y,x in(1,0),(-1,0),(0,1),(0,-1):
  for z in range(k):
   i,j=s//w+y*~z,s%w+x*~z;t=d[i*w+j];p=d[s]+1
   if(h>i>-1<j<w)-1or'.'<m[i][j]or t<p:break
   if t>p:q+=t,;d[i*w+j]=p
print(d[~w+f*w+g]%I-1)
Problem p02647 (python)

Fixed submission:
def main():
    n,k,*a=map(int,open(0).read().split())
    for _ in range(k):
        b=[0]*n
        m=10**18
        for i,t in enumerate(a):
            if t<m:m=t
            b[max(0,i-t)]+=1
            if i-~t<n:b[i-~t]-=1
        if m>=n:break
        for i in range(n-1):b[i+1]+=b[i]
        a=b
    print(' '.join(map(str,a)))
main()

Buggy submission (verdict: Runtime Error):
n,k,*a=map(int,open(0).read().split())
r=range(n)
while k:
 k-=1;b=[0]*n*2
 for i in r:t=a[i];b[max(0,i-t)]+=1;b[i-~t]-=1
 for i in r:b[i+1]+=b[i]
 if max(a:=b[:n])==n:break
print(*a)
Problem p02684 (python)

Fixed submission:
n,k,*a=map(int,open(0).read().split())
d=[0]+[-1]*n
s=0
for i in range(k):
  s=a[s]-1
  if(j:=d[s])>-1:
    exec((k-j)%(i+1-j)*'s=a[s]-1;')
    exit(print(s+1))
  d[s]=i+1
print(s+1)

Buggy submission (verdict: Runtime Error):
n,k,*a=map(int,open(0).read().split())
d=[2*k]*n
s=0
while k:s=a[s]-1;d[s]=k=~-k%(d[s]-k)
print(s+1)

Buggy submission (verdict: Runtime Error):
n,k,*a=map(int,open(0).read().split())
d=[2*k]*n
s=0
while k:k-=1;k%=d[s:=a[s]-1]-k;d[s]=k
print(s)
Problem p02687 (python)

Fixed submission:
print(*{'ABC','ARC'}-{input()})

Buggy submission (verdict: Runtime Error):
print('A%sC'%'BR'[id('A')%3])

Buggy submission (verdict: Runtime Error):
print('A%sC'%'BR'[id('A')%3])
Problem p02690 (python)

Fixed submission:
x,r=int(input()),range(-99,120);[i**5-x-j**5or exit(print(i,j))for i in r for j in r]

Buggy submission (verdict: Runtime Error):
m=5**6
exec(f'i,j=m%128,m>>7;m-=i**5-j**5!={input()}or print(i,j);'*2*m)
Problem p02702 (python)

Fixed submission:
a,*d=[0]*2020
for i in map(int,input()):
  p=[0]*2019
  for j in range(2019):p[(j*10+i)%2019]+=d[j]
  d=p
  d[i]+=1
  a+=d[0]
print(a)

Buggy submission (verdict: Runtime Error):
M=2019
a,i,*d=[0]*M
p=1
for j in input():d[i%M]+=1;i+=int(j)*p;a+=d[i%M];p=p*202%M
print(a)

Buggy submission (verdict: Runtime Error):
def resolve():
    s = input()
    n = len(s)
    counter = [0] * 2019
    counter[0] += 1
    temp = ""
    for i, c in enumeate(s[::-1], 1):
        temp = c + temp
        counter[int(temp) % 2019] += 1

    ans = 0
    for i in counter:
        ans += (i * (i - 1)) // 2

    print(ans)
resolve()
Problem p02713 (python)

Fixed submission:
from math import*
r=range(1,int(input())+1)
print(sum(gcd(gcd(a,b),c)for a in r for b in r for c in r))

Buggy submission (verdict: Runtime Error):
cdef gcd(a,b):
    if b<a:a,b=b,a
    r=b%a
    return a if r==0else gcd(a,r)
k=int(input())+1
print(sum(gcd(c,gcd(a,b))for a in range(1,k)for b in range(1,k)for c in range(1,k)))
Problem p02727 (python)

Fixed submission:
(x,y,a,b,c),*t=[map(int,t.split())for t in open(0)]
s=sorted
p,q,r=map(s,t)
print(sum(s(p[-x:]+q[-y:]+r)[-x-y:]))

Buggy submission (verdict: Runtime Error):
(x,y,a,b,c),*t=[map(int,t.split())for t in open(0)]
p,q,r=[[0]+sorted(t)[::-1]for t in t]
for i in range(a):p[i+1]+=p[i]
for i in range(b):q[i+1]+=q[i]
for i in range(c):r[i+1]+=r[i]
m=0
for i in range(x+1):
    # i:赤の個数
    # j:赤に変える無の個数
    # k:無の残り
    j=x-i
    k=c-j
    if i>a or j>c:continue
    # 赤の美味しさ総和
    t=p[i]+r[j]
    # 上手いこと緑の美味しさ総和を求める
    # sum(list(map(max,zip(r[j+1:],q)))[:y])
    # ↑みたいなことをしたい
    ok=0
    ng=k+1
    while ng-ok>1:
        mid=(ok+ng)//2
        if r[j+mid]-r[j]>=q[min(b,y)]-q[min(b,y-mid)]:
            ok=mid
        else:
            ng=mid
    t+=q[min(b,y-ok)]+r[j+ok]-r[j]
    if t>m:m=t
print(m)
Problem p02730 (python)

Fixed submission:
s=input();n=len(s)//2;print('YNeos'[s!=s[::-1]or s[:n]!=s[n-1::-1]::2])

Buggy submission (verdict: Runtime Error):
def main():
  h,*s=open(0)
  h,w,k=map(int,h.split())
  s=[list(map(int,t[:w]))for t in s]
  m=9e9
  for i in range(1<<h-1):
    t,v,l=[],0,1
    for j in range(h):
      if i>>j&1:
        t+=j+1,
        l+=1
    t+=h,
    c=[0]*l
    for i in range(w):
      b=f=g=0
      u=[]
      for j,x in enumerate(t):
        d,b=sum(s[j][i]for j in range(b,x)),x
        u+=d,
        if d>k:
          g=1
          break
        c[j]+=d
        f|=c[j]>k
      else:
        if f:
          c=u
          v+=1
      if g:break
    else:
      if v+l-1<m:m=v+l-1
  print(m)
main()
Problem p02734 (python)

Fixed submission:
n,s,*a=map(int,open(0).read().split())
d=[0]*3001
c=0
for i,a in enumerate(a):
    for j in range(s-a,0,-1):d[a+j]+=d[j]
    d[a]-=~i
    c+=d[s]
print(c%(998244353))

Buggy submission (verdict: Runtime Error):
_,s,*a=map(int,open(0).read().split())
c,i,*d=[0]*s*9
for a in a:
 for j in range(s,0,-1):d[a+j]+=d[j]
 d[a]-=~i;c+=d[s];i+=1
print(c%(998244353))

Buggy submission (verdict: Runtime Error):
_,s,*a=map(int,open(0).read().split())
c,i,*d=[0]*s*5
for a in a:
 for j in range(s,0,-1):d[a+j]+=d[j]
 d[a]-=~i;c+=d[s];i+=1
print(c%(998244353))

Buggy submission (verdict: Runtime Error):
_,s,*a=map(int,open(0).read().split())
c,i,*d=[0]*s*4
for a in a:
 for j in range(s,0,-1):d[a+j]+=d[j]
 d[a]-=~i;c+=d[s];i+=1
print(c%(998244353))

Buggy submission (verdict: Runtime Error):
_,s,*a=map(int,open(0).read().split())
c,i,*d=[0]*s*3
for a in a:
 for j in range(s,0,-1):d[a+j]+=d[j]
 d[a]-=~i;c+=d[s];i+=1
print(c%(998244353))
Problem p02749 (python)

Fixed submission:
n,*t=map(int,open(0).read().split())
e=[[]for _ in range(n)]
x=[[],[],[]]
for i in range(n):
    x[i%3]+=i+1,
for a,b in zip(*[iter(t)]*2):
    e[a-1]+=b-1,
    e[b-1]+=a-1,
a=[-1]*n
p=a[:]
p[0]=0
s=[0]
c=[1,0]
while s:
    v=s.pop()
    for w in e[v]:
        if p[w]<0:
            p[w]=p[v]^1
            c[p[w]]+=1
            s+=w,
if min(c)<=n//3:
    x[0]+=x[1]
    f=c[0]<=n//3
    for i,v in enumerate(p):
        j=(v==f)-1
        a[i]=x[j if x[j]else-1].pop()
else:
    for i,v in enumerate(p):
        a[i]=x[v if x[v]else-1].pop()
print(*a)

Buggy submission (verdict: Runtime Error):
n,*t=map(int,open(0).read().split())
e=[[]for _ in range(n)]
x=[[],[],[]]
for i in range(n):x[i%3]+=i+1,
for a,b in zip(*[iter(t)]*2):
    e[a-1]+=b-1,
    e[b-1]+=a-1,
a=[-1]*n
p=a[:]
p[0]=0
s=[0]
c=[1,0]
while s:
    v=s.pop()
    for w in e[v]:
        if p[w]<0:
            p[w]=p[v]^1
            c[p[w]]+=1
            s+=w,
if min(c)<=len(x[2]):
    x[0]+=x[1]
    f=c[0]<=len(x[2])
    for i,v in enumerate(p):a[i]=x[(v==f)-1].pop()
else:
    for i,v in enumerate(p):a[i]=x[v if x[v]else-1].pop()
print(*a)

Buggy submission (verdict: Runtime Error):
n,*t=map(int,open(0).read().split())
e=[[]for _ in range(n)]
x=[[],[],[]]
for i in range(n):x[i%3]+=i+1,
for a,b in zip(*[iter(t)]*2):
    e[a-1]+=b-1,
    e[b-1]+=a-1,
a=[-1]*n
p=a[:]
p[0]=0
s=[0]
c=[1,0]
while s:
    v=s.pop()
    for w in e[v]:
        if p[w]<0:
            p[w]=p[v]^1
            c[p[w]]+=1
            s+=w,
if min(c)<=n//3:
    x[0]+=x[1]
    f=c[0]<=n//3
    for i,v in enumerate(p):a[i]=x[(v==f)-1].pop()
else:
    for i,v in enumerate(p):a[i]=x[v if x[v]else-1].pop()
print(*a)
Problem p02755 (python)

Fixed submission:
a,b=map(int,input().split())
for i in range(10**6):
  if a==int(i*.08)and b==int(i*.1):
    print(i)
    break
else:print(-1)

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split());print([i for i in range(10**6)if a==i//12.5and b==i//10]+[-1][0])
Problem p02760 (python)

Fixed submission:
f=lambda a:any(all(b)for b in a)|all(a[i][i]for i in(0,1,2))   
a=eval('list(map(int,input().split())),'*3)
exec('b=int(input());a=[[u*(u!=b)for u in t]for t in a];'*int(input()))
a=[[not u for u in t]for t in a]
print('NYoe s'[f(a)|f([t[::-1]for t in zip(*a)])::2])

Buggy submission (verdict: Runtime Error):
f=lambda a:any(all(b)for b in a)or all(a[i][i]for i in(0,1,2))   
a=eval('list(map(int,input().split())),'*3)
exec('b=int(input());a=[[u*(u!=b)for u in t]for t in a];'*int(input()))
a=[[not u for u in t]for t in a]
print('NYoe s'[f(a)|f(t[::-1]for t in zip(*a))::2])
Problem p02761 (python)

Fixed submission:
(n,_),*t=[t.split()for t in open(0)]
n=int(n)
for i in range(10**(n-1)-(n<2),10**n):
  i=str(i)
  for s,c in t:
    if i[int(s)-1]!=c:
      break
  else:
    print(i)
    break
else:
  print(-1)

Buggy submission (verdict: Runtime Error):
(n,_),*t=[t.split()for t in open(0)]
n=int(n)
for i in range(10**(n-1-(n<2)),10**n):
  i=str(i)
  for s,c in t:
    if i[int(s)-1]!=c:
      break
  else:
    print(i)
    break
else:
  print(-1)
Problem p02765 (python)

Fixed submission:
n,r=map(int,input().split());print(100*max(0,10-n)+r)

Buggy submission (verdict: Runtime Error):
s=input();print(100*max(0,10-int(s[:2]))+int(s[2:]))
Problem p02780 (python)

Fixed submission:
n,k,*p=map(int,open(0).read().split())
p+=0,
for i in range(n):p[i]-=~p[i-1]
print(max(p[i+k]-p[i]for i in range(-1,n-k))/2)

Buggy submission (verdict: Runtime Error):
n,k,*p=map(int,open(0).read().split())
p+=0,
for i in range(n):p[i]-=~p[i-1]
print(max(p[i+k]-p[i-1]for i in range(n-k))/2)

Buggy submission (verdict: Runtime Error):
n,k,*p=map(int,open(0).read().split())
p+=0,
for i in range(n):p[i]+=p[i-1]
print(max(p[i+k]-p[i-1]for i in range(n-k))/2)
Problem p02787 (python)

Fixed submission:
h,n,*t=map(int,open(0).read().split())
dp=[10**18]*(h+1)
dp[0]=0
for a,b in zip(*[iter(t)]*2):
    for j in range(h+1):
        dp[j]=min(dp[j],dp[max(0,j-a)]+b)
print(dp[h])

Buggy submission (verdict: Runtime Error):
(h,n),*t=[[*map(int,t.split())]for t in open(0)]
d=[0]*h*n
for i in range(h):d[i+1]=min(b+d[i-a+1]for a,b in t)
print(d[h])

Buggy submission (verdict: Runtime Error):
(h,n),*t=[[*map(int,t.split())]for t in open(0)]
d=[0]*-~h
for i in range(h):d[i+1]=min(b+d[i-a+1]for a,b in t)
print(d[h])
Problem p02788 (python)

Fixed submission:
from bisect import*
def _add(data, k, x):
    while k <= N:
        data[k] += x
        k += k & -k
def add(l, r, x):
    _add(data0, l, -x*(l-1))
    _add(data0, r, x*(r-1))
    _add(data1, l, x)
    _add(data1, r, -x)

def _get(data, k):
    s = 0
    while k:
        s += data[k]
        k -= k & -k
    return s
def query(l, r):
    return _get(data1, r-1) * (r-1) + _get(data0, r-1) - _get(data1, l-1) * (l-1) - _get(data0, l-1)
N,d,a,*t=map(int,open(0).read().split())
N+=1
z=sorted(zip(*[iter(t)]*2))
data0=[0]*(N+1)
data1=[0]*(N+1)
y=[x for x,_ in z]
c=0
for i,(x,h)in enumerate(z,1):
    h-=query(i,i+1)
    t=0--max(0,h)//a
    j=bisect(y,x+d+d)
    add(1,j+1,t*a)
    c+=t
print(c)

Buggy submission (verdict: Runtime Error):
def main():
    import sys
    from collections import deque
    from operator import itemgetter
    b=sys.stdin.buffer
    n,d,a=map(int,b.readline().split())
    m=map(int,b.read().split())
    p,q=deque(),deque()
    pl,ql=p.popleft,q.popleft
    pa,qa=p.append,q.append
    s=b=0
    for x,h in sorted(zip(m,m),key=itemgetter(0)):
        while p and p[0]<x:
            f()
            b-=g()
        h-=b
        t=0--h//a
        if t>0:
            s+=t
            b+=t*a
            pa(x+d+d)
            qa(t*a)
    print(s)
main()
Problem p02803 (python)

Fixed submission:
from scipy.sparse import*
e=enumerate
h,*s=open(0)
h,w=map(int,h.split())
r,c=[],[]
for i,t in e(s):
  for j,u in e(t):
    if u>'#'<t[j+1]:r+=i*w+j,;c+=i*w+j+1,
    if(i<h-1)*u>'#'<s[i+1][j]:r+=i*w+j,;c+=j-~i*w,    
print(int((csgraph.johnson(csr_matrix(([1]*len(r),(r,c)),[h*w]*2),0).clip(0,999)%999).max()))

Buggy submission (verdict: Runtime Error):
from networkx import*
_,*s=open(i:=0)
g=[]
for t in s:
 i+=1;j=0
 for u in t:g+=[(k:=i*20+j,k+20)]*(u>'#'<(s+['#'*k])[i][j])+[(k,k+1)]*(u>'#'<t[j:=j+1])
print(max(t[i]for _,t in shortest_path_length(Graph(g))for i in t))

Buggy submission (verdict: Runtime Error):
from scipy.sparse import*
M=999
*s,=open(0)
*g,=eval('[0]*M,'*M)
i=0
for t in s:
 i+=1;j=0
 for u in t:k=i*20+j;g[k][k+20]=u>'#'<(s+['#'*M])[i][j];j+=1;g[k][k+1]=u>'#'<t[j]
a=csgraph.johnson(csr_matrix(g),0)
print(int(max(a[a<M])))
Problem p02811 (python)

Fixed submission:
print('YNeos'[eval(input().replace(' ','*500<'))::2])

Buggy submission (verdict: Runtime Error):
n=int(input())
print(0--n//500)
Problem p02813 (python)

Fixed submission:
from itertools import*;(n,),a,b=eval('tuple(map(int,input().split())),'*3);i=list(permutations(range(1,n+1))).index;print(abs(i(a)-i(b)))

Buggy submission (verdict: Runtime Error):
from itertools import*
n,a,b=eval('eval(input().replace(" ",",")),'*3)
i=list(permutations(range(n+1))).index
print(abs(i(a)-i(b)))

Buggy submission (verdict: Runtime Error):
from itertools import*
(n,),a,b=eval('eval(input().replace(" ",",")),'*3)
i=list(permutations(range(1,n+1))).index
print(abs(i(a)-i(b)))
Problem p02817 (python)

Fixed submission:
s,t=input().split();print(t+s)

Buggy submission (verdict: Runtime Error):
s=input()
t=input()
print(t+s)
Problem p02837 (python)

Fixed submission:
n=int(input())
a=[[list(map(int,input().split()))for _ in'_'*int(input())]for _ in'_'*n]
m=0
for i in range(2**n):
  *s,=map(int,bin(i)[2:].zfill(n))
  f=1
  for j,t in enumerate(a):
    if s[~j]:
      for x,y in t:f&=s[-x]==y
  m=max(m,sum(s)*f)
print(m)

Buggy submission (verdict: Runtime Error):
i=input
n=int(i())
a=eval('eval("list(map(int,i().split())),"*int(i())),'*n)
#print(max(all([y==i>>x-1&1for j,t in enumerate(a)if i>>j&1for x,y in t]+[1])*bin(i).count('1')for i in range(2**n)))

Buggy submission (verdict: Runtime Error):
i=input
n=int(i())
a=eval('eval("list(map(int,i().split())),"*int(i())),'*n)
print(max(all([y==i>>x-1&1for j,t in enumerate(a)if i>>j&1for x,y in t]+[1])*bin(i).count('1')for i in range(2**n)))

Buggy submission (verdict: Runtime Error):
i=input
n=int(i())
a=eval('eval("list(map(int,i().split())),"*int(i())),'*n)
print(max(all(y==i>>x-1&1for j,t in enumerate(a)if i>>j&1for x,y in t)*bin(i).count('1')for i in range(2**n)))

Buggy submission (verdict: Runtime Error):
i=input
n=int(i())
a=eval('eval("list(map(int,i().split())),"*int(i())),'*n)
print(max(all(all(y==i>>x-1&1for x,y in t)for j,t in enumerate(a)if i>>j&1)*bin(i).count('1')for i in range(2**n)))
Problem p02843 (python)

Fixed submission:
n=int(input())
try:print(+(n%100/(n//100)<=5))
except:print(+(n<1))

Buggy submission (verdict: Runtime Error):
n=int(input());print(+(n%100/(n//100)<=5))
Problem p02845 (python)

Fixed submission:
n,*a=map(int,open(0).read().split())
c=1
d=[0]*3
for b in a:
  c=c*sum(t==b for t in d)%(10**9+7)
  for i,t in enumerate(d):
    if t==b:
      d[i]+=1
      break
print(c)

Buggy submission (verdict: Runtime Error):
_,a=open(0)
c=1
d=[3]+[0]*10**6
for a in map(int,a.split()):
  c=c*dp[a]%(10**9+7)
  d[a]-=1
  d[a]+=1
print(c)
Problem p02848 (python)

Fixed submission:
n=int(input())
print(''.join(chr((ord(c)+n-65)%26+65)for c in input()))

Buggy submission (verdict: Runtime Error):
_,s=open(0)
for c in s[:-1]:print(chr(65+(ord(c)-65+n)%26),end='')
Problem p02883 (python)

Fixed submission:
def main():
    n,k,*a=map(int,open(0).read().split())
    a,f=sorted(a[:n])[::-1],sorted(a[n:])
    ok=10**12
    ng=-1
    while abs(ok-ng)>1:
        mid=(ok+ng)//2
        l=k
        for b,g in zip(a,f):
            if b*g>mid:
                l-=b-mid//g
        if l<0:ng=mid
        else:ok=mid
    print(ok)
main()

Buggy submission (verdict: Runtime Error):
k,*t=[map(int,t.split())for t in open(0)]
A,F=map(sorted,t)
o=10**12
g=-1
while~g+o:
 m,l=o+g>>1,k[1]
 for a,f in zip(A,F[::-1]):l-=max(0,a-m//f)
 if l<0:g=m
 else:o=m
print(o)

Buggy submission (verdict: Runtime Error):
n,k,*a=map(int,open(0).read().split())
z=sorted(a[:n]),sorted(a[n:])[::-1]
o=10**12
g=-1
while o-g>1:
 m,l=o+g>>1,k
 for a,f in zip(z):l-=max(0,a-m//f)
 if l<0:g=m
 else:o=m
print(o)
Problem p02885 (python)

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

Buggy submission (verdict: Runtime Error):
s=input();print(max(0,int(s[:3])-2*int(s[3:])))

Buggy submission (verdict: Runtime Error):
s=input();print(max(0,int(s[:2])-2*int(s[2:])))
Problem p02888 (python)

Fixed submission:
from bisect import*
n,*l=map(int,open(0).read().split())
l.sort()
A=0
for i in range(n):
    a=l[i]
    for j in range(i+1,n):
        b=l[j]
        k1=max(j+1,bisect(l,b-a))
        k2=bisect_left(l,a+b)
        A+=max(0,k2-k1)
print(A)

Buggy submission (verdict: Runtime Error):
from bisect import*
_,l=open(0)
*e,=enumerate(sorted(map(int,l.split())))
print(sum(j-bisect(l,a-b,0,j)for i,a in e for j,b in e[:i]))
Problem p02889 (python)

Fixed submission:
from scipy.sparse import*
s=csgraph.floyd_warshall
n,m,l,*t=map(int,open(0).read().split())
d=eval('[9e9]*-~n,'*-~n)
for a,b,c in zip(*[iter(t[:m*3])]*3):d[a][b]=d[b][a]=c
d=s(d)
d[d>l]=9e9
d[d<=l]=1
d=s(d)
d[d>9e9]=9e9
for s,t in zip(*[iter(t[m*3+1:])]*2):print(int(d[s,t]%9e9-1))

Buggy submission (verdict: Runtime Error):
from scipy.sparse import*
i=lambda:tuple(map(int,input().split()))
f=csgraph.floyd_warshall
n,m,l=i()
d=eval('[0]*-~n,'*-~n)
exec('a,b,c=i();d[a][b]=c;'*m)
d=f(f(d,0)<=l)
d*=d<n
for _ in'_'*i()[0]:print(int(d[i()])-1)
Problem p02900 (python)

Fixed submission:
from subprocess import*
a,b=map(int,input().split())
x=set(map(int,Popen(['factor',str(a)],stdout=PIPE).communicate()[0].decode().split()[1:]))
y=set(map(int,Popen(['factor',str(b)],stdout=PIPE).communicate()[0].decode().split()[1:]))
print(len(x&y)+1)

Buggy submission (verdict: Runtime Error):
from fractions import*
n=gcd(*map(int,input().split()))
a=1
i=2
while i*i<=n:
 a+=n%i<1
 while n%i<1:n//=i
 i+=1
print(ans+(n>1))

Buggy submission (verdict: Runtime Error):
from subprocess import*;a,b=[set(Popen(('factor',x),stdout=PIPE).stdout.read().split())for x in input().split()[1:]];print(len(a&b)+1)