Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
# python3
import numpy as np

def atack_survival(N, K, r_list):
	point_list= np.full(N, K)
	for i in r_list:
		point_list= point_list - 1
		point_list[i-1]= point_list[i-1] + 1


	for i in point_list:
		if i <= 0:
			print ("No")
		else:
			print("Yes")

if __name__ == '__main__':
    l = list(map(int, input().split()))
    N=l[0]
    K=l[1]
    Q=l[2]
    result= [int(input()) for i in range(Q)]
    atack_survival(N,K,result)

Fixed submission:
# python3

def whether_predict(s):
	w_list=["Sunny", "Cloudy", "Rainy"]
	num=w_list.index(s)
	predict_index= (num+1)%3
	return w_list[predict_index]

if __name__ == '__main__':
    input = input()
    print(whether_predict(input))
Buggy python submission (verdict: Runtime Error):
day = input()
 
if(day=="SUN"):
  print(7)
elif(day=="MON"):
  print(6)
elif(day=="TUE"):
  print(5)
elif(day=="WEN"):
  print(4)
elif(day=="THU"):
  print(3)
elif(day=="FRI"):
  print(2)
elif(day=="SAT"):

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

Buggy python submission (verdict: Runtime Error):
day == input()

if(day=="SUN"):
  print(7)
elif(day=="MON"):
  print(6)
elif(day=="TUE"):
  print(5)
elif(day=="WEN"):
  print(4)
elif(day=="THU"):
  print(3)
elif(day=="FRI"):
  print(2)
elif(day=="SAT"):
  print(1)

Fixed submission:
day = input()
     
if(day=="SUN"):
  print(7)
elif(day=="MON"):
  print(6)
elif(day=="TUE"):
  print(5)
elif(day=="WED"):
  print(4)
elif(day=="THU"):
  print(3)
elif(day=="FRI"):
  print(2)
elif(day=="SAT"):
  print(1)
Buggy python submission (verdict: Runtime Error):
num = int(input())
al = input()

newal = ""
alp = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"

for i in range(len(al)):
  if(alp.index(al[i])+num>25):
    newal = newal + alp[(alp.index(al[i])+num)-25]
  else:
    newal = newal + alp[alp.index(al[i])+num]
  
print(newal)

Fixed submission:
num = int(input())
al = input()

newal = ""
alp = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"

for i in range(len(al)):
  if(alp.index(al[i])+num>25):
    newal = newal + alp[(alp.index(al[i])+num)-26]
  else:
    newal = newal + alp[alp.index(al[i])+num]
  
print(newal)

Buggy python submission (verdict: Runtime Error):
num = int(input())
al = input()

newal = ""
alp = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"

for i in range(len(al)):
  newal = newal + alp[i+num]
  
print(newal)

Fixed submission:
num = int(input())
al = input()

newal = ""
alp = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"

for i in range(len(al)):
  if(alp.index(al[i])+num>25):
    newal = newal + alp[(alp.index(al[i])+num)-26]
  else:
    newal = newal + alp[alp.index(al[i])+num]
  
print(newal)
Buggy python submission (verdict: Runtime Error):
n= int(input())
v_list = [int(i) for i in input().split()]
c_list = [int(i) for i in input().split()]

val = 0
for _ in zip(v_list, c_list):
  if(v_list>=c_list):
    val = val + (v_list-c_list)
 
print(val)

Fixed submission:
n= int(input())
v_list = [int(i) for i in input().split()]
c_list = [int(i) for i in input().split()]

val = 0
for v, c in zip(v_list, c_list):
  if(v>=c):
    val = val + (v-c)
   
print(val)

Buggy python submission (verdict: Runtime Error):
n= int(input())
v_list = [int(i) for i in input().split()]
c_list = [int(i) for i in input().split()]

for _ in zip(v_list, c_list):
  if(v_list>=c_list):
    val = val + (v_list-c_list)

print(val)

Fixed submission:
n= int(input())
v_list = [int(i) for i in input().split()]
c_list = [int(i) for i in input().split()]

val = 0
for v, c in zip(v_list, c_list):
  if(v>=c):
    val = val + (v-c)
   
print(val)
Buggy python submission (verdict: Runtime Error):
if(b=="A"):
    print("T")
