Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
#D
from collections import Counter
from copy import deepcopy
n = int(input())
a = list(map(int, input().split()))
def x(i):
    if i < 0:
        return 0
    if i == 1:
        return 1
    else:
        return x(i - 1) + i

for j in range(n):
    b=deepcopy(a)
    b.pop(j)
    # print(a,b)
    ans = 0
    # print(b)
    for i in range(1, max(b) + 1):
        # print(b[i])
        ans += x(b.count(i)-1)
    print(ans)

Fixed submission:
#D AC
from collections import Counter
n = int(input())
a = list(map(int, input().split()))
c = Counter(a)#出現回数を辞書で取り出す
val=0
for i in c.values():#辞書に含まれる値をすべて取り出す
    # print(i)  #1,2,3･･･の回数
    val += i * (i - 1) // 2  #整数が同じボールを選ぶ組み合わせ
    # val+=sum(range(i-1))
for i in range(n):
    b = c[a[i]]  #i番目の出現回数
    print(val - b + 1)  #bを除いたボールから整数が同じボールを選ぶ組み合わせ

Buggy python submission (verdict: Runtime Error):
#D
from collections import Counter
from copy import deepcopy
n = int(input())
a = list(map(int, input().split()))
def x(i):
    if i < 0:
        return 0
    if i == 1:
        return 1
    else:
        return x(i - 1) + i

for j in range(n):
    b=deepcopy(a)
    b.pop(j)
    # print(a,b)
    b = Counter(b)
    ans = 0
    # print(b)
    for i in range(1, max(b) + 1):
        # print(b[i])
        ans += x(b[i]-1)
    print(ans)

Fixed submission:
#D AC
from collections import Counter
n = int(input())
a = list(map(int, input().split()))
c = Counter(a)#出現回数を辞書で取り出す
val=0
for i in c.values():#辞書に含まれる値をすべて取り出す
    # print(i)  #1,2,3･･･の回数
    val += i * (i - 1) // 2  #整数が同じボールを選ぶ組み合わせ
    # val+=sum(range(i-1))
for i in range(n):
    b = c[a[i]]  #i番目の出現回数
    print(val - b + 1)  #bを除いたボールから整数が同じボールを選ぶ組み合わせ
Buggy python submission (verdict: Runtime Error):
import sys
a,b=map(int,input().split())
f=True
for i in range(1,1010):#max_a=1
    if int(i*0.08)==a and int(i*0.1)==b:
        ans=i
        f=False
        break
if f:
  print(-1)
else:
  print(ans)


Fixed submission:
a=list(input())
if a[0]==a[1]==a[2]:
  print("No")
else:
  print("Yes")

Buggy python submission (verdict: Runtime Error):
import sys
a,b=map(int,input().split())
for i in range(1,1100):#max_a=1
    if int(i*0.08)==a and int(i*0.1)==b:
        ans=i
        break
    if i==1099:
        ans=-1

print(ans)


Fixed submission:
a=list(input())
if a[0]==a[1]==a[2]:
  print("No")
else:
  print("Yes")
Buggy python submission (verdict: Runtime Error):
import sys
a,b=map(int,input().split())
for i in range(1,1100):#max_a=1
    if int(i*0.08)==a and int(i*0.1)==b:
        ans=i
        bresak
    if i==1099:
        ans=-1

print(ans)

Fixed submission:
import sys
a,b=map(int,input().split())
f=True
for i in range(1,1010):#max_a=1
    if int(i*0.08)==a and int(i*0.1)==b:
        ans=i
        f=False
        break
if f:
  print(-1)
else:
  print(ans)

Buggy python submission (verdict: Runtime Error):
#C
import sys

a,b=map(int,input().split())
for i in range(1,1000):
    if int(i*0.08)==a and int(i*0.1)==b:
        print(i,i*0.08,i*0.1)
        break
    if i==999:
        print(-1)
        sys.exit()

print(ans)


