Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
import sys
import math
import itertools
import bisect
from copy import copy,deepcopy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(map(int,input().split()))
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

N,M = I()
keta = [-1]*(N)
for i in range(M):
    s,c = I()
    if keta[s-1] == -1 or keta[s-1] == c:
        keta[s-1] = c
    else:
        print(-1)
        exit()
if len(keta) == 1 and keta[0] == 0:
    print(0)
    exit()
if keta[i] == -1:
    keta[i] = 1
for i in range(N):
    if keta[i] == -1:
        keta[i] = '0'
    else:
        keta[i] = str(keta[i])
if ''.join(keta) != str(int(''.join(keta))):
    print(-1)
else:
    print(''.join(keta))

Fixed submission:
N,M = list(map(int,input().split()))
A = ['a']*N
for i in range(M):
  s,c = list(map(int,input().split()))
  if A[s-1] != 'a' and A[s-1] != str(c):
    print('-1')
    exit()
  else:
    A[s-1] = str(c)
if A[0] == '0' and len(A) != 1:
  print('-1')
  exit()
elif A[0] == 'a' and len(A) != 1:
  A[0] = '1'
for i in range(N):
      if A[i] == 'a':
        A[i] = '0'
print(''.join(A))

Buggy python submission (verdict: Runtime Error):
import sys
import math
import itertools
import bisect
from copy import copy,deepcopy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(map(int,input().split()))
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

N,M = I()
keta = [-1]*(N)
for i in range(M):
    s,c = I()
    if keta[s-1] == -1 or keta[s-1] == c:
        keta[s-1] = c
    else:
        print(-1)
        exit()
if keta[i] == -1:
    keta[i] = 1
for i in range(N):
    if keta[i] == -1:
        keta[i] = '0'
    else:
        keta[i] = str(keta[i])
if ''.join(keta) != str(int(''.join(keta))):
    print(-1)
else:
    print(''.join(keta))

Fixed submission:
N,M = list(map(int,input().split()))
A = ['a']*N
for i in range(M):
  s,c = list(map(int,input().split()))
  if A[s-1] != 'a' and A[s-1] != str(c):
    print('-1')
    exit()
  else:
    A[s-1] = str(c)
if A[0] == '0' and len(A) != 1:
  print('-1')
  exit()
elif A[0] == 'a' and len(A) != 1:
  A[0] = '1'
for i in range(N):
      if A[i] == 'a':
        A[i] = '0'
print(''.join(A))
Buggy python submission (verdict: Runtime Error):
A = input()
b,c = (A.split(' '))
d = int(b)
e = int(c)
f = e - 100d + 1000

if 0 < d < 11:
    print(f)
else:
    print(e)

Fixed submission:
A = input()
b,c = (A.split(' '))
d = int(b)
e = int(c)
f = e - d * 100 + 1000

if 0 < d < 11:
    print(f)
else:
    print(e)

Buggy python submission (verdict: Runtime Error):
A = input()
a,b = (A.split' ')
c = int(a)
d = int(b)
if 0 < c < 11:
   print('d')
else:
   print('d+1000-100c')

Fixed submission:
A = input()
b,c = (A.split(' '))
d = int(b)
e = int(c)
f = e - d * 100 + 1000

if 0 < d < 11:
    print(f)
else:
    print(e)

Buggy python submission (verdict: Runtime Error):
A = input()
a,b = int((A.split' '))
if 0 < a < 11:
   print('b')
else:
   print('b+1000-100a')

Fixed submission:
A = input()
b,c = (A.split(' '))
d = int(b)
e = int(c)
f = e - d * 100 + 1000

if 0 < d < 11:
    print(f)
else:
    print(e)

Buggy python submission (verdict: Runtime Error):
A = input()
a,b = int(A.split' ')
if 0 < a < 11:
   print('b')
else:
   print('b+1000-100a')

Fixed submission:
A = input()
b,c = (A.split(' '))
d = int(b)
e = int(c)
f = e - d * 100 + 1000

if 0 < d < 11:
    print(f)
else:
    print(e)

Buggy python submission (verdict: Runtime Error):
A = imput()
a,b = int(A.split' ')
if 0 < a < 11:
   print('b')
else:
   print('b+1000-100a')

Fixed submission:
A = input()
b,c = (A.split(' '))
d = int(b)
e = int(c)
f = e - d * 100 + 1000

if 0 < d < 11:
    print(f)
else:
    print(e)