if(b=="T"):
    print("A")
if(b=="G"):
    print("C")
if(b=="C"):
    print("G")

Fixed submission:
b=input()

if(b=="A"):
    print("T")
if(b=="T"):
    print("A")
if(b=="G"):
    print("C")
if(b=="C"):
    print("G")
Buggy python submission (verdict: Runtime Error):
S=input()
if S=='SUN':
    print(7)
elif S=='MON':
    print(6)
elif S=='TUE':
    print(5)
elif S=='WED':
    print(4)
elif S=='THU':
    print(3)
elif S=='FRI':
    print(2)
elif S=='SAT'
    print(1)


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

Buggy python submission (verdict: Runtime Error):
S=input()
if S=='SUN':
    print(7)
elif S=='MON':
    print(6)
elif S=='TUE':
    print(5)
elif S=='WED':
    print(4)
elif S=='THU':
    print(3)
elif S=='FRI':
    print(2)
elif S=='SAT'
print(1)


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

Buggy python submission (verdict: Runtime Error):
S=input()
if S='SUN':
    print(7)
elif S='MON':
    print(6)
elif S='TUE':
    print(5)
elif S='WED':
    print(4)
elif S='THU':
    print(3)
elif S='FRI':
    print(2)
elif S='SAT'
print(1)


Fixed submission:
S=input()
if S=='SUN':
    print(7)
elif S=='MON':
    print(6)
elif S=='TUE':
    print(5)
elif S=='WED':
    print(4)
elif S=='THU':
    print(3)
elif S=='FRI':
    print(2)
elif S=='SAT':
    print(1)
Buggy python submission (verdict: Runtime Error):
N=int(input())
S=list(input())
A=''
for i in S:
    if ord(i)+N<ord('Z'):
        A+=chr(ord(i)+N)
    else:
        A+=chr(ord(i)+N-ord('z'))
print(A)


Fixed submission:
N=int(input())
S=list(input())
A=''
for i in S:
    if ord(i)+N<=ord('Z'):
        A+=chr(ord(i)+N)
    else:
        A+=chr(ord(i)+N-(ord('Z')-ord('A')+1))
print(A)

Buggy python submission (verdict: Runtime Error):
N=int(input())
S=list(input())
for i in S:
  S[i]=chr(ord(i)+N)
print(S)

Fixed submission:
N=int(input())
S=list(input())
A=''
for i in S:
    if ord(i)+N<=ord('Z'):
        A+=chr(ord(i)+N)
    else:
        A+=chr(ord(i)+N-(ord('Z')-ord('A')+1))
print(A)

Buggy python submission (verdict: Runtime Error):
N=int(input())
S=input().split()
for i in S:
    S[i]=chr(ord(i)+N)
print(S)

Fixed submission:
N=int(input())
S=list(input())
A=''
for i in S:
    if ord(i)+N<=ord('Z'):
        A+=chr(ord(i)+N)
    else:
        A+=chr(ord(i)+N-(ord('Z')-ord('A')+1))
print(A)
Buggy python submission (verdict: Runtime Error):
a,b=map(int(input().split()))
if a<10 and b<10:
    print(a*b)
else:
    print(-1)


Fixed submission:
a,b=map(int,(input().split()))
if a<10 and b<10:
    print(a*b)
else:
    print(-1)

Buggy python submission (verdict: Runtime Error):
a,b=int(input().split())
if a<10 and b<10:
    print(a*b)
else:
    print(-1)


Fixed submission:
a,b=map(int,(input().split()))
if a<10 and b<10:
    print(a*b)
else:
    print(-1)