Fixed submission:
import sys
a,b=map(int,input().split())
f=True
for i in range(1,1010):#max_a=1
    if int(i*0.08)==a and int(i*0.1)==b:
        ans=i
        f=False
        break
if f:
  print(-1)
else:
  print(ans)
Buggy python submission (verdict: Runtime Error):
#A
n, r = map(int, input().split())
if n >= 10:
    print(r)
else:
    print(r-100*(10-k))

Fixed submission:
n,r=map(int,input().split())
if n>10:
  print(r)
else:
  print(r+(-n*100+1000))
Buggy python submission (verdict: Time Limit Exceeded):
#D
n, a, b = map(int, input().split())
mod = pow(10, 9) + 7


def comb(n, x):
    numerator = 1
    for i in range(n, n - x, -1):
        numerator = numerator * i % mod

    denominator = 1
    for j in range(x, 1, -1):
        denominator = denominator * j % mod

    d = denominator ** mod - 2 % mod

    return numerator * d

# #pow
# # def pow(x, n, mod=10e9+7):
# #     ans = 1
# #     while (n > 0):
# #         if bin(n & 1) == bin(1):
# #             ans *= x
# #         x *= x
# #         n = n >> 1
# #     return ans

a = comb(n, a)
b = comb(n, b)

print((2**n %mod - 1 - a - b) % mod)


Fixed submission:
#D
n, a, b = map(int, input().split())
mod = pow(10, 9) + 7

def comb(n, x):
    numerator = 1
    for i in range(n, n - x, -1):
        numerator = numerator * i % mod

    denominator = 1
    for j in range(x, 1, -1):
        denominator = denominator * j % mod

    d = pow(denominator, mod-2, mod)

    return numerator * d

a = comb(n, a)
b = comb(n, b)

print((pow(2, n, mod) - 1 - a - b) % mod)
Buggy python submission (verdict: Runtime Error):
n,k=map(int,input().split())
a=list(map(int,input().split()))
b=[]
smax=0
for i in range(k-1,n):
    if i==k-1:
        sumnow=sum(a[:i+1])
    else:
        sumnow+=a[i]-a[i-k]
    smax=max(smax,sumnow)
print((smax+k)/2)

Fixed submission:
import numpy as np

s,t=input().split()
a,b=map(int,input().split())
u=input()
if s==u:
    a-=1
else:
    b-=1
print(a,b)

Buggy python submission (verdict: Runtime Error):
def wa(n):
    if n<=1:
        return 1
    else:
        return wa(n-1)+n

n,k=map(int,input().split())
a=list(map(int,input().split()))
b=[]
for i in a:
    b.append((i+1)/2)
max=0
for i in range(len(b)-k+1):
    sum=0
    for j in range(i,i+k):
        sum+=b[j]
    if max<=sum:
        max=sum
print(max)

Fixed submission:
import numpy as np

s,t=input().split()
a,b=map(int,input().split())
u=input()
if s==u:
    a-=1
else:
    b-=1
print(a,b)
Buggy python submission (verdict: Runtime Error):
n,k=map(int,input().split())
a=list(map(int,input().split()))
b=[]
for i in range(len(a)):
    b.append((a[i]+1)/2)
for i in range(len(a)-k+1):
    sum=0
    for j in range(i,i+k):
        sum+=b[j]
    if max<=sum:
        max=sum
print(max)

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
a.sort()
ans='YES'
for i in range(1,len(a)):
    if a[i-1]==a[i]:
        ans="NO"
        break

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n,k=map(int,input().split())
a=list(map(int,input().split()))
b=[]
for i in range(len(a)):
    b.append((a[i]+1)/2)
max=0
for i in range(len(a)-k+1):
    sum=0
    for j in range(i,i+k):
        sum+=b[j]
    if max<=sum:
        max=sum
print(max)

Fixed submission:
n,k=map(int,input().split())
a=list(map(int,input().split()))
b=[]
smax=0
for i in range(k-1,n):
    if i==k-1:
        sumnow=sum(a[:i+1])
    else:
        sumnow+=a[i]-a[i-k]
    smax=max(smax,sumnow)
