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

Fixed submission:
s=input()
flag=1
if list(s)[2]==list(s)[3]:
  if list(s)[4]==list(s)[5]:
    flag=0
if flag==0:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
X,Y,A,B,C = map(int, input().split())
p=list(map(int,input().split()))
q=list(map(int,input().split()))
r=list(map(int,input().split()))
p.sort()
p.reverse()
q.sort()
q.reverse()
r.sort()
r.reverse()
ans=0
ccounter=0
for i in range(0,X):
    ans=p[i]+ans
for i in range(0,Y):
    ans=q[i]+ans
for i in range(0,X):
    if i>=C:
      break
    if p[X-1-i]<=r[i]:
        ccounter=ccounter+1
        ans=ans-p[X-1-i]+r[i]
    else:
        break
for i in range(0,Y):
    if i+ccounter>=C:
        break
    if q[Y-1-i]<=r[i+ccounter]:
        ans=ans-q[Y-1-i]+r[i+ccounter]
        ccounter=ccounter+1
    else:
        break
print(ans)

Buggy submission (verdict: Runtime Error):
s=input()
flag=1
if list(s)[2]==list(s)[3]:
  if list(s)[4]==list(s)[5]:
    flag=0
if flag=0:
  print("Yes")
else:
  print("No")
Problem p02725 (python)

Fixed submission:
K, N = map(int, input().split())
houselist = list(map(int, input().split()))
max=0
for i in range(1,N):
  if houselist[i]-houselist[i-1]>max:
    max=houselist[i]-houselist[i-1]
if K+houselist[0]-houselist[N-1]>max:
  max=K+houselist[0]-houselist[N-1]
if max==0:
  print(0)
else:
  print(K-max)

Buggy submission (verdict: Runtime Error):
K, N = map(int, input().split())
houselist = list(map(int, input().split()))
max=0
for i in range(1,N):
  if houselist[i]-houselist[i-1]>max:
    max=houselist[i]-houselist[i-1]
if K+houselist[0]-houselist[N]>max:
  max=K+houselist[0]-houselist[N]
if max==0:
  print(0)
else:
  print(K-max)

Buggy submission (verdict: Runtime Error):
K, N = map(int, input().split())
houselist = list(map(int, input().split()))
max=0
for i in range(1,N-1):
  if houselist[i]-houselist[i-1]>max:
    max=houselist[i]-houselist[i-1]
if K+houselist[0]-houselist[N]>max:
  max=K+houselist[0]-houselist[N]
if max==0:
  print(0)
else:
  print(K-max)

Buggy submission (verdict: Runtime Error):
K, N = map(int, input().split())
houselist = list(map(int, input().split()))
max=0
for i in range(1,N-1):
  if houselist[i]-houselist[i-1]>max:
    max=houselist[i]-houselist[i-1]
if K+houselist[0]-houselist[N]>max:
  max=K+houselist[0]-houselist[N]
print(K-max)

Buggy submission (verdict: Runtime Error):
K, N = map(int, input().split())
houselist = list(map(int, input().split()))
max=0
for i in range(1,N-1):
  if houselist(i)-houselist(i-1)>max:
    max=houselist(i)-houselist(i-1)
if K+houselist(0)-houselist(N)>max:
  max=K+houselist(0)-houselist(N)
print(K-max)
Problem p02753 (python)

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

Buggy submission (verdict: Runtime Error):
S=input()
# Python3 program to Split string into characters 
def split(word): 
    return [char for char in word]  
def convert(s): 
  
    # initialization of string to "" 
    new = "" 
  
    # traverse in the string  
    for x in s: 
        new += x  
  
    # return string  
    return new 
      
      
# Driver code 
word = S
splits=split(S)
Q=int(input())
flipcounter=0
for i in range(0,Q):
  inputforround=input()
  if inputforround=='1':
    flipcounter=flipcounter+1
  else:
    T,F,C=map(str,inputforround.split())
    if (int(F)+flipcounter)%2==1:
      splits.insert(0,C)
    else:
      splits.append(C)
if flipcounter%2==1:
  splits.reverse()
