Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
import math
a,b,X = map(int, input().split())
x = X/(a**2)

if x<=b/2:
        t = 2*a*x/(b**2)
        print(90-math.degrees(math.atan(t)))

else:
        if (a**2)*b==x:
                print(0)
        else:
                t = a/(2*b-2*x)
                print(90-math.degrees(math.atan(t)))


Fixed submission:
import math
a,b,X = map(int, input().split())
x = X/(a**2)

if x<=b/2:
        t = 2*a*x/(b**2)
        print(90-math.degrees(math.atan(t)))

else:
        if a**2*b==X:
                print(0)
        else:
                t = a/(2*b-2*x)
                print(90-math.degrees(math.atan(t)))

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

if x<=b/2:
        t = 2*a*x/(b**2)
        print(90-math.degrees(math.atan(t)))

else:
        if a**2*b==x:
                print(0)
        else:
                t = a/(2*b-2*x)
                print(90-math.degrees(math.atan(t)))


Fixed submission:
import math
a,b,X = map(int, input().split())
x = X/(a**2)

if x<=b/2:
        t = 2*a*x/(b**2)
        print(90-math.degrees(math.atan(t)))

else:
        if a**2*b==X:
                print(0)
        else:
                t = a/(2*b-2*x)
                print(90-math.degrees(math.atan(t)))

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

if x<=b/2:
        t = 2*a*x/(b**2)
        print(90-math.degrees(math.atan(t)))

else:
        if X==x:
                print(0)
        else:
                t = a/(2*b-2*x)
                print(90-math.degrees(math.atan(t)))


Fixed submission:
import math
a,b,X = map(int, input().split())
x = X/(a**2)

if x<=b/2:
        t = 2*a*x/(b**2)
        print(90-math.degrees(math.atan(t)))

else:
        if a**2*b==X:
                print(0)
        else:
                t = a/(2*b-2*x)
                print(90-math.degrees(math.atan(t)))

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

if x<=b/2:
        t = 2*a*x/(b**2)
        print(90-math.degrees(math.atan(t)))

else:
        t = a/(2*b-2*x)
        print(90-math.degrees(math.atan(t)))


Fixed submission:
import math
a,b,X = map(int, input().split())
x = X/(a**2)

if x<=b/2:
        t = 2*a*x/(b**2)
        print(90-math.degrees(math.atan(t)))

else:
        if a**2*b==X:
                print(0)
        else:
                t = a/(2*b-2*x)
                print(90-math.degrees(math.atan(t)))
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int, input().split()))
l = []
for i in range(N):
    l.append(A.index(i+1)+1)

print(*l)

Fixed submission:
N = int(input())
A = list(map(int, input().split()))
l = [0]*N
for i in range(N):
    l[A[i]-1] = i +1

print(*l)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
l = []
for i in range(N):
    l.append(i+1)
print(sum(l)-N)