print((smax+k)/2)

Buggy python submission (verdict: Runtime Error):
n,k=map(int,input().split())
a=list(map(int,input().split()))
b=[]
for i in range(len(a)):
    b.append((a[i]+1)/2)
for i in range(len(a)-k+1):
    sum=0
    for j in range(i,i+k):
        sum+=b[j]
    if max<=sum:
        max=sum
print(max)

Fixed submission:
n,k=map(int,input().split())
a=list(map(int,input().split()))
b=[]
smax=0
for i in range(k-1,n):
    if i==k-1:
        sumnow=sum(a[:i+1])
    else:
        sumnow+=a[i]-a[i-k]
    smax=max(smax,sumnow)
print((smax+k)/2)

Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np

def wa(n):
    if n<=1:
        return 1
    else:
        return wa(n-1)+n

if __name__ == "__main__":
    n,k=map(int,input().split())
    a=list(map(int,input().split()))
    b=[]
    for i in a:
        b.append((i+1)/2)
    max=0
    for i in range(len(b)-k+1):
        sum=0
        for j in range(i,i+k):
            sum+=b[j]
        if max<=sum:
            max=sum
    print(max)

Fixed submission:
n,k=map(int,input().split())
a=list(map(int,input().split()))
b=[]
smax=0
for i in range(k-1,n):
    if i==k-1:
        sumnow=sum(a[:i+1])
    else:
        sumnow+=a[i]-a[i-k]
    smax=max(smax,sumnow)
print((smax+k)/2)

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

def wa (n):
    if n<=1:
        return 1
    else:
        return wa(n-1)+n

if __name__ == "__main__":
    n,k=map(int,input().split())
    a=list(map(int,input().split()))
    b=[]
    for i in a:
        b.append(wa(i)/i)
    b.sort(reverse=True)
    print(a,b)
    ans=0
    for i in range(3):

        ans+=b[i]
    print(ans)


Fixed submission:
n,k=map(int,input().split())
a=list(map(int,input().split()))
b=[]
smax=0
for i in range(k-1,n):
    if i==k-1:
        sumnow=sum(a[:i+1])
    else:
        sumnow+=a[i]-a[i-k]
    smax=max(smax,sumnow)
print((smax+k)/2)
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
m=a[0]
ans=1
for i,z in enumerate(a):
  if i==0:continue
  if z<=m:
    ans+=1
  m=min(m,z)
print(ans)


Fixed submission:
n,m=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_a=0
ans=0
for i,z in enumerate:
  if i==0:continue
  if min_a>=z:
    ans+=1
  min_a=min(min_a,z)
print(ans)


Fixed submission:
n=int(input())
a=list(map(int,input().split()))
m=a[0]
ans=1
for i,z in enumerate(a):
  if i==0:continue
  if z<=m:
    ans+=1
  m=min(m,z)
print(ans)

Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
min=0
ans=0
for i z in enumerate:
  if i==0:continue
  if min>=z:
    ans+=1
  min=min(min,z)
print(ans)

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
m=a[0]
ans=1
for i,z in enumerate(a):
  if i==0:continue
  if z<=m:
    ans+=1
  m=min(m,z)
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a=list(map(int,input().split()))
ans=0
for i in range(1,n+1):
  for j in range(1,i+1):
    if a[j-1]<a[i-1]:
      break
    if j==i:
      ans+=1
print(ans)

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
m=a[0]
ans=1
for i,z in enumerate(a):
  if i==0:continue
  if z<=m:
    ans+=1
  m=min(m,z)
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a=list(map(int,input().split()))
ans=0
for i in range(1,n+1):
  for j in range(1,i+1):
    if a[j-1]<a[i-1]:
      break
    if j==i:
      ans+=1
print(ans)

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
m=a[0]
ans=1
for i,z in enumerate(a):
  if i==0:continue
  if z<=m:
    ans+=1
  m=min(m,z)