Buggy python submission (verdict: Runtime Error):
import sqrt from math
N=int(input())
for i in range(int(sqrt(N))+1,-1,-1):
    if N%i==0:
        print(i-1+N//i-1)
        exit()


Fixed submission:
from math import sqrt
N=int(input())
for i in range(int(sqrt(N))+1,-1,-1):
    if N%i==0:
        print(i-1+N//i-1)
        exit()

Buggy python submission (verdict: Runtime Error):
import sqrt from math
N=int(input())
for i in range(int(sqrt)+1,-1,-1):
    if N%i==0:
        print(i-1+N//i-1)
        exit()


Fixed submission:
from math import sqrt
N=int(input())
for i in range(int(sqrt(N))+1,-1,-1):
    if N%i==0:
        print(i-1+N//i-1)
        exit()
Buggy python submission (verdict: Runtime Error):
a,b=int(input().split())
print(max(a-b*2,0))

Fixed submission:
a,b=map(int,input().split())
print(max(a-b*2,0))
Buggy python submission (verdict: Runtime Error):
N=int(input())
d=list(map(int,input().split()))

ans=0
for i in range(N-1):
    for j in range(i+1,N):
        ans+=d[i]*d[j]
print(result)

Fixed submission:
N=int(input())
d=list(map(int,input().split()))
ans=0
for i in range(N-1):
    for j in range(i+1,N):
        ans+=d[i]*d[j]
print(ans)
Buggy python submission (verdict: Runtime Error):
N=int(input())
S=input()

ans=0
p=''
for i in range(N):
    if p != S[i]:
        result += 1
        p=S[i]
print(ans)

Fixed submission:
N=int(input())
S=input()

ans=0
p=''
for i in range(N):
    if p != S[i]:
        ans += 1
        p=S[i]
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
L=list(map(int,input().split()))
ans=0
for i in range(N-2):
    for j in range(i+1,N-1):
        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()))

L.sort()
result=0
for i in range(N-2):
    for j in range(i+1,N-1):
        result+=bisect_left(L,L[i]+L[j])-j-1
print(result)

Buggy python submission (verdict: Runtime Error):
N=int(inpiut())
L=list(map(int,input().split()))
ans=0
for i in range(N-2):
    for j in range(i,N-1):
        for k in range(j,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()))

L.sort()
result=0
for i in range(N-2):
    for j in range(i+1,N-1):
        result+=bisect_left(L,L[i]+L[j])-j-1
print(result)

Buggy python submission (verdict: Runtime Error):
N=int(inpiut())
L=list(map(int,input().split()))
ans=0
for i in range(N-2):
    for j in range(i,N-1):
        for k in range(j,N):
            if d[i]<d[j]+d[k] and d[j]<d[i]+d[k] and d[k]<d[i]+d[j]:
                ans+=1
print(ans)

Fixed submission:
from bisect import bisect_left
N=int(input())
L=list(map(int,input().split()))

L.sort()
result=0
for i in range(N-2):
    for j in range(i+1,N-1):
        result+=bisect_left(L,L[i]+L[j])-j-1
print(result)
Buggy python submission (verdict: Runtime Error):
import numpy as np

N = int(input())
A_i = np.array(list(map(int, input().split())))
stu = [[nums+1,student] for nums, student in enumerate(A_i)]

hh = np.full(N, np.nan)
for i, j in stu:
    hh[j-1] = i
    print(int(hh[j-1]))

Fixed submission:
import numpy as np

N = int(input())

nums_list = np.arange(1,N+1)
odd_list = nums_list[nums_list%2==1]
print(len(odd_list)/len(nums_list))

Buggy python submission (verdict: Runtime Error):
import numpy as np

N = int(input())
A_i = np.array(list(map(int, input().split())))
stu = [[nums+1,student] for nums, student in enumerate(A_i)]

hh = np.full(N, np.nan)
for i, j in stu:
    hh[j-1] = i
    
for i in hh:
  print(i)

Fixed submission:
import numpy as np

N = int(input())

nums_list = np.arange(1,N+1)
odd_list = nums_list[nums_list%2==1]
print(len(odd_list)/len(nums_list))

Buggy python submission (verdict: Runtime Error):
N = int(input())

import numpy as np

nums_list = np.arange(1,N)
odd_list = nums_list[nums_list%2==1]

print(len(odd_list)/len(nums_list))

Fixed submission:
import numpy as np

N = int(input())

nums_list = np.arange(1,N+1)
odd_list = nums_list[nums_list%2==1]
print(len(odd_list)/len(nums_list))
Buggy python submission (verdict: Runtime Error):
import numpy as np
 
N, K = map(int, input().split())
h_i = np.array(map(int, input().split()))

can_ride = h_i[h_i>=K]
print(len(can_ride))

Fixed submission:
import numpy as np
 
N, K = map(int, input().split())
h_i = list(map(int, input().split()))
h_i = np.array(h_i)
can_ride = h_i[h_i>=K]
print(len(can_ride))

Buggy python submission (verdict: Runtime Error):
import numpy as np

N = int(input())
K = int(input())
h_i = list(map(int, input().split()))
h_i = np.array(h_i)

can_ride = h_i[h_i>=K]
print(len(can_ride))

Fixed submission:
import numpy as np
 
N, K = map(int, input().split())
h_i = list(map(int, input().split()))
h_i = np.array(h_i)
can_ride = h_i[h_i>=K]
print(len(can_ride))

Buggy python submission (verdict: Runtime Error):
import numpy as np

N = int(input())
K = int(input())
h_i = np.array(map(int, input().split()))

can_ride = h_i[h_i>=K]
print(len(can_ride))

Fixed submission:
import numpy as np
 
N, K = map(int, input().split())
h_i = list(map(int, input().split()))
h_i = np.array(h_i)
can_ride = h_i[h_i>=K]
print(len(can_ride))

Buggy python submission (verdict: Runtime Error):
import numpy as np

N = int(input())
K = int(input())
h_i = np.arry(input().split()) 

can_ride = h_i[h_i>=K]
print(len(can_ride))

Fixed submission:
import numpy as np
 
N, K = map(int, input().split())
h_i = list(map(int, input().split()))
h_i = np.array(h_i)
can_ride = h_i[h_i>=K]
print(len(can_ride))

Buggy python submission (verdict: Runtime Error):
import numpy as np

N = int(input())
K = int(input())
h_i = map(int,input().spilt())

can_ride = h_i[h_i>=K]
print(len(can_ride))

Fixed submission:
import numpy as np
 
N, K = map(int, input().split())
h_i = list(map(int, input().split()))
h_i = np.array(h_i)
can_ride = h_i[h_i>=K]
print(len(can_ride))
Buggy python submission (verdict: Runtime Error):
D = int(input())
st = 'Chritsmas'
ww = 25-D
print(st+(' Eve'*WW))


Fixed submission:
D = int(input())
st = 'Christmas'
ww = 25-D
ans = st + (' Eve')* ww 
print(ans)
Buggy python submission (verdict: Runtime Error):
A = int(input())
P = int(input())
B = 3*A + P

print(int(B // 2))

Fixed submission:
A,P = map(int,input().split())
print((3*A + P) // 2)

Buggy python submission (verdict: Runtime Error):
A = int(input())
P = int(input())
B = 3*A + P

print(int(B/2))

Fixed submission:
A,P = map(int,input().split())
print((3*A + P) // 2)

Buggy python submission (verdict: Runtime Error):
A = int(input())
P = int(input())
B = 3*A + P

print(int(B/3))

Fixed submission:
A,P = map(int,input().split())
print((3*A + P) // 2)
Buggy python submission (verdict: Runtime Error):

    #文字列を受け取る
    s = input()

    #replaceで文字列を置き換え
    print(s.replace('2017', '2018', 1))
    #置き換え回数も指定できる。今回は必要なさそうだけど


Fixed submission:
s = input()

print(s[0] + str(len(s)-2) + s[-1])

Buggy python submission (verdict: Runtime Error):
def main():
s = input()

print(s[0] + str(len(s)-2) + s[-1])

if __name__ == '__main__':
    main()

Fixed submission:
s = input()

print(s[0] + str(len(s)-2) + s[-1])
Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())
C = int(input())
D = int(input())

if A*B > C*D:
  print(A*B)
elif A*B < C*D:
  print(C*D)
else:
  print(A*B)

Fixed submission:
a,b,c,d=map(int,input().split())
print(max(a*b,c*d))
Buggy python submission (verdict: Runtime Error):
s = input()
print(c.split(,))

Fixed submission:
print(*input().split(","))
Buggy python submission (verdict: Runtime Error):
c = input()
if c == a or e or i or o or u:
  print("vowel")
else:
  print("constant")

Fixed submission:
c=input()

if c=="a" or c=="e" or c=="i" or c=="o" or c=="u":
  print("vowel")
else:
  print("consonant")
Buggy python submission (verdict: Runtime Error):
a,b,h = map(int,input().split())

print(int((a + b) * h / 2))

Fixed submission:
a = int(input())
b = int(input())
h = int(input())

print(int((a + b) * h / 2))

Buggy python submission (verdict: Runtime Error):
a = input(int())
b = input(int())
h = input(int())

print((a + b) * h / 2)

Fixed submission:
a = int(input())
b = int(input())
h = int(input())

print(int((a + b) * h / 2))
Buggy python submission (verdict: Runtime Error):
nums = list(map(int,input().split()))
N = int(nums[0])
K = int(nums[1])
X = int(nums[2])
Y = int(nums[3])

if N > K:
  print(K*X + (N-K)*Y)
else:
  print(N*X)

Fixed submission:
N = int(input())
K = int(input())
X = int(input())
Y = int(input())

if N > K:
  print(K*X + (N-K)*Y)
else:
  print(N*X)
Buggy python submission (verdict: Runtime Error):
N = int(input())
n = 0

for i in range(1,N+1,1)
  n += i
  
print(n)

Fixed submission:
N = int(input())
n = 0

for i in range(1,N+1,1):
  n += i
  
print(n)

Buggy python submission (verdict: Runtime Error):
N = int(input())

while n <= N:
  n += 1
  
print(str(n))

Fixed submission:
N = int(input())
n = 0

for i in range(1,N+1,1):
  n += i
  
print(n)
Buggy python submission (verdict: Runtime Error):
nums = list(map(int,input().split())
nums.sort()
if nums[0] == 5 and nums[1] == 5 and nums[2] == 7:
            print("YES")
else:
            print("NO")

Fixed submission:
nums = list(map(int,input().split()))
nums.sort()
if nums[0] == 5 and nums[1] == 5 and nums[2] == 7:
            print("YES")
else:
            print("NO")

Buggy python submission (verdict: Runtime Error):
nums = list(map(int,input(),split())
nums.sort()
if nums[0] == 5 and nums[1] == 5 and nums[2] == 7:
	print("YES")
else:
	print("NO")

Fixed submission:
nums = list(map(int,input().split()))
nums.sort()
if nums[0] == 5 and nums[1] == 5 and nums[2] == 7:
            print("YES")
else:
            print("NO")

Buggy python submission (verdict: Runtime Error):
nums = list(map(int,input(),split())
nums.sort()
if nums[0] == 5 and nums[1] == 5 and nums[2] == 7:
            print("YES")
else:
            print("NO")

Fixed submission:
nums = list(map(int,input().split()))
nums.sort()
if nums[0] == 5 and nums[1] == 5 and nums[2] == 7:
            print("YES")
else:
            print("NO")
Buggy python submission (verdict: Time Limit Exceeded):
sin = input()
n = int(sin)
sin = input()
arr = list(map(int, sin.split()))

tt = list()
for i in range(n):
    tt.append(i+1)

def bubble_sort(arr, tar):
    change = True
    while change:
        change = False
        for i in range(len(arr) - 1):
            if arr[i] > arr[i + 1]:
                arr[i], arr[i + 1] = arr[i + 1], arr[i]
                tar[i], tar[i + 1] = tar[i + 1], tar[i]
                change = True
    return arr, tar

a, b = bubble_sort(arr, tt)
print(' '.join(map(str, b)))

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

db = list()
for i in range(n):
    db.append([arr[i], i+1])

ll = list()
for a in sorted(db, key=lambda x: x[0]):
    ll.append(a[1])

print(' '.join(map(str, ll)))
Buggy python submission (verdict: Runtime Error):
N = int(input())

print((N*(N-1))//2)

Fixed submission:
ss = input()
tt = input()

c = 0
for s, t in zip(ss, tt):
    if s == t and (s == 'R' or s == 'C' or s == 'S'):
       c += 1

print(c)

Buggy python submission (verdict: Runtime Error):
N = int(input())

print((N*(N-1))//2)

Fixed submission:
ss = input()
tt = input()

c = 0
for s, t in zip(ss, tt):
    if s == t and (s == 'R' or s == 'C' or s == 'S'):
       c += 1

print(c)

Buggy python submission (verdict: Runtime Error):
N = int(input())

print((N*(N-1))/2)

Fixed submission:
ss = input()
tt = input()

c = 0
for s, t in zip(ss, tt):
    if s == t and (s == 'R' or s == 'C' or s == 'S'):
       c += 1

print(c)
Buggy python submission (verdict: Runtime Error):
N = int(input())

print((n*(n-1))/2)

Fixed submission:
N = int(input())
print((N*(N-1))//2)

Buggy python submission (verdict: Runtime Error):
N = int(input())

print(n*(n-1)/2)

Fixed submission:
N = int(input())
print((N*(N-1))//2)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())

c = list()
for n in range(1, N+1):
    c.append(n)

d = c[:]
del d[0]
d.append(1)

cont = 0
for e, f in zip(c, d):
    mod = e % f
    cont += mod


print(cont)

Fixed submission:
N = int(input())
print((N*(N-1))//2)
Buggy python submission (verdict: Runtime Error):
import math
a,b,x = map(float,input().split())
w_theta = math.atan(b / a)
w_p = 0.5 * a * b * math.sin(w_theta) * math.sqrt(a ** 2 + b ** 2)
if x > w_p:
  theta = math.degrees(math.atan((2. * (((a ** 2) * b) - x)) / (a ** 3)))
  else:
    theta = math.degrees(math.atan((a * (b ** 2))/ (2. * x)))
    print(theta)

Fixed submission:
#D
import math
a,b,x = map(float,input().split())
w_theta = math.atan(b / a)
w_p = 0.5 * a * b * math.sin(w_theta) * math.sqrt(a ** 2 + b ** 2)
if x > 0.5*a*a*b:
    theta = math.degrees(math.atan((2. * (((a ** 2) * b) - x)) / (a ** 3)))
else:
    theta = math.degrees(math.atan((a * (b ** 2))/ (2. * x)))
print(theta)

Buggy python submission (verdict: Runtime Error):
    import math
    a,b,x = map(float,input().split())
    w_theta = math.atan(b / a)
    w_p = 0.5 * a * b * math.sin(w_theta) * math.sqrt(a ** 2 + b ** 2)
    if x >= w_p:
        theta = math.degrees(math.atan((2. * (((a ** 2) * b) - x)) / (a ** 3)))
    else:
        theta = math.degrees(math.atan((a * (b ** 2))/ (2. * x)))
    print(theta)

Fixed submission:
#D
import math
a,b,x = map(float,input().split())
w_theta = math.atan(b / a)
w_p = 0.5 * a * b * math.sin(w_theta) * math.sqrt(a ** 2 + b ** 2)
if x > 0.5*a*a*b:
    theta = math.degrees(math.atan((2. * (((a ** 2) * b) - x)) / (a ** 3)))
else:
    theta = math.degrees(math.atan((a * (b ** 2))/ (2. * x)))
print(theta)
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = input()

import re


def nchars(s, n):
    """文字列 s に、同じ文字が n 個以上連続している部分文字列を見つける
    """
    assert n > 0
    reg = re.compile("(.)\\1{%d,}" % (n - 1))  # カンマを取ると n 個ちょうどになる
    while True:
        m = reg.search(s)
        if not m:
            break
        yield m.group(0)
        s = s[m.end():]
        
d = nchars(s, 2)
for d_ in d:
    n -= len(d_) - 1
print(n)n = int(input())
s = input()

import re


def nchars(s, n):
    """文字列 s に、同じ文字が n 個以上連続している部分文字列を見つける
    """
    assert n > 0
    reg = re.compile("(.)\\1{%d,}" % (n - 1))  # カンマを取ると n 個ちょうどになる
    while True:
        m = reg.search(s)
        if not m:
            break
        yield m.group(0)
        s = s[m.end():]
        
d = nchars(s, 2)
for d_ in d:
    n -= len(d_) - 1
print(n)

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

import re


def nchars(s, n):
    """文字列 s に、同じ文字が n 個以上連続している部分文字列を見つける
    """
    assert n > 0
    reg = re.compile("(.)\\1{%d,}" % (n - 1))  # カンマを取ると n 個ちょうどになる
    while True:
        m = reg.search(s)
        if not m:
            break
        yield m.group(0)
        s = s[m.end():]
        
d = nchars(s, 2)
for d_ in d:
    n -= len(d_) - 1
print(n)