Buggy python submission (verdict: Runtime Error):
A = imput()
a,b = (A.split' ')
if 0 < a < 11:
   print('b')
else:
   print('b+1000-100a')

Fixed submission:
A = input()
b,c = (A.split(' '))
d = int(b)
e = int(c)
f = e - d * 100 + 1000

if 0 < d < 11:
    print(f)
else:
    print(e)

Buggy python submission (verdict: Runtime Error):
A = input()
a,b = (A.split' ')
if 0 < a < 11:
   print('b')
else:
   print('b+1000-100a')

Fixed submission:
A = input()
b,c = (A.split(' '))
d = int(b)
e = int(c)
f = e - d * 100 + 1000

if 0 < d < 11:
    print(f)
else:
    print(e)

Buggy python submission (verdict: Runtime Error):
A = input()
a,b = int(A.split' ')
if  0 < a < 11:
   print(b)
else:
   print(b - 100a + 1000)


Fixed submission:
A = input()
b,c = (A.split(' '))
d = int(b)
e = int(c)
f = e - d * 100 + 1000

if 0 < d < 11:
    print(f)
else:
    print(e)
Buggy python submission (verdict: Runtime Error):
N,K = list(map(int,input(),split()))
for i in range(100):
  if K**i <= N < K**(i+1):
    print(i+1）

Fixed submission:
n,k = list(map(int,input().split()))
for i in range(100):
  if k**i <= n < k**(i+1):
    print(i+1)

Buggy python submission (verdict: Runtime Error):
a,b = list(map(int,input().split()))
for i in range(10)
   if b**i <= a < b**(i+1):
      ans = i
      break
    else:
      ans = no
print(ans)
      

Fixed submission:
n,k = list(map(int,input().split()))
for i in range(100):
  if k**i <= n < k**(i+1):
    print(i+1)
Buggy python submission (verdict: Runtime Error):
N = int(input())
Af = list(map(int,input().split()))
A = list()
for i in range(N):
  if Af[i] % 2 == 0:
      A.append(Af[i])
      continue
  else:
      continue
for i in range(len(A)):
  if A[i] % 3 != 0 and A[i] % 5 != 0:
      print('DENIED')
      import sys
      sys.exit()
  if A[i] % 3 == 0 or A[i] % 5 == 0:
      continue 
print('APPROVED')

Fixed submission:
A = input()
if A[0] != A[2] == A[4] or A[2] != A[4] == A[0] or A[4] != A[0] == A[2]:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
A = input()
if A[0] != A[2] == A[4] or A[2] != A[4] == A[0] or A[4] != A[0] == A[2]:
    input('Yes')
else:
    input('No')

Fixed submission:
A = input()
if A[0] != A[2] == A[4] or A[2] != A[4] == A[0] or A[4] != A[0] == A[2]:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
A = input()
if A[0] != A[2] == A[4] or A[2] != A[4] == A[0] or A[0] != A[4] == A[2]:
    input('Yes')
else:
    input('No') 

Fixed submission:
A = input()
if A[0] != A[2] == A[4] or A[2] != A[4] == A[0] or A[4] != A[0] == A[2]:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
N = int(input())
Af = list(map(int,input().split()))
A = list()
for i in range(N):
  if Af[i] % 2 == 0:
      A.append(Af[1])
      continue
  else:
      continue
for i in range(len(A)):
  if A[i] % 3 != 0 and A[i] % 5 != 0:
      print('DENIED')
      import sys
      sys.exit()
  if A[i] % 3 == 0 or A[i] % 5 == 0:
      continue 
print('APPROVED')

Fixed submission:
N = int(input())
Af = list(map(int,input().split()))
A = list()
for i in range(N):
  if Af[i] % 2 == 0:
      A.append(Af[i])
      continue
  else:
      continue
for i in range(len(A)):
  if A[i] % 3 != 0 and A[i] % 5 != 0:
      print('DENIED')
      import sys
      sys.exit()
  if A[i] % 3 == 0 or A[i] % 5 == 0:
      continue 
print('APPROVED')

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
for i in range(N)
    if A[i] % 2 != 0:
      A.remove(i)
      continue
    else:
      continue
for i in range(N)
   if A[i] % 3 != 0 and A[i] % 5 != 0:
      print('DENIED')
      break
    else:
      continue
print('APRROVED')     
    

Fixed submission:
N = int(input())
Af = list(map(int,input().split()))
A = list()
for i in range(N):
  if Af[i] % 2 == 0:
      A.append(Af[i])
      continue
  else:
      continue
for i in range(len(A)):
  if A[i] % 3 != 0 and A[i] % 5 != 0:
      print('DENIED')
      import sys
      sys.exit()
  if A[i] % 3 == 0 or A[i] % 5 == 0:
      continue 
print('APPROVED')
Buggy python submission (verdict: Runtime Error):
from collections import Counter
N = int(input())
A = []
for i in range(N):
  A.append(input())
C= Counter(A)
B = 0
for v in c.values():
  B = max(B,v)
ans = []
for k, v in c.items():
  if v == B:
    ans.append(k)
ans.sort()
print(*ans,sep='\n')

Fixed submission:
from collections import Counter
N = int(input())
A = []
for i in range(N):
  A.append(input())
C= Counter(A)
B = 0
for v in C.values():
  B = max(B,v)
ans = []
for k, v in C.items():
  if v == B:
    ans.append(k)
ans.sort()
print(*ans,sep='\n')

Buggy python submission (verdict: Runtime Error):
from collections import Counter
N = int(input())
A = []
for i in range(N):
  A.append(input())
C= Counter(A)
B = 0
for v in c.values():
  B = max(B,v)
ans = []
for k, v in c.items()
  if v == B:
    ans.append(k)
ans.sort()
print(*ans,sep='\n')

Fixed submission:
from collections import Counter
N = int(input())
A = []
for i in range(N):
  A.append(input())
C= Counter(A)
B = 0
for v in C.values():
  B = max(B,v)
ans = []
for k, v in C.items():
  if v == B:
    ans.append(k)
ans.sort()
print(*ans,sep='\n')
Buggy python submission (verdict: Runtime Error):
N,K = list(map(int,input().split()))
Ha = list(map(int,input().split()))
Hb = sorted(Ha,reverse=True)
del Hb[:K]
print(sum(Hb))

Fixed submission:
H = int(input())
ans = 0
num = 1
A = [1]
for i in range(100):
  if H / 2 < 1:
    ans += 1
    break
  else:
    H = H / 2
    ans += 1
for j in range(ans-1):
  A.append(num*2)
  num = num*2
print(sum(A))
Buggy python submission (verdict: Runtime Error):
N,M = list(map(int,input().split()))
if N = M:
  print('Yes')
else:
  print('No')

Fixed submission:
N,M = list(map(int,input().split()))
if N == M:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
min = N + 1
AC = 0
for i in range(N):
  if min < A[i]:
     AC += 1
input(AC)

Fixed submission:
N,M = list(map(int,input().split()))
if N == M:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
a,b = list(map(int,input().split()))
if a <= b:
  print(a)*b
else:
  print(b)*a

Fixed submission:
a,b = list(map(int,input().split()))
if a <= b:
  c = str(a)*b
  print(c)
else:
  d = str(b)*a
  print(d)
Buggy python submission (verdict: Runtime Error):
N,M = list(map(int,input().split()))
A = ['a']*N
B = [0]*N
ans1 = 0
ans2 = 0
for i in range(M):
  C,D = input().split()
  C = int(C)-1
  if A[C] == D == 'WA':
    ans1 += 1
    B[C] += 1
  if A[C] == 'a' and D == 'WA':
    ans1 += 1
    B[C] += 1
  if A[C] == 'WA' and D == 'AC':
    ans2 += 1
    A[C] = 'AC'
  if A[C] == 'a' and D == 'AC':
    ans2 += 1
    A[C] = 'AC'
for i in range(N):
  if A[i] == 'a':
    ans1 -= B[i]
print('{0} {1}'.format(ans2,ans1))


Fixed submission:
listA = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
C = input()
for i in range(25):
  if C == listA[i]:
    print(listA[i+1])

Buggy python submission (verdict: Runtime Error):
listA = [a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z]
C = input()
for i in range(24):
  if C == listA[i]:
    print(listA[i+1])

Fixed submission:
listA = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
C = input()
for i in range(25):
  if C == listA[i]:
    print(listA[i+1])
Buggy python submission (verdict: Runtime Error):
k,x = list(map(int,input().split()))
if 500 * k >= x
   print('Yes')
else:
   print('No')

Fixed submission:
k,x = list(map(int,input().split()))
if 500 * k >= x:
   print('Yes')
else:
   print('No')
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = input()
ans = 0
for i in range(N):
  if A[i] == 'A' and A[i+1] == 'B' and A[i+2] == 'C':
    ans += 1
print(ans)

Fixed submission:
N = int(input())
A = input()
ans = 0
for i in range(N-2):
  if A[i] == 'A' and A[i+1] == 'B' and A[i+2] == 'C':
    ans += 1
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
A,B,K = list(map(int,input().split()))
for i in range(K):
  if A != 0:
    A -= 1
  elif A == 0 and B != 0:
    B -= 1
print('{} {}'.format(A,B))

Fixed submission:
A,B,K = list(map(int,input().split()))
if K <= A:
  print('{} {}'.format(A-K,B))
if A < K <= A+B:
  print('{} {}'.format(0,A+B-K))
if A+B < K:
  print('{} {}'.format(0,0))
Buggy python submission (verdict: Runtime Error):
N,A,B = map(int,input().split())
if abs(A-B)%2 == 1:
    print(min(A-1,N-B))+1+(B-A-1)//2
else:
    print(abs(A-B)//2)

Fixed submission:
N,A,B = map(int,input().split())
if abs(A-B)%2 == 1:
    print(min(A-1,N-B)+1+(B-A-1)//2)
else:
    print(abs(A-B)//2)
Buggy python submission (verdict: Runtime Error):
list_A= [1,2,3]
a = input()
b = input()
list_A.remove(a)
list_A.remove(b)
print(list_A)

Fixed submission:
list_A= [1,2,3]
a = int(input())
b = int(input())
list_A.remove(a)
list_A.remove(b)
print(list_A[0])
Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
A,B = list(map(int,input().split()))
if A == 1:
  print(B)
  exit()
if B == 1:
  print(A)
  exit()
C = A*B
D = []
for i in range(C,1,-1):
  if A % i == 0 and B % i == 0:
    D.append(i)
    A = A // i
    B = B // i
    C = A*B
if len(D) != 0:
  p = np.prod(D)
  C = C*p
print(C)

Fixed submission:
import math
import numpy as np
A,B = list(map(int,input().split()))
if A == 1:
  print(B)
  exit()
if B == 1:
  print(A)
  exit()
C = A*B
D = []
for i in range(int(math.sqrt(C)),1,-1):
  if A % i == 0 and B % i == 0:
    D.append(i)
    A = A // i
    B = B // i
    C = A*B
if len(D) != 0:
  p = np.prod(D)
  C = C*p
print(C)

Buggy python submission (verdict: Runtime Error):
if B == 1:
  print(A)
  exit()
C = A*B
D = []
for i in range(1,int(math.sqrt(C))):
  if A % i == 0 and B % i == 0:
    A = A // i
    B = B // i
    D.append(i)
    C = A*B
for j in range(1,int(math.sqrt(C))):
  if A % j == 0 and B % j == 0:
    A = A // j
    B = B // j
    D.append(j)
    C = A*B
for k in range(1,int(math.sqrt(C))):
  if A % k == 0 and B % k == 0:
    A = A // k
    B = B // k
    D.append(k)
    C = A*B
p = np.prod(D)
if p != 0:
  C = C*p
print(C)

Fixed submission:
import math
import numpy as np
A,B = list(map(int,input().split()))
if A == 1:
  print(B)
  exit()
if B == 1:
  print(A)
  exit()
C = A*B
D = []
for i in range(int(math.sqrt(C)),1,-1):
  if A % i == 0 and B % i == 0:
    D.append(i)
    A = A // i
    B = B // i
    C = A*B
if len(D) != 0:
  p = np.prod(D)
  C = C*p
print(C)
Buggy python submission (verdict: Runtime Error):
S = list(input())
ans = 0
for i in range(len(S)//2):
 if S[i] = S[len(S)-1-i]:
   continue
 else:
   ans += 1
print(ans)

Fixed submission:
S = list(input())
ans = 0
for i in range(len(S)//2):
 if S[i] == S[len(S)-1-i]:
   continue
 else:
   ans += 1
print(ans)

Buggy python submission (verdict: Runtime Error):
A = list(input())
for i in range(len(A)//2):
  if A[i] != A[len(A)-1-i]:
    ans += 1
print(ans)

Fixed submission:
S = list(input())
ans = 0
for i in range(len(S)//2):
 if S[i] == S[len(S)-1-i]:
   continue
 else:
   ans += 1
print(ans)

Buggy python submission (verdict: Runtime Error):
A = list(input())
for i in range(len(A)//2)
  if A[i] != A[len(A)-1-i]:
    ans += 1
print(ans)
    

Fixed submission:
S = list(input())
ans = 0
for i in range(len(S)//2):
 if S[i] == S[len(S)-1-i]:
   continue
 else:
   ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
l = []
ans = 0
for i in range(N):
    A = int(input())
    for j in range(A):
        l.append(list(map(int,input().split())))
for bit in range(1<<N):
    flag = True
    listH = [(bit>>i)&1 for i in range(N)]
    for i in range(N):
        if not listH[i]:
            continue
        for k in range(2):
            x = l[i][0]-1
            y = l[i][1]
            if listH[x] != y:
                flag = False
    if flag:
        ans = max(ans,sum(listH))
print(ans)

Fixed submission:
N = int(input())
L = []
l = []
A = []
ans = 0
for i in range(N):
    a = int(input())
    A.append(a)
    for j in range(a):
        l.append(list(map(int,input().split())))
    L.append(l)
    l = []
for bit in range(1<<N):
    flag = True
    listH = [(bit>>i)&1 for i in range(N)]
    for j in range(N):
        if not listH[j]:
            continue
        for k in range(A[j]):
            x = L[j][k][0]-1
            y = L[j][k][1]
            if listH[x] != y:
                flag = False
    if flag:
        ans = max(ans,sum(listH))
print(ans)
Buggy python submission (verdict: Runtime Error):
print(int(input()**2))

Fixed submission:
print(int(input())**2)

Buggy python submission (verdict: Runtime Error):
print(int(input()**2))

Fixed submission:
print(int(input())**2)

Buggy python submission (verdict: Runtime Error):
print(int(input()**2))

Fixed submission:
print(int(input())**2)

Buggy python submission (verdict: Runtime Error):
 r = int(input())
 print(r**2)

Fixed submission:
print(int(input())**2)
Buggy python submission (verdict: Time Limit Exceeded):
p = 10 ** 9 + 7
N = 10 ** 7
fact = [1, 1]
factinv = [1, 1]
inv = [0, 1]

for i in range(2, N + 1):
    fact.append((fact[-1] * i) % p)
    inv.append((-inv[p % i] * (p // i)) % p)
    factinv.append((factinv[-1] * inv[-1]) % p)

def cmb(n, r, p):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return fact[n] * factinv[r] * factinv[n-r] % p
X,Y = list(map(int,input().split()))
if (X+Y)%3 != 0:
    print(0)
    exit()
N = (X+Y)//3
K = 2*N-X
print(cmb(N,K,p))

Fixed submission:
def cmb(n, r, mod):
    if ( r<0 or r>n ):
        return 0
    r = min(r, n-r)
    return g1[n] * g2[r] * g2[n-r] % mod

mod = 10**9+7
N = 10**6
g1 = [1, 1]
g2 = [1, 1]
inverse = [0, 1]
for i in range( 2, N + 1 ):
    g1.append( ( g1[-1] * i ) % mod )
    inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
    g2.append( (g2[-1] * inverse[-1]) % mod )

X,Y = list(map(int,input().split()))
if (X+Y)%3 != 0:
    print(0)
    exit()
N = (X+Y)//3
K = min(2*N-X,X-N)
print(cmb(N,K,mod))
Buggy python submission (verdict: Runtime Error):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7

S = s()
N = len(S)
num = 1
num2 = 1
ans = 0
for i in range(N-1):
    if S[i] == S[i+1]:
        ans += num
        num += 1
    if S[i] == '>' and S[i+1] == '<':
        ans += max(num,num2)
        num = 1
        Flag = 0
    if S[i] == '<' and S[i+1] == '>':
        num2 = num
        num = 1
        Flag = 1
if Flag:
    ans += max(num2,num)
else:
    ans += num
print(ans)

Fixed submission:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7

S = s()
N = len(S)
num = 1
num2 = 1
ans = 0
Flag = 0
for i in range(N-1):
    if S[i] == S[i+1]:
        ans += num
        num += 1
    if S[i] == '>' and S[i+1] == '<':
        ans += max(num,num2)
        num = 1
        Flag = 0
    if S[i] == '<' and S[i+1] == '>':
        num2 = num
        num = 1
        Flag = 1
if Flag:
    ans += max(num2,num)
else:
    ans += num
print(ans)
Buggy python submission (verdict: Runtime Error):
A,B = list(map(int,inpput().split()))
if A > 9 or B > 9:
  print('-1')
  exit()
print(A*B)

Fixed submission:
A,B = list(map(int,input().split()))
if A > 9 or B > 9:
  print('-1')
  exit()
print(A*B)
Buggy python submission (verdict: Runtime Error):
import math
from decimal import Decimal
a,b,x = list(map(int,input().split()))
A = a**2
if A*b/2 <= x:
  c = Decimal(x/A)
  d = (b-c)*2
  print(90-(math.degrees(math.atan(Decimal(a/d)))))
else:
  s = Decimal(x/a)
  d = Decimal(s*2/b)
  print(90-(math.degrees(math.atan(Decimal(d/b)))))

Fixed submission:
import math
from decimal import Decimal
a,b,x = list(map(int,input().split()))
A = a**2
if A*b == x:
  print(0)
elif A*b/2 <= x:
  c = Decimal(x/A)
  d = (b-c)*2
  print(90-(math.degrees(math.atan(Decimal(a/d)))))
else:
  s = Decimal(x/a)
  d = Decimal(s*2/b)
  print(90-(math.degrees(math.atan(Decimal(d/b)))))
Buggy python submission (verdict: Runtime Error):
A,B = list(map(int,input().split))
if A-2*B < 0:
  print('0')
else:
  print(A-2*B)

Fixed submission:
A,B = list(map(int,input().split()))
if A-2*B < 0:
  print('0')
else:
  print(A-2*B)

Buggy python submission (verdict: Runtime Error):
A,B = list(map(int,input(.split)))
if A-2*B < 0:
  print('0')
else:
  print(A-2*B)

Fixed submission:
A,B = list(map(int,input().split()))
if A-2*B < 0:
  print('0')
else:
  print(A-2*B)
Buggy python submission (verdict: Runtime Error):
N = int(input())
D = list(map(int,input().split()))
A = []
for i in range(N):
  for j in range(1,N):
    A.append(N[i]*(j-i)
print(sum(A))

Fixed submission:
N = int(input())
D = list(map(int,input().split()))
A = []
for i in range(N-1):
  for j in range(i+1,N):
    A.append(D[i]*D[j])
print(sum(A))
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
L = list(map(int,input().split()))
ans = 0
for i in range(N):
  for j in range(i+1,N):
    for k in range(j+1,N):
      if L[i] < L[j]+L[k] and L[j] < L[i]+L[k] and L[k] < L[i]+L[j]:
        ans += 1
print(ans)

Fixed submission:
from bisect import bisect_left
N = int(input())
L = list(map(int,input().split()))
ans = 0
L.sort()
for i in range(N):
  for j in range(i+1,N):
    sumn = L[i]+L[j]
    num = bisect_left(L,sumn)
    ans += max(0,num-j-1)
print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
ans = [0] * N
for i, a in enumerate(A):
  ans[a-1] = i+1
print(*ans)

Fixed submission:
import decimal
N = int(input())
if N % 2 == 0:
  print('0.5')
else:
  A = decimal.Decimal((N-(N//2))/N)
  print(A)
Buggy python submission (verdict: Runtime Error):
N,K = list(map(int,input().split())
h = list(map(int,input().split()))
ans = 0
for i in range(N):
  if h[i] >= K:
    ans += 1
print(ans)

Fixed submission:
N,K = list(map(int,input().split()))
h = list(map(int,input().split()))
ans = 0
for i in range(N):
  if h[i] >= K:
    ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
ans = [0] * N
for i, a in enumerate(A):
  ans[a-1] = i+1
print(' '.join(ans))

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

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int,input().split()))
B = []
for i in range(1,N+1):
  for j in range(N):
    if i == A[j]:
      B.append(str(j+1))
print(' '.join(B))

Fixed submission:
N = int(input())
A = list(map(int,input().split()))
ans = [0] * N
for i, a in enumerate(A):
  ans[a-1] = i+1
print(*ans)
Buggy python submission (verdict: Runtime Error):
A = ['Sunny','Cloudy',''Rainy']
S = int(input())
print(A[S%3])

Fixed submission:
A = ['Sunny','Cloudy','Rainy']
S = input()
for i in range(3):
  if A[i] == S:
    ans = A[(i+1)%3]
print(ans)
Buggy python submission (verdict: Runtime Error):
S = list(input())
for i in range(:len(S):2):
  if S[i] == 'R':
    print('No')
    exit()
for j in range(1:len(S):2):
  if S[j] == 'L':
    print('NO')
    exit()
print('Yes')

Fixed submission:
S = list(input())
for i in range(0,len(S),2):
  if S[i] == 'L':
    print('No')
    exit()
for j in range(1,len(S),2):
  if S[j] == 'R':
    print('No')
    exit()
print('Yes')