print(ans)
Buggy python submission (verdict: Runtime Error):
#D
from collections import deque
h,w=map(int,input().split())
s=[]

for i in range(h):
    s.append(list(input()))
dx=[1,0,-1,0]#東南西北
dy=[0,-1,0,1]
ans=0
def search(i,j):
    if s[i][j]=="#":
        return 0
    max_step=0
    que=deque()
    que.append([i,j])#1現在地
    dist=[[-1 for _ in range(w)] for _ in range (h)]
    #(h,w)
    dist[i][j]=0#現在地は0
    while que:#行き先が無くなるまで
        y,x=que.popleft()#現在地を取り出す(y,x)
        for dir in range(4):
            nx=x+dx[dir]#行き先(nx,xy)
            ny=y+dy[dir]
            if ny<0 or ny>=h or nx<0 or nx>=w or s[ny][nx]=="#":#壁の中
            elif dist[ny][nx]!=-1:#捜索済み
            #未捜索地点"."
            else:
                dist[ny][nx]=dist[y][x]+1#1進む
                que.append([ny,nx])
    out=0
    for i in range(h):
        for j in range(w):
            if dist[i][j]==-1:
                break
            out=max(out,dist[i][j])
    return out

for i in range(h):
    for j in range(w):
        step=search(i,j)#(j,i)の時の最大移動数を求める
        if ans<step:
            ans=step
print(ans)

Fixed submission:
#D
from collections import deque
h,w=map(int,input().split())
s=[]

for i in range(h):
    s.append(list(input()))
dx=[1,0,-1,0]#東南西北
dy=[0,-1,0,1]
ans=0
def search(i,j):
    if s[i][j]=="#":
        return 0
    max_step=0
    que=deque()
    que.append([i,j])#1現在地
    dist=[[-1 for _ in range(w)] for _ in range (h)]
    #(h,w)
    dist[i][j]=0#現在地は0
    while que:#行き先が無くなるまで
        y,x=que.popleft()#現在地を取り出す(y,x)
        for dir in range(4):
            nx=x+dx[dir]#行き先(nx,xy)
            ny=y+dy[dir]
            if ny<0 or ny>=h or nx<0 or nx>=w or s[ny][nx]=="#":#壁の中
                pass#何もしない
            elif dist[ny][nx]!=-1:#捜索済み
                pass
            elif s[ny][nx]==".":
            #未捜索地点"."
                dist[ny][nx]=dist[y][x]+1#1進む
                que.append([ny,nx])
    out=0
    for i in range(h):
        for j in range(w):
            if dist[i][j]==-1:
                pass
            out=max(out,dist[i][j])
    return out

for i in range(h):
    for j in range(w):
        step=search(i,j)#(j,i)の時の最大移動数を求める
        if ans<step:
            ans=step
print(ans)
Buggy python submission (verdict: Runtime Error):
a,b,k=map(int,input().split())
if a>=k:
  a1=a-k
  print(a1,b)
else:
  a1=0
  if b>=k-a:
    b1=b-(k-a)
  else:
    b1=0
  print(a1,b1)


Fixed submission:
s,t=input().split()
print(t+s)
Buggy python submission (verdict: Runtime Error):
a,b,k=map(int,input().split())
if a>=k:
  a1=a-k
  print(a1,b)
else:
  a1=0
  if b>=k-a:
    b1=b-(k-a)
    else:
      b1=0
    print(a1,b1)

Fixed submission:
a,b,k=map(int,input().split())
if a>=k:
  a1=a-k
  print(a1,b)
else:
  a1=0
  if b>=k-a:
    b1=b-(k-a)
  else:
    b1=0
  print(a1,b1)

Buggy python submission (verdict: Runtime Error):
a,b,k=map(int,input().split())
if a>=k:
  a1=a-k
  print(a1,b)
  exit