ans=convert(splits)
print(ans)

Buggy submission (verdict: Runtime Error):
N, A, B=map(int, input().split())
K=(N-N%(A+B))/(A+B)
ans=(K*A+min(A,N%(A+B))
print(int(round(ans)))

Buggy submission (verdict: Runtime Error):
N, A, B=map(int, input().split())
ans=(N-N%(A+B))*A/(A+B)+min(A,N%(A+B))
print(int(round(ans)))
Problem p02754 (python)

Fixed submission:
N, A, B=map(int, input().split())
K=int((N-N%(A+B))/(A+B))
ans=(K*A+min(A,N%(A+B)))
print(ans)

Buggy submission (verdict: Runtime Error):
N, A, B=map(int, input().split())
K=int((N-N%(A+B))/(A+B))
ans=(K*A+min(A,N%(A+B))
print(int(round(ans)))

Buggy submission (verdict: Runtime Error):
N, A, B=map(int, input().split())
K=(N-N%(A+B))/(A+B)
ans=(K*A+min(A,N%(A+B))
print(int(round(ans)))

Buggy submission (verdict: Runtime Error):
N,A,B=map(int, input())
ans=(N-N%(A+B))*A/(A+B)+min(A,N%(A+B))
print(ans)
Problem p02847 (python)

Fixed submission:
S=input()
if S=='SUN':
  print(7)
if S=='MON':
  print(6)
if S=='TUE':
  print(5)
if S=='WED':
  print(4)
if S=='THU':
  print(3)
if S=='FRI':
  print(2)
if S=='SAT':
  print(1)

Buggy submission (verdict: Runtime Error):
import math
def undefinedfunction():
  asjdkfl
A,B,X=map(int,input().split())
last=[]
for i in range(0,10):
  last.append(A*(10**i)+B*(i+1))
digit=0
for i in range(0,10):
  if X>=last[i]:
    digit=digit+1
if digit==0:
  print(0)
elif digit>=10:
  undefined
  print(1000000000)
else:
  k=math.floor((X-B*(digit-1))/A)
  if (k+1)*A<=X-B*(digit-1):
    k+=1
    undefinedfunction
  if k<10**(digit-1):
    k=10**(digit-1)
  if k>=10**digit:
    k=10**digit-1
    undefinedfunction
  print(k)

Buggy submission (verdict: Runtime Error):
import math
def undefinedfunction():
  asjdkfl
A,B,X=map(int,input().split())
last=[]
for i in range(0,10):
  last.append(A*(10**i)+B*(i+1))
digit=0
for i in range(0,10):
  if X>=last[i]:
    digit=digit+1
if digit==0:
  print(0)
elif digit>=10:
  undefined
  print(1000000000)
else:
  k=math.floor((X-B*digit)/A)
  if (k+1)*A<=X-B*digit:
    k+=1
    undefinedfunction
  if k<10**(digit-1):
    k=10**(digit-1)
  if k>=10**digit:
    k=10**digit-1
    undefinedfunction
  print(k)
Problem p02897 (python)

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

Buggy submission (verdict: Runtime Error):
import fractions
A,B=map(int,input().split())
gcd=fractions.gcd(A, B)
ans=1
setgcd=gcd
for i in range(2,setgcd+1):
  if gcd%i==0:
    ans=ans+1
    while gcd%i==0:
      gcd=round(gcd/i)
  if i*i>setgcd:
    break
print(ans)
Problem p02925 (python)

Fixed submission:
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
n=int(input())
m=[]
for i in range(n):
  a=list(map(int,input().split()))
  a.reverse()
  m.append(a)
ans=0
count=0
failflag=0
previous=set()
for i in range(n):
  previous.add(i)
while count<(n*(n-1)):
  ans+=1
  tempcount=count
  r=set()
  for i in previous:
    if m[i]:
      t=m[i][-1]
      if m[t-1]:
        if m[t-1][-1]==i+1:
          count+=1
          r.add(i)
          r.add(t-1)
  previous=set()
  for k in r:
    m[k].pop()
    previous.add(k)
    if m[k]:
      previous.add(m[k][-1]-1)
  if tempcount==count:
    failflag=1
    break
if failflag==1:
  print(-1)
else:
  print(ans)

Buggy submission (verdict: Runtime Error):
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
n=int(input())
m=[]
for i in range(n):
  a=list(map(int,input().split()))
  a.reverse()
  m.append(a)
ans=0
count=0
failflag=0
previous=set()
for i in range(n):
  previous.add(i)
while count<(n*(n-1)):
  ans+=1
  tempcount=count
  r=set()
  for i in previous:
    if m[i]:
      t=m[i][-1]
      if m[t-1]:
        if m[t-1][-1]==i+1:
          count+=1
          r.add(i)
          r.add(t-1)
  previous=set()
  for k in r:
    m[k].pop()
    previous.add(k)
    if m[k]:
      previous.add(m[k][-1])
  if tempcount==count:
    failflag=1
    break
if failflag==1:
  print(-1)
else:
  print(ans)

Buggy submission (verdict: Runtime Error):
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
n=int(input())
m=[]
for i in range(n):
  a=list(map(int,input().split()))
  a.reverse()
  m.append(a)
ans=0
count=0
failflag=0
previous=set()
for i in range(n):
  previous.add(i)
while count<(n*(n-1)):
  ans+=1
  tempcount=count
  r=set()
  for i in previous:
    if m[i]:
      t=m[i][-1]
      if m[t-1]:
        if m[t-1][-1]==i+1:
          count+=1
          r.add(i)
          r.add(t-1)
  previous=set()
  for k in r:
    m[k].pop()
    previous.add(k)
    previous.add(m[k][-1])
  if tempcount==count:
    failflag=1
    break
if failflag==1:
  print(-1)
else:
  print(ans)

Buggy submission (verdict: Runtime Error):
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
n=int(input())
m=[]
for i in range(n):
  a=list(map(int,input().split()))
  a.reverse()
  m.append(a)
ans=0
count=0
failflag=0
previous=set()
for i in range(n):
  previous.add(i)
while count<(n*(n-1)):
  ans+=1
  tempcount=count
  r=set()
  for i in previous:
    if m[i]:
      t=m[i][-1]
      if m[t-1]:
        if m[t-1][-1]==i+1:
          count+=1
          r.add(i)
          r.add(t-1)
  previous=()
  for k in r:
    m[k].pop()
    previous.add(k)
  if tempcount==count:
    failflag=1
    break
if failflag==1:
  print(-1)
else:
  print(ans)
Problem p03774 (python)

Fixed submission:
n,m=map(int,input().split())
a=[]
b=[]
c=[]
d=[]
for i in range(n):
  A,B=map(int,input().split())
  a.append(A)
  b.append(B)
for i in range(m):
  C,D=map(int,input().split())
  c.append(C)
  d.append(D)
for i in range(n):
  minimum=1000000000
  ans=0
  for j in range(m):
    if abs(a[i]-c[j])+abs(b[i]-d[j])<minimum:
      minimum=abs(a[i]-c[j])+abs(b[i]-d[j])
      ans=j+1
  print(ans)

Buggy submission (verdict: Runtime Error):
n,m=map(int,input().split())
a=[]
b=[]
for i in range(n):
  x,y=map(int,input().split())
  a.append(x,y)
for i in range(m):
  x,y=map(int,input().split())
  b.append(x,y)
for i in a:
  ans=10**18
  t=0
  for j in range(m):
    if abs(i[0]-b[j][0])+abs(i[1]-b[j][1])<ans:
      t=j+1
      ans=abs(i[0]-b[j][0])+abs(i[1]-b[j][1])
  print(t)

Buggy submission (verdict: Runtime Error):
n,m=map(int,input().split())
a=[]
b=[]
for i in range(n):
  x,y=map(int,input().split())
  a.append(x,y)
for i in range(m):
  x,y=map(int,input().split())
  b.append(x,y)
for i in a:
  ans=10**18
  t=0
  for j in b:
    if abs(i[0]-j[0])+abs(i[1]-j[1])<ans:
      t=j+1
      ans=abs(i[0]-j[0])+abs(i[1]-j[1])
  print(t)
Problem p03803 (python)

Fixed submission:
a,b=map(int,input().split())
if a==b:
  print('Draw')
else:
  if a==1:
    print('Alice')
  elif b==1:
    print('Bob')
  elif a>b:
    print('Alice')
  else:
    print('Bob')

Buggy submission (verdict: Runtime Error):
a,b=int(input().split())
if a==b:
  print('Draw')
else:
  if a==1:
    print('Alice')
  elif b==1:
    print('Bob')
  elif a>b:
    print('Alice')
  else:
    print('Bob')
Problem p02550 (python)

Fixed submission:
def f(x, m):
    return (x ** 2) % m


def main():
    n, x, m = map(int, input().split())
    lst = [[False, 0] for _ in range((m + 1))]
    lst[x] = [True, 1]
    res = [x]
    loop = 0

    for i in range(2, m + 1):
        x = f(x, m)
        if lst[x][0] == False:
            lst[x][0] = True
            lst[x][1] = i
            res.append(x)
        else:
            loop = i - lst[x][1]
            non_loop = lst[x][1] - 1
            break
    if loop == 0:
        print(sum(res[:n]))
        exit()
    ans = sum(res[:non_loop])
    ans += (n - non_loop) // loop * sum(res[non_loop:])
    ans += sum(res[non_loop:non_loop + (n - non_loop) % loop])
    print(ans)


if __name__ == "__main__":
    main()

Buggy submission (verdict: Runtime Error):
def f(x, m):
    return (x ** 2) % m


def main():
    n, x, m = map(int, input().split())
    lst = [[False, 0] for _ in range((m + 1))]
    lst[x] = [True, 1]
    res = [x]

    for i in range(2, m + 1):
        x = f(x, m)
        if lst[x][0] == False:
            lst[x][0] = True
            lst[x][1] = i
            res.append(x)
        else:
            loop = i - lst[x][1]
            non_loop = lst[x][1] - 1
            break
    if loop == 0:
        print(sum(res))
        exit()
    ans = sum(res[:non_loop])
    ans += (n - 2) // loop * sum(res[non_loop:])
    ans += sum(res[non_loop:non_loop + (n - 2) % loop])
    print(ans)


if __name__ == "__main__":
    main()

Buggy submission (verdict: Runtime Error):
def f(x, m):
    return (x ** 2) % m


def main():
    n, x, m = map(int, input().split())
    lst = [[False, 0] for _ in range((m + 1))]
    lst[x] = [True, 1]
    res = [x]

    for i in range(2, m + 1):
        x = f(x, m)
        if lst[x][0] == False:
            lst[x][0] = True
            lst[x][1] = i
            res.append(x)
        else:
            loop = i - lst[x][1]
            non_loop = lst[x][1] - 1
            break

    ans = sum(res[:non_loop])
    ans += (n - 2) // loop * sum(res[non_loop:])
    ans += sum(res[non_loop:non_loop + (n - 2) % loop])
    print(ans)


if __name__ == "__main__":
    main()
Problem p02623 (python)

Fixed submission:
def main():
    N, M, K = map(int, input().split())
    A = list(map(int, input().split()))
    B = list(map(int, input().split()))

    a, b = [0], [0]
    for i in range(N):
        a.append(a[i] + A[i])
    for i in range(M):
        b.append(b[i] + B[i])

    ans, j = 0, M
    for i in range(N + 1):
        if a[i] > K:
            break

        while a[i] + b[j] > K:
            j -= 1

        ans = max(ans, i + j)

    print(ans)


if __name__ == "__main__":
    main()

Buggy submission (verdict: Runtime Error):
def main():
    N, M, K = map(int, input().split())
    A = list(map(int, input().split()))
    B = list(map(int, input().split()))

    a, b = [0], [0]
    for i in range(N):
        a.append(a[i] + A[i])
    for i in range(M):
        a.append(b[i] + B[i])

    ans, j = 0, M
    for i in range(N + 1):
        if a[i] > K:
            break

        while a[i] + b[j] > K:
            j -= 1

        ans = max(ans, i + j)

    print(ans)


if __name__ == "__main__":
    main()
Problem p02829 (python)

Fixed submission:
def main():
    A = int(input())
    B = int(input())

    ans = 6 - A - B

    print(ans)


if __name__ == "__main__":
    main()

Buggy submission (verdict: Runtime Error):
def main():
    A = input()
    B = input()

    if A == "1" and B == "2":
        ans = 3
    elif A == "2" and B == "3":
        ans = 1
    elif A == "3" and B == "1":
        ans = 2

    print(ans)


if __name__ == "__main__":
    main()
Problem p03075 (python)

Fixed submission:
a=[]

for i in range(5):
    a.append(int(input()))

k=int(input())
for i in range(5):
    for j in range(5):
        if(i==j):
            continue
        else:
            if(abs(a[i]-a[j])>k):
                print(':(')
                exit()

print('Yay!')

Buggy submission (verdict: Runtime Error):
a=[]

for i in range(6):
    a.append(int(input())

a=sort(a)
if(a[4]-a[0]>a[5]):
    print(':(')
else:
    print('Yay!')

Buggy submission (verdict: Runtime Error):
a=[]

for i in range(6):
    a.append(int(input())

a=a.sort()
if(a[4]-a[0]>a[5]):
    print(':(')
else:
    print('Yay!')

Buggy submission (verdict: Runtime Error):
a=[]

for i in range(6):
  a.append(int(input())

a=a.sort()
if(a[4]-a[0]>a[5]):
    print(':(')
else:
    print('Yay!')
Problem p03209 (python)

Fixed submission:
import numpy as np

n,x=map(int,input().split())
a,p=[1],[1]
for i in range(n):
	a.append(a[i]*2+3)
	p.append(p[i]*2+1)

def f(N,X):
	if N==0:
		return 0 if X<=0 else 1
	elif X <=1+a[N-1]:
		return f(N-1,X-1)
	else:
		return p[N-1]+1+f(N-1,X-2-a[N-1])
	
print (f(n,x))


def inputList():
	a=list(map(int,input().split()))
	return a

def multisort(li,index):
	return sorted(li,key=lambda x: x[index])

Buggy submission (verdict: Runtime Error):
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <bitset>
#include <map>
#include <string>
#include <utility>

#define repd(i,a,b) for(ll i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;

using namespace std;

int inputValue(){
	int a;
	cin >> a;
	return a;
}

void inputArray(int *p,int a){
	rep(i,a){
		cin >> p[i];
	}
}

void inputVector(vector<int> *p,int a){
	rep(i,a){
		int input;
		cin >> input;
		p -> push_back(input);
	}
}

template <typename T>
void output(T a,int precision){
	if(precision > 0){
		cout << setprecision(precision) << a << "\n";
	}else{
		cout << a << "\n";
	}
}

vector<ll> a,p;
ll f(ll n,ll x){
	if(n==0){
		if(x<=0){
			return 0;
		}else{
			return 1;
		}
	}else if(x<=1+a[n-1]){
		return f(n-1,x-1);
	}else{
		return p[n-1]+1+f(n-1,x-2-a[n-1]);
	}
}

int main(){
	//source
	ll n,x;
	cin >> n >> x;
	a.push_back(1);
	p.push_back(1);
	rep(i,n){
		a.push_back(a[i]*2+3);
		p.push_back(p[i]*2+1);
	}

	cout << f(n,x) << endl;
	return 0;
}
Problem p02547 (python)

Fixed submission:
n=int(input())
d=[list(map(int,input().split())) for _ in range(n)]

cnt=0

for i in range(n):
    if d[i][0]==d[i][1]:
        cnt+=1
        if cnt>=3:
            print('Yes')
            exit(0)
    else:
        cnt=0

print('No')

Buggy submission (verdict: Runtime Error):
n=int(input())
*a,=map(int,open(0).read().split())



for i in range(2,2*n):
    if a[i-2]==a[i-1]==a[i]:
        print('Yes')
        break
else:
    print('No')
Problem p02595 (python)

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

cnt=0

for _ in range(n):
    x,y=list(map(int,input().split()))
    if x**2+y**2<=d**2:
        cnt+=1

print(cnt)

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

cnt=0

for x,y in list(map(int,input().split())):
    if x**2+y**2<=d**2:
        cnt+=1

print(cnt)
Problem p02598 (python)

Fixed submission:
n,k=list(map(int,input().split()))
alst=list(map(lambda x:int(x)*100,input().split()))

ok=max(alst)
ng=0

while abs(ok-ng)>1:
    cen=(ok+ng)//2

    cnt=0

    for a in alst:
        cnt+=(a+cen-1)//cen-1

    if cnt<=k:
        ok=cen
    else:
        ng=cen+1

if ok%100==0:
    print(ok//100)
else:
    print(ok//100+1)

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

ok=max(alst)
ng=0

while abs(ok-ng)>0:
    cen=(ok+ng)//2

    cnt=0

    for a in alst:
        cnt+=(a+cen-1)//cen-1

    if cnt<=k:
        ok=cen
    else:
        ng=cen+1

print(ok)
Problem p02685 (python)

Fixed submission:
N,M,K=list(map(int,input().split()))

mod=998244353

com=1
ans=0

for i in range(K+1):
    ans+=M*com*pow(M-1,N-1-i,mod)
    ans%=mod
    com*=(N-1-i)*pow(i+1,mod-2,mod)
    com%=mod

print(ans)

Buggy submission (verdict: Runtime Error):
N,M,K=list(map(int,input().split()))

mod=998244353

comb=1
pw=(M*pow(M-1,N-1,mod))%mod
ans=pw*comb

invmodk=[0]*(K+1)
invmodk[1]=1
invmodm=pow(M-1,mod-2,mod)
for k in range(2,K+1):
    invmodk[k]=invmodk[mod%k]*(mod-mod//k)%mod

for k in range(1,K+1):
    pw=(pw*invmodm)%mod
    comb*=(N-k)*invmodk[k]
    ans=(ans+pw*comb)%mod

print(ans)
Problem p02863 (python)

Fixed submission:
n,t=list(map(int,input().split()))
ab=sorted([list(map(int,input().split())) for _ in range(n)],key=lambda x:x[0])

dp=[[-10**10]*(t+1) for _ in range(n+1)]
dp[0][0]=0
dp[1][0]=0
ans=ab[0][1]
for i in range(1,n):
    for j in range(t):
        dp[i+1][j]=max(dp[i][j],dp[i][j-ab[i-1][0]]+ab[i-1][1] if j>=ab[i-1][0] else -10**10)
        ans=max(ans,dp[i+1][j]+ab[i][1])

print(ans)

Buggy submission (verdict: Runtime Error):
n,t=list(map(int,input().split()))
ab=sorted([list(map(int,input().split())) for _ in range(n)],key=lambda x: 10000*x[1]+x[0])

a,b=ab.pop()
ans2=b
t-=1

dp=[[-10**10]*3001 for _ in range(n+1)]
dp[0][0]=0

bmax=0
for i in range(n-1):
    for j in range(t+1):
        dp[i+1][j]=max(dp[i][j],dp[i][j-ab[i][0]]+ab[i][1] if j>=ab[i][0] else 0)
        bmax=max(bmax,dp[i+1][j])

ans2+=bmax

print(max(ans,ans2))
Problem p02925 (python)

Fixed submission:
import sys
sys.setrecursionlimit(10**6)

n=int(input())
g=[set() for _ in range(n*(n-1)//2+1)]
visit=[0]*(n*(n-1)//2+1)
d=[0]*(n*(n-1)//2+1)

for i in range(1,n+1):
    last=0
    for j in list(map(int,input().split())):
        mi,ma=(min(i-1,j-1),max(i-1,j-1))
        current=ma*(ma-1)//2+mi+1
        g[last].add(current)
        last=current

def dfs(u):
    if visit[u]==2:
        return d[u]
    
    ans=0
    visit[u]=1
    for v in g[u]:
        if visit[v]==1:
            print(-1)
            exit(0)
        
        d[u]=max(d[u],1+dfs(v))
    
    visit[u]=2
    return d[u]

print(dfs(0))

Buggy submission (verdict: Runtime Error):
n=int(input())
g=[set() for _ in range(n*(n-1)//2+1)]
visit=[0]*(n*(n-1)//2+1)
d=[0]*(n*(n-1)//2+1)

for i in range(1,n+1):
    last=0
    for j in list(map(int,input().split())):
        mi,ma=(min(i-1,j-1),max(i-1,j-1))
        current=ma*(ma-1)//2+mi+1
        g[last].add(current)
        last=current

def dfs(u):
    if visit[u]==2:
        return d[u]
    
    ans=0
    visit[u]=1
    for v in g[u]:
        if visit[v]==1:
            print(-1)
            exit(0)
        
        d[u]=max(d[u],1+dfs(v))
    
    visit[u]=2
    return d[u]

print(dfs(0))

Buggy submission (verdict: Runtime Error):
n=int(input())
g={(i,j):set() for i in range(n+1) for j in range(n+1) if i<j}
visit={(i,j):0 for i in range(n+1) for j in range(n+1) if i<j}
d={(i,j):0 for i in range(n+1) for j in range(n+1) if i<j}

inf=10**10

for i in range(1,n+1):
    last=(0,1)
    for j in list(map(int,input().split())):
        current=(min(i,j),max(i,j))
        g[last].add(current)
        last=current

def dfs(u):
    if visit[u]==2:
        return d[u]
        
    if len(g[u])==0:
        return 0
    
    ans=0
    visit[u]=1
    for v in g[u]:
        if visit[v]==1:
            print(-1)
            exit(0)
        
        ans=max(ans,1+dfs(v))
    
    visit[u]=2
    d[u]=ans
    return d[u]

print(dfs((0,1)))
Problem p03017 (python)

Fixed submission:
n,a,b,c,d=list(map(int,input().split()))
s=input()

if c<d:
    for i in range(a-1,d-1):
        if s[i]=='#' and s[i+1]=='#':
            print('No')
            exit(0)
    print('Yes')
else:
    for i in range(b-1,d):
        if s[i-1]=='.' and s[i]=='.' and s[i+1]=='.':
            break
    else:
        print('No')
        exit(0)
    
    for i in range(a-1,c-1):
        if s[i]=='#' and s[i+1]=='#':
            print('No')
            exit(0)
    
    print('Yes')

Buggy submission (verdict: Runtime Error):
n,a,b,c,d=list(map(int,input().split()))
s=input()

if c<d:
    for i in range(b+1,d):
        if s[i]=='#' and s[i+1]=='#':
            print('No')
            exit(0)
    
    for i in range(a+1,c):
        if s[i]=='#' and s[i+1]=='#':
            print('No')
            exit(0)
    print('Yes')
else:
    for i in range(b,min(d+1,n)):
        if s[i]=='#':
            continue

        if s[i-1]=='.' and s[i+1]=='.':
            break
    else:
        print('No')
        exit(0)
    
    for i in range(a+1,c):
        if s[i]=='#' and s[i+1]=='#':
            print('No')
            exit(0)
    
    for i in range(b+1,d):
        if s[i]=='#' and s[i+1]=='#':
            print('No')
            exit(0)
    
    print('Yes')

Buggy submission (verdict: Runtime Error):
n,a,b,c,d=list(map(int,input().split()))
s=input()

if c<d:
    for i in range(b+1,d):
        if s[i]=='#' and s[i+1]=='#':
            print('No')
            exit(0)
    
    for i in range(a+1,c):
        if s[i]=='#' and s[i+1]=='#':
            print('No')
            exit(0)
    print('Yes')
else:
    for i in range(b,d+1):
        if s[i]=='#':
            continue

        if s[i-1]=='.' and s[i+1]=='.':
            break
    else:
        print('No')
        exit(0)
    
    for i in range(a,c):
        if s[i]=='#' and s[i+1]=='#':
            print('No')
            exit(0)
    
    for i in range(b,d):
        if s[i]=='#' and s[i+1]=='#':
            print('No')
            exit(0)
    
    print('Yes')