Fixed submission:
N = int(input())
print(N*(N-1)//2)
Buggy python submission (verdict: Runtime Error):
import math
import sys
sys.setrecursionlimit(100000000)
N = int(input())
ll = []

for i in range(N):
    l = list(input())
    l.sort()
    s = ''.join(l)
    ll.append(s)
ll.sort()
k = 0
ans = 0
for j in range(N-1):
    if ll[j]==ll[j+1]:
        k += 1
    elif k>0:
        ans += math.factorial(k+1)/math.factorial(2)/math.factorial(k+1-2)
        k = 0
if k>0:
    ans += math.factorial(k+1)/math.factorial(2)/math.factorial(k+1-2)
print(int(ans))

Fixed submission:
import math
from operator import mul
from functools import reduce
N = int(input())
ll = []
def cmb(n,r):
    r = min(n-r,r)
    if r == 0: return 1
    over = reduce(mul, range(n, n - r, -1))
    under = reduce(mul, range(1,r + 1))
    return over // under

for i in range(N):
    l = list(input())
    l.sort()
    s = ''.join(l)
    ll.append(s)
ll.sort()
k = 0
ans = 0
for j in range(N-1):
    if ll[j]==ll[j+1]:
        k += 1
    elif k>0:
        ans += cmb(k+1, 2)
        k = 0
if k>0:
    ans += cmb(k+1, 2)
print(int(ans))

Buggy python submission (verdict: Runtime Error):
import math
N = int(input())
ll = []

for i in range(N):
    l = list(input())
    l.sort()
    s = ''.join(l)
    ll.append(s)
ll.sort()
k = 0
ans = 0
for j in range(N-1):
    if ll[j]==ll[j+1]:
        k += 1
    elif k>0:
        ans += math.factorial(k+1)/math.factorial(2)/math.factorial(k+1-2)
        k = 0
if k>0:
    ans += math.factorial(k+1)/math.factorial(2)/math.factorial(k+1-2)
print(int(ans))

Fixed submission:
import math
from operator import mul
from functools import reduce
N = int(input())
ll = []
def cmb(n,r):
    r = min(n-r,r)
    if r == 0: return 1
    over = reduce(mul, range(n, n - r, -1))
    under = reduce(mul, range(1,r + 1))
    return over // under

for i in range(N):
    l = list(input())
    l.sort()
    s = ''.join(l)
    ll.append(s)
ll.sort()
k = 0
ans = 0
for j in range(N-1):
    if ll[j]==ll[j+1]:
        k += 1
    elif k>0:
        ans += cmb(k+1, 2)
        k = 0
if k>0:
    ans += cmb(k+1, 2)
print(int(ans))
Buggy python submission (verdict: Runtime Error):
L, R = map(int ,input().split())
if R-L >= 2019:
    print(0)
else:
    li = []
    for i in range(L, R+1):
        li.append(i%2019)
    l = []
    for i in range(len(li)-1):
        for j in range(i+1,len(li)):
            l.append((li[i]*li[j])%2019)
    a = min(l)

print((a)%2019)


Fixed submission:
L, R = map(int ,input().split())
if R-L >= 2019:
    print(0)
else:
    li = []
    for i in range(L, R+1):
        li.append(i%2019)
    l = []
    for i in range(len(li)-1):
        for j in range(i+1,len(li)):
            l.append((li[i]*li[j])%2019)
    a = min(l)

    print((a)%2019)

Buggy python submission (verdict: Runtime Error):
L, R = map(int ,input().split())
if R-L >= 2019:
    print(0)
else:
    li = []
    for i in range(L, R+1):
        li.append(i%2019)
    a = min(li)
    li[li.index(a)] += 2019
    b = min(li)

print((a*b)%2019)


Fixed submission:
L, R = map(int ,input().split())
if R-L >= 2019:
    print(0)
else:
    li = []
    for i in range(L, R+1):
        li.append(i%2019)
    l = []
    for i in range(len(li)-1):
        for j in range(i+1,len(li)):
            l.append((li[i]*li[j])%2019)
    a = min(l)

    print((a)%2019)
Buggy python submission (verdict: Runtime Error):
import math

N, K = map(int, input().split())

def blue(b):
    return math.factorial(K-1)//(math.factorial(b-1)*math.factorial(K-b))
def red(r):
    return math.factorial(N-K+1)//(math.factorial(N-K-r+1)*math.factorial(r))

for i in range(1,K+1):
    ans = blue(i)*red(i)
    print(ans%(10**9+7))



Fixed submission:
import math

N, K = map(int, input().split())

def blue(b):
    if K-1<0 or K-b<0 or b-1<0:
        return 0
    else:
        return math.factorial(K-1)//(math.factorial(b-1)*math.factorial(K-b))
def red(r):
    if N-K+1<0 or N-K-r+1<0 or r<0:
        return 0
    else:
        return math.factorial(N-K+1)//(math.factorial(N-K-r+1)*math.factorial(r))

for i in range(1,K+1):
    ans = blue(i)*red(i)
    print(ans%(10**9+7))
Buggy python submission (verdict: Time Limit Exceeded):
N, M = map(int, input().split())
l = [0]*N

for i in range(M):
        L, R = map(int, input().split())
        for j in range(L, R+1):
                l[j-1] += 1
print(l.count(M))

Fixed submission:
N, M = map(int, input().split())
l = [0]*(N+1)

for i in range(M):
        L, R = map(int, input().split())
        l[L-1] += 1
        l[R] -= 1
        

k = 0
ans = 0
for i in l:
        k += i
        if k == M:
                ans += 1
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
s = input()
l = []
c = 0
d = 0
ans = 10**6

if s.count("#")==0:
    print(0)
else:
    for i in range(N):
        if s[i] == "#":
            if d != 0:
                c += 1
                d += 1
            else:
                l.append(c + s[i:N+1].count("."))
                c += 1
                d += 1
        d = 0
    print(min(l))

        



Fixed submission:
N = int(input())
s = input()
l = []
b = 0
w = s.count(".")

for i in range(N):
    if s[i] == "#":
        l.append(b+w)
        b += 1
    else:
        w -= 1
        l.append(b+w)
print(min(l))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
s = input()
l = []
c = 0
ans = 10**6

if s.count("#")==0:
    print(0)
else:
    for i in range(N):
        if s[i] == "#":
            l.append(c + s[i:N+1].count("."))
            c += 1
    print(min(l))

        



Fixed submission:
N = int(input())
s = input()
l = []
b = 0
w = s.count(".")

for i in range(N):
    if s[i] == "#":
        l.append(b+w)
        b += 1
    else:
        w -= 1
        l.append(b+w)
print(min(l))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
s = input()
l = []
c = 0
ans = 10**6

if s.count("#")==0:
    print(0)
else:
    for i in range(N):
        if s[i] == "#":
            k = i
            aaa = s[i:N+1].count(".")
            ans = min(c + aaa, ans)
            c += 1
    print(ans)

        



Fixed submission:
N = int(input())
s = input()
l = []
b = 0
w = s.count(".")

for i in range(N):
    if s[i] == "#":
        l.append(b+w)
        b += 1
    else:
        w -= 1
        l.append(b+w)
print(min(l))
Buggy python submission (verdict: Runtime Error):
X, Y, Z, K = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
l = []

for i in a:
    for j in b:
        l.append(a + b)
l.sort(reverse = True)
l = l[:K]

L = []

for i in l:
    for j in c:
        L.append(i + j)

L.sort(reverse = True)
print(*L[:K], sep = "\n")


Fixed submission:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
if b - a > k or  c - a > k or  d - a > k or  e - a > k or  c - b > k or  d - b > k or  e - b > k or  d - c > k or  e - c > k or  e - d > k:
    print(":(")
else:
    print("Yay!")

Buggy python submission (verdict: Runtime Error):
X, Y, Z, K = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
l = []

for i in range(X):
    for j in range(Y):
        l.append(a[i] + b[j])
l.sort(reverse = True)
l = l[:K]

L = []
c.sort(reverse = True)

for i in range(len(l)):
    for j in range(min(Z, K)):
        L.append(l[i] + c[j])

L.sort(reverse = True)
print(*L[:K], sep = "\n")


Fixed submission:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
if b - a > k or  c - a > k or  d - a > k or  e - a > k or  c - b > k or  d - b > k or  e - b > k or  d - c > k or  e - c > k or  e - d > k:
    print(":(")
else:
    print("Yay!")

Buggy python submission (verdict: Runtime Error):
X, Y, Z, K = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
l = []

for i in range(X):
    for j in range(Y):
        l.append(a[i] + b[j])
l.sort(reverse = True)
l = l[:K]

L = []
c.sort(reverse = True)

for i in range(len(l)):
    for j in range(min(Z, K)):
        L.append(l[i] + c[j])

L.sort(reverse = True)
for i in range(K):
    print(L[i])

Fixed submission:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
if b - a > k or  c - a > k or  d - a > k or  e - a > k or  c - b > k or  d - b > k or  e - b > k or  d - c > k or  e - c > k or  e - d > k:
    print(":(")
else:
    print("Yay!")
Buggy python submission (verdict: Time Limit Exceeded):
N, Q = map(int, input().split())
s = input()
k = 0

for i in range(Q):
	l, r = map(int, input().split())
	a = s[l - 1: r]
	print(a.count("AC"))



Fixed submission:
N, Q = map(int, input().split())
s = input()
a = [0] * (N + 1)

for i in range(N):
	a[i + 1] = a[i] + (1 if s[i : i + 2] == "AC" else 0)
for i in range(Q):
	l, r = map(int, input().split())
	print(a[r - 1] - a[l - 1])

Buggy python submission (verdict: Time Limit Exceeded):
N, Q = map(int, input().split())
s = input()
k = 0

for i in range(Q):
	l, r = map(int, input().split())
	a = s[l - 1: r]
	for j in range(len(a) - 1):
		if (a[j] == "A"):
			if (a[j + 1] == "C"):
				k += 1
	print(k)
	k = 0



Fixed submission:
N, Q = map(int, input().split())
s = input()
a = [0] * (N + 1)

for i in range(N):
	a[i + 1] = a[i] + (1 if s[i : i + 2] == "AC" else 0)
for i in range(Q):
	l, r = map(int, input().split())
	print(a[r - 1] - a[l - 1])
Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input().split())
print(min(c, b//a)

Fixed submission:
a,b,c=map(int,input().split())
d=b//a
if d<=c:
  print(d)
else:
  print(c)
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
print(max(10*a+(b+c),10*b+(a+c),10*c+(a+c))

Fixed submission:
a,b,c=map(int,input().split())
print(10*max(a,b,c)+a+b+c-max(a,b,c))
Buggy python submission (verdict: Runtime Error):
a, b = input().split()
print("H" if a == b else "D")aa

Fixed submission:
a, b = input().split()
print("H" if a == b else "D")
Buggy python submission (verdict: Runtime Error):
print("A"%s"C"%input()[8])

Fixed submission:
s=input()
print("A"+s[8]+"C")
Buggy python submission (verdict: Runtime Error):
n = int(input())
l = list(map(int, input().split()))
ans = 1

if 0 in a:
  print(0)
  exit()

for i in range(n):
  ans*=ans*l[i]
  if ans > 10**18:
      print(-1)
      exit()

print(ans)
  


Fixed submission:
n = int(input())
l = list(map(int, input().split()))
ans = 1

if 0 in l:
  print(0)
  exit()

for i in range(n):
  ans*=l[i]
  if ans > 10**18:
      print(-1)
      exit()

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
l=list(map(int,input().split()))
ans=1
for i in range (n):
  ans=ans*l[i]
  
if ans>10**18:
  print(-1)
else:
  print(ans)


Fixed submission:
n = int(input())
l = list(map(int, input().split()))
ans = 1

if 0 in l:
  print(0)
  exit()

for i in range(n):
  ans*=l[i]
  if ans > 10**18:
      print(-1)
      exit()

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
l=list(map(int,input().split()))
ans=1
for i in range (n):
  ans=ans*l[i]
  
if ans>10**18:
  print(-1)
else:
  print(ans)

Fixed submission:
n = int(input())
l = list(map(int, input().split()))
ans = 1

if 0 in l:
  print(0)
  exit()

for i in range(n):
  ans*=l[i]
  if ans > 10**18:
      print(-1)
      exit()

print(ans)
Buggy python submission (verdict: Runtime Error):
x=int(input())

for i in range (200):
  for j in range (-200,200):
    if i**5-j**5==x:
      print(i,j)
      exit()

Fixed submission:
s=input()

if s=='ABC':
  print('ARC')
else:
  print('ABC')
Buggy python submission (verdict: Runtime Error):
from decimal import *
x=int(input())

for i in range (100):
  h=Decimal(x)-Decimal(i)**Decimal('5')
  if h<=0:
    bh=Decimal(h)**Decimal('0.2')
    if Decimal(bh)%1==0:
      print(i,int(bh))
      exit()
  else:
    hh=abs(h)
    bh=Decimal(hh)**Decimal('0.2')
    if Decimal(bh)%1==0:
      print(i,(-1)*int(bh))
      exit()

Fixed submission:
x=int(input())

for i in range (200):
  for j in range (-200,200):
    if (i**5-j**5)==x:
      print(i,j)
      exit()

Buggy python submission (verdict: Runtime Error):
from decimal import *
x=int(input())

for i in range (100):
  h=Decimal(x)-Decimal(i)**Decimal('5')
  if h<0:
    bh=Decimal(h)**Decimal('0.2')
    if Decimal(bh)%1==0:
      print(i,int(bh))
      exit()
  else:
    hh=abs(h)
    bh=Decimal(h)**Decimal('0.2')
    if Decimal(bh)%1==0:
      print(i,(-1)*int(bh))
      exit()

Fixed submission:
x=int(input())

for i in range (200):
  for j in range (-200,200):
    if (i**5-j**5)==x:
      print(i,j)
      exit()
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = [str(input()) for i in range(n)]
print(len(set(s)))


Fixed submission:
s,w=map(int,input().split())
if s>w:
  print('safe')
else:
  print('unsafe')
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
l=[]
c=0
for i in range (n):
  a=input()
  if not a in l:
    l.append(a)
    c+=1
    
print(c)

Fixed submission:
n = int(input())
s = [str(input()) for i in range(n)]
print(len(set(s)))

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
l=[]
c=0
for i in range (n):
  a=input()
  if not a in l:
    l.append(a)
    c+=1
    
print(c)

Fixed submission:
n = int(input())
s = [str(input()) for i in range(n)]
print(len(set(s)))
Buggy python submission (verdict: Runtime Error):
k=int(input())
l=[1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]

print(l[k])

Fixed submission:
k=int(input())
l=[1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]

print(l[k-1])
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if a**2+b**2+c**2-2*a*b-2*b*c-2*c*a>0:
  if c-a-b>0:
  print('Yes')
  else:
    print('No')
else:
  print ('No')


Fixed submission:
a,b,c=map(int,input().split())
if a**2+b**2+c**2-2*a*b-2*b*c-2*c*a>0:
  if c-a-b>0:
    print('Yes')
  else:
    print('No')
else:
  print ('No')

Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if a**2+b**2+c**2-2*a*b-2*b*c-2*c*a>0:
  if c-a-b>:
  print('Yes')
  else:
    print('No')
else:
  print ('No')


Fixed submission:
a,b,c=map(int,input().split())
if a**2+b**2+c**2-2*a*b-2*b*c-2*c*a>0:
  if c-a-b>0:
    print('Yes')
  else:
    print('No')
else:
  print ('No')
Buggy python submission (verdict: Time Limit Exceeded):
n,a,b=map(int,input().split())
c=0
ans=0

while c<n:
  c=c+a+b
  ans+=a
  
if c==n:
  print(ans)
else:
  if c-n<=b:
    print(ans)
  else:
    print(ans-c+n+b)

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

q=n//(a+b)
r=n-q*(a+b)
if r>=a:
  print(a*(q+1))
else:
  print(a*q+r)

Buggy python submission (verdict: Time Limit Exceeded):
n,a,b=map(int,input().split())
c=0
ans=0

while c<n:
  c=c+a+b
  ans+=a
  
if c==n:
  print(ans)
else:
  if c-n<=b:
    print(ans)
  else:
    print(ans-c+n+b)

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

q=n//(a+b)
r=n-q*(a+b)
if r>=a:
  print(a*(q+1))
else:
  print(a*q+r)
Buggy python submission (verdict: Time Limit Exceeded):
from collections import deque
s=input()
q=int(input())
ans=deque(s)
for _ in range(q):
  que=input()
  if que[0]=='1':
    ans.reverse()
  else:
    t,f,c=map(str,que.split())
    if f=='1':
      ans.appendleft(c)
    else:
      ans.append(c)
      
print(''.join(ans))




Fixed submission:
def main():
  from collections import deque
  s=input()
  q=int(input())
  turn = 2
  d=deque(s)

  for _ in [0]*q:
      query = input()
      if query[0] == "1":
          t = int(query)
          turn = 3 - turn
      else:
          t,f,c = map(str,query.split())
          if (int(f) + turn)% 2  == 0:
              d.append(c)
          else:
              d.appendleft(c)
  if turn == 2:
      print("".join(d))
  else:
      print("".join(list(d)[::-1]))
main()

Buggy python submission (verdict: Time Limit Exceeded):
s=input()
q=int(input())
for _ in range(q):
  L=list(input().split())
  if L[0]=='1':
    s=s[::-1]
  else:
    if L[1]=='1':
      t=L[2]+s
      s=t
    else:
      s+=L[2]
      
print(s)

Fixed submission:
def main():
  from collections import deque
  s=input()
  q=int(input())
  turn = 2
  d=deque(s)

  for _ in [0]*q:
      query = input()
      if query[0] == "1":
          t = int(query)
          turn = 3 - turn
      else:
          t,f,c = map(str,query.split())
          if (int(f) + turn)% 2  == 0:
              d.append(c)
          else:
              d.appendleft(c)
  if turn == 2:
      print("".join(d))
  else:
      print("".join(list(d)[::-1]))
main()

Buggy python submission (verdict: Time Limit Exceeded):
s=input()
q=int(input())
for _ in range(q):
  L=list(input().split())
  if L[0]=='1':
    s=s[::-1]
  else:
    if L[1]=='1':
      t=L[2]+s
      s=t
    else:
      s+=L[2]
      
print(s)

Fixed submission:
def main():
  from collections import deque
  s=input()
  q=int(input())
  turn = 2
  d=deque(s)

  for _ in [0]*q:
      query = input()
      if query[0] == "1":
          t = int(query)
          turn = 3 - turn
      else:
          t,f,c = map(str,query.split())
          if (int(f) + turn)% 2  == 0:
              d.append(c)
          else:
              d.appendleft(c)
  if turn == 2:
      print("".join(d))
  else:
      print("".join(list(d)[::-1]))
main()
Buggy python submission (verdict: Runtime Error):
n=int(input())
l=list(map(int,input(),split()))

s=min(l)
g=max(l)
ans=0
for k in range (n):
  ans+=(l[k]-s)**2

for i in range(s+1,g+1):
  hyp=0
  for j in range (n):
    hyp+=(l[j]-i)**2
  if hyp<ans:
    ans=hyp
    
print (ans)

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

s=min(l)
g=max(l)
ans=0
for k in range (n):
  ans+=(l[k]-s)**2

for i in range(s+1,g+1):
  hyp=0
  for j in range (n):
    hyp+=(l[j]-i)**2
  if hyp<ans:
    ans=hyp
    
print (ans)
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if a==b:
  if a==c:
    print("No")
  else:
    print("Yes")
elif a==c:
  print("Yes")
elif b==c:
  prunt("Yes")
else:
  print("No")


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

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

Fixed submission:
a,b,c=map(int,input().split())
if a==b:
  if a==c:
    print("No")
  else:
    print("Yes")
elif a==c:
  print("Yes")
elif b==c:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
a=int(input())
Papers=list(map(int,input().split()))
m=0
for i in range (a):
  if Papers[i] %2==0:
    if not (Papers[i] %3==0 or Papers[i] %5==0):
      m=m+1

if not m=0:
  print("DENIED")
else:
  print("APPROVED")


Fixed submission:
a=int(input())
Papers=list(map(int,input().split()))
m=0
for i in range (a):
  if Papers[i] %2==0:
    if not (Papers[i] %3==0 or Papers[i] %5==0):
      m=m+1

if not m==0:
  print("DENIED")
else:
  print("APPROVED")

Buggy python submission (verdict: Runtime Error):
a=int(input())
Paper=list(map(int,input().split()))
m=0
for i in range (a):
  if Paper[i]%2==0:
    if not Paper[i]%3==0 or Paper[i]%5==0:
      m=m+1
return m

if not m==0:
  print("DENIED")
else:
  print("APPROVED")


Fixed submission:
a=int(input())
Papers=list(map(int,input().split()))
m=0
for i in range (a):
  if Papers[i] %2==0:
    if not (Papers[i] %3==0 or Papers[i] %5==0):
      m=m+1

if not m==0:
  print("DENIED")
else:
  print("APPROVED")

Buggy python submission (verdict: Runtime Error):
a=int(input())
Paper=list(map(int,input().split()))
m=0
for i in range (a):
  if Paper[i]%2==0:
    if not Paper[i]%3==0 or Paper[i]%5==0:
      m=m+1
return m

if not m=0:
  print("DENIED")
else:
  print("APPROVED")


Fixed submission:
a=int(input())
Papers=list(map(int,input().split()))
m=0
for i in range (a):
  if Papers[i] %2==0:
    if not (Papers[i] %3==0 or Papers[i] %5==0):
      m=m+1

if not m==0:
  print("DENIED")
else:
  print("APPROVED")
Buggy python submission (verdict: Runtime Error):
a,b=input().split()
c,d=map(int,input().split())
e=imput()
if e==a:
  c=c-1
else:
  d=d-1
print(c,d)


Fixed submission:
a,b=input().split()
c,d=map(int,input().split())
e=input()
if e==a:
  c=c-1
else:
  d=d-1
print(c,d)

Buggy python submission (verdict: Runtime Error):
a,b=input().float()
c,d=map(int,input().float())
e=imput()
if e==a:
  c=c-1
else:
  d=d-1
print(c,d)


Fixed submission:
a,b=input().split()
c,d=map(int,input().split())
e=input()
if e==a:
  c=c-1
else:
  d=d-1
print(c,d)

Buggy python submission (verdict: Runtime Error):
a,b=input().float()
c,d=map(int,input().float())
e=imput()
if e=='a':
  c=c-1
else:
  d=d-1
print(c,d)


Fixed submission:
a,b=input().split()
c,d=map(int,input().split())
e=input()
if e==a:
  c=c-1
else:
  d=d-1
print(c,d)