else:
  a1=0
  if b>=k-a:
    b1=b-(k-a)
    else:
      b1=0
    print(a1,b1)

Fixed submission:
a,b,k=map(int,input().split())
if a>=k:
  a1=a-k
  print(a1,b)
else:
  a1=0
  if b>=k-a:
    b1=b-(k-a)
  else:
    b1=0
  print(a1,b1)
Buggy python submission (verdict: Runtime Error):
#D
n, k = map(int(), input().split())
r, s, p = map(int(), input().split())
t = list(input())
# g=r点 t=s点 p=p点
ans = 0
for i in range(n):
    if t[i] == "r":
        if i >= k and t[i - k] == "r":
            t[i] = 'm'#iの手以外の手
        else:
            ans += p
    if t[i] == "t":
        if i >= k and t[i - k] == "t":
            t[i] = 'm'
        else:
            ans += r
    if t[i] == "p":
        if i >= k and t[i - k] == "p":
            t[i] = 'm'
        else:
            ans += s
print(ans)

Fixed submission:
#D
n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = list(input())

# r=r点 s=s点 p=p点
ans = 0
for i in range(n):
    if t[i] == "r":
        if i >= k and t[i - k] == "r":
            t[i] = 'm'#iの手以外の手
        else:
            ans += p
    if t[i] == "s":
        if i >= k and t[i - k] == "s":
            t[i] = 'm'
        else:
            ans += r
    if t[i] == "p":
        if i >= k and t[i - k] == "p":
            t[i] = 'm'
        else:
            ans += s
print(ans)
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
def gcd(a,b):
  while b!=0:
    a,b=b,a%b
	return a
print(a*b//gcd(a,b))

Fixed submission:
a,b=map(int,input().split())
def gcd(a,b):
  while b!=0:
    a,b=b,a%b
  return a
print(a*b//gcd(a,b))
Buggy python submission (verdict: Runtime Error):
n=int(input())
ans=0
for i in range(18):
  ans+=int(n/(10**(i+1))*(i+1)
print(ans)


Fixed submission:
#E
import math
n = int(input())
ans = 0
i = 1
if n % 2 == 0:
    tmp = 5 ** i * 2
    while tmp <= n:
        tmp = 5 ** i * 2
        ans += n //tmp
        i += 1
    print(ans)
else:
    print(0)
Buggy python submission (verdict: Runtime Error):
#B(別解)
n=int(input())
x=math.ceil(n/1.08)
if math.floor(x*1.08)==n:
    print(x)
else:
    print(":(")

Fixed submission:
#B(別解)
import math
n=int(input())
x=math.ceil(n/1.08)
if math.floor(x*1.08)==n:
    print(x)
else:
    print(":(")
Buggy python submission (verdict: Runtime Error):
a=int(input())
s=list(input())
t=[len(s)]
list=[chr(i) for i in range(65, 65+26)]
for i in s:
  t.append(list.index(i))
u=[i+a for i in t]
u=[i-26 if i>=26 else i for i in u]
b=[]
for i in u :
  b.append(list[i])
k=""
for s in b:
  k+=s
print(k)

Fixed submission:
a=int(input())
s=list(input())
t=[]
list=[chr(i) for i in range(65, 65+26)]
for i in s:
  t.append(list.index(i))
u=[i+a for i in t]
u=[i-26 if i>=26 else i for i in u]
b=[]
for i in u :
  b.append(list[i])
k=""
for s in b:
  k+=s
print(k)

Buggy python submission (verdict: Runtime Error):
a=int(input())
s=list(input())
t=[len(s)]
list=[chr(i) for i in range(65, 65+26)]
for i in s:
  t.append(list.index(i))
u=[i+a for i in t]
u=[i-26 if i>26 else i for i in u]
b=[]
for i in u :
  b.append(list[i])
k=""
for s in b:
  k+=s
print(k)

Fixed submission:
a=int(input())
s=list(input())
t=[]
list=[chr(i) for i in range(65, 65+26)]
for i in s:
  t.append(list.index(i))
u=[i+a for i in t]
u=[i-26 if i>=26 else i for i in u]
b=[]
for i in u :
  b.append(list[i])
k=""
for s in b:
  k+=s
print(k)
Buggy python submission (verdict: Runtime Error):
import math
def C(n,r,mod):
  #a=math.factorial(n)/(math.factorial(r)*math.factorial(n-r))
  print(n,r)
  r=min(r,n-r)
  numer=1
  for i in range(n,n-r,-1):
    numer*=i
  denom=1
  for i in range(r,1,-1):
    denom*=i
  a=int(numer/denom)
  return int(a%mod)

x,y=map(int,input().split())
mod=1e9+7

if (x+y)%3!=0:
  print(0)
  exit()
n=int((2*x-y)/3)
m=int((2*y-x)/3)
if n<0 and m<0:
  print(0)
  exit()
print(C(n+m,n,mod))


Fixed submission:
a=int(input())
a=a*a
print(a)

Buggy python submission (verdict: Runtime Error):
import numpy as np
import math
n=int(input())
li=[]
a=[]
b=[]
s=0
while True:
    try:
        li.append(list(map(int,input().split())))
    except:
        break;
for x in li:
  a.append(x[0])
  b.append(x[1])

for i in range(0,n):
  for j in range(i,n):
  	s+=np.sqrt(((a[j]-a[i])**2)+((b[j]-b[i])**2))

p=math.factorial(n)
print(s)

Fixed submission:
a=int(input())
a=a*a
print(a)

Buggy python submission (verdict: Runtime Error):
n=int(input())
li=list(input())
if n%2==0:
  t=int(n/2)
  a=li[:t]
  t=-t
  b=li[t:]
  if a==b:
    print('Yes')
  else:
    print('No')
else:
  print('No')

Fixed submission:
a=int(input())
a=a*a
print(a)
Buggy python submission (verdict: Runtime Error):
n=int(input())
li=list(input())
t=n/2
if t%1:
  a=li[:t]
  b=li[:-t]
  for (i,j) in zip(a,b):
    if i==j:
    else:
      print('No')
      break
    print('Yes')
else:
  print('No')

Fixed submission:
n=int(input())
li=list(input())
if n%2==0:
  t=int(n/2)
  a=li[:t]
  b=li[-t:]
  if a==b:
    print('Yes')
  else:
    print('No')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
n=int(input())
listx=list(map(int,input().split()))
listx.sort()
x=1
if listx[0]!=0:
  x=0
else:
  for i in range(listx[-1]):
    x*=listx.count(int(i+1))+1
print(x)

Fixed submission:
n=int(input())
if n%2==0:
  print(int(n/2-1))
else:
  print(int((n-1)/2))

Buggy python submission (verdict: Runtime Error):
n=int(input())
listx=list(map(int,input().split()))
listx.sort()
x=1
if listx[0]!=0:
  x=0
else:
  for i in range(listx[-1]):
    print(i+1)
    x*=listx.count(int(i+1))+1
print(x)

Fixed submission:
n=int(input())
if n%2==0:
  print(int(n/2-1))
else:
  print(int((n-1)/2))

Buggy python submission (verdict: Runtime Error):
n=int(input())
listx=list(map(int,input().split()))
listx.sort()
x=1
for i in range(listx[-1]):
  x*=listx.count(int(i+1))+1
if listx[0]!=0:
  x=0
print(x)

Fixed submission:
n=int(input())
if n%2==0:
  print(int(n/2-1))
else:
  print(int((n-1)/2))
Buggy python submission (verdict: Runtime Error):
a,b=int(input().split())
if a<=9 and b<=9:
  print(a*b)
else:
  print(-1)


Fixed submission:
a,b=map(int,input().split())
if a<=9 and b<=9:
  print(a*b)
else:
  print(-1)
Buggy python submission (verdict: Runtime Error):
n=int(input())
for i in range(1,9):
  for j in range(9):
    if i*j==n:
      a+=1
if a>0:
  print("Yes")
else:
  print("No")

Fixed submission:
n=int(input())
a=0
for i in range(1,10):
  for j in range(1,10):
    if i*j==n:
      a+=1
if a>0:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
#D
import math
a,b,x=map(int,input().split())
cap=a**2*b
ans=0
if x>cap/2:
    n=2*x/(a*b)
    ans=math.atam(b/n)*180/math.pi
else:
    n=2*x/(a**2)
    ans=math.atan(n/a)*180/math.pi
print(ans)

Fixed submission:
#D
import math
a,b,x=map(int,input().split())
cap=a**2*b
ans=0
if x<=cap/2:
    n=2*x/(a*b)
    ans=math.atan(b/n)*180/math.pi
else:
    n=2*(cap-x)/(a**2)
    ans=math.atan(n/a)*180/math.pi
print(ans)
Buggy python submission (verdict: Runtime Error):
A,B=map(int,input().split())
if (A<2*B):
    print(0)
    break
print(A-2*B)

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

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

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

Fixed submission:
n=int(input())
d=list(input())
ans=1
for i in range(1,n):
    if d[i-1]!=d[i]:
        ans+=1
print(ans)
Buggy python submission (verdict: Runtime Error):
from bisect import bisect_left
n=int(input())
l=sorted(list(map(int,input().split())))
ans=0
for i in range(n):
    for j in range(i+1,n):
        r =bisect_left(L,L[i]+L[j])
        ans+=max(r-j-1),0
print(ans)

Fixed submission:
from bisect import bisect_left
n=int(input())
l=sorted(list(map(int,input().split())))
ans=0
for i in range(n):
    for j in range(i+1,n):
        r =bisect_left(l,l[i]+l[j])
        ans+=max((r-j-1),0)
print(ans)
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
b=[0]*n
for i in range(n):
  b[a[i]-1]=i+1
print(" ",join(map(str,b)))


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

Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
b=[0]*n
for i in range(n):
  b[a[i]-1]=i+1
print(" ",join(map(str,b)))

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

Buggy python submission (verdict: Runtime Error):
n,k=map(int,input().split())
h=list(map(int,input().split()))
count=0
for i in h:
    if k<=i:
        count+=1
print(count)

Fixed submission:
n=int(input())
if n%2==0:
    print(1/2)
else:
    print((int(n/2)+1)/n)
Buggy python submission (verdict: Time Limit Exceeded):
#C
n = int(input())
a = list(map(int, input().split()))
ans = [0] * n
for people in range(n):
    for j in range(n):
        if a[j] == people+1:
            ans[people] = j + 1
print(*ans)

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
b=[0]*n
for i in range(n):
    b[a[i]-1]=i+1
print(*b)
Buggy python submission (verdict: Runtime Error):
S=input()
Wether=[Sunny,Cloudy,Rainy]
if S==Wether[0]:
    print(Wether[1])
elif S==Wether[1]:
    print(Wether[2])
elif S==Wether[2]:
    print(Wether[0])

Fixed submission:
S=input()
Wether=["Sunny","Cloudy","Rainy"]
if S==Wether[0]:
    print(Wether[1])
elif S==Wether[1]:
    print(Wether[2])
elif S==Wether[2]:
    print(Wether[0])
Buggy python submission (verdict: Runtime Error):
n,k,q=map(int,input().split())
a=[]
while True:
  try:
    a.append(int(input()))
  except:
    break;
print(a)
t=[]*n
for i in a:
  t[i-1]+=1
for i in t:
  if i>=q-k+1:
    print("Yes")
  else:
    print("No")

Fixed submission:
n,k,q=map(int,input().split())
a=[]
while True:
  try:
    a.append(int(input()))
  except:
    break;
t=[0]*n
for i in a:
  t[i-1]+=1
for i in t:
  if i >= q - k + 1:
    print("Yes")
  else:
    print("No")