Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
import sys
import math
input = sys.stdin.readline


def main():
    A, B = map(int, input().split())
    assert A <= 100
    assert B <= 100
    for i in range(1000):
        if math.floor((i+1) * 0.08) == A and math.floor((i+1) * 0.1) == B:
            print(i+1)
            exit()
    print("-1")


if __name__ == '__main__':
    main()


Fixed submission:
import sys
input = sys.stdin.readline


def main():
    S = input().strip()
    print("No") if S == "AAA" or S == "BBB" else print("Yes")


if __name__ == '__main__':
    main()

Buggy python submission (verdict: Runtime Error):
import sys
import math
input = sys.stdin.readline


def main():
    A, B = map(int, input().split())
    for i in range(10000):
        if math.floor((i+1) * 0.08) == A and math.floor((i+1) * 0.1) == B:
            print(i+1)
            exit()
    print("-1")


if __name__ == '__main__':
    main()


Fixed submission:
import sys
input = sys.stdin.readline


def main():
    S = input().strip()
    print("No") if S == "AAA" or S == "BBB" else print("Yes")


if __name__ == '__main__':
    main()

Buggy python submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline


def main():
    S = input().strip()
    print("No") if S == "AAA" or S == "BBB" else print("Yes")


if __name__ == '__main__':
    main()


Fixed submission:
import sys
input = sys.stdin.readline


def main():
    S = input().strip()
    print("No") if S == "AAA" or S == "BBB" else print("Yes")


if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
import sys
import math
input = sys.stdin.readline


def main():
    A, B = map(int, input().split())
    for i in range(10000):
        if math.floor((i+1) * 0.08) == A and math.floor((i+1) * 0.1) == B:
            print(i+1)
            exit(-1)
    print("-1")


if __name__ == '__main__':
    main()


Fixed submission:
import sys
import math
input = sys.stdin.readline


def main():
    A, B = map(int, input().split())
    for i in range(1000):
        if math.floor((i+1) * 0.08) == A and math.floor((i+1) * 0.1) == B:
            print(i+1)
            exit()
    print("-1")


if __name__ == '__main__':
    main()
Buggy python submission (verdict: Time Limit Exceeded):
import sys
input = sys.stdin.readline


def main():
    S = input().strip()
    Q = int(input())
    # Query = [list(input().split()) for _ in range(Q)]
    reverse = 1
    for _ in range(0, Q):
        T = list(input().split())
        if T[0] == "1":
            if reverse == 1:
                reverse = 2
            else:
                reverse = 1
        elif T[0] == "2":
            if int(T[1]) == reverse:
                S = T[2] + S
            else:
                S = S + T[2]
    print(S) if reverse == 1 else print(S[::-1])


if __name__ == '__main__':
    main()


Fixed submission:
import sys
input = sys.stdin.readline


def main():
    S = input().strip()
    Q = int(input())
    Query = [list(input().split()) for _ in range(Q)]
    reverse = 1
    head = ""
    tail = ""
    for T in Query:
        if T[0] == "1":
            if reverse == 1:
                reverse = 2
            else:
                reverse = 1
        elif T[0] == "2":
            if int(T[1]) == reverse:
                head = T[2] + head
            else:
                tail = tail + T[2]
    S = head + S + tail
    print(S) if reverse == 1 else print(S[::-1])


if __name__ == '__main__':
    main()

Buggy python submission (verdict: Time Limit Exceeded):
import sys
input = sys.stdin.readline


def main():
    S = input().strip()
    Q = int(input())
    Query = [list(input().split()) for _ in range(Q)]
    reverse = 1
    for T in Query:
        if T[0] == "1":
            if reverse == 1:
                reverse = 2
            else:
                reverse = 1
        elif T[0] == "2":
            if int(T[1]) == reverse:
                S = T[2] + S
            else:
                S = S + T[2]
    print(S) if reverse == 1 else print(S[::-1])


if __name__ == '__main__':
    main()


Fixed submission:
import sys
input = sys.stdin.readline


def main():
    S = input().strip()
    Q = int(input())
    Query = [list(input().split()) for _ in range(Q)]
    reverse = 1
    head = ""
    tail = ""
    for T in Query:
        if T[0] == "1":
            if reverse == 1:
                reverse = 2
            else:
                reverse = 1
        elif T[0] == "2":
            if int(T[1]) == reverse:
                head = T[2] + head
            else:
                tail = tail + T[2]
    S = head + S + tail
    print(S) if reverse == 1 else print(S[::-1])


if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline


def main():
    A = [list(map(int, input().split()))for _ in range(3)]
    N = int(input())
    B = [int(input()) for _ in range(N)]
    for bn in B:
        for i in range(len(A)):
            for j in range(len(A[i])):
                if bn == A[i][j]:
                    A[i][j] = 0
    for m in range(len(A)):
        if all(A[m][n] == 0 for n in range(len(A))):
            print("Yes")
            exit()
        if all(A[n][m] == 0 for n in range(len(A))):
            print("Yes")
            exit()
        if all(A[n][n] == 0 for n in range(len(A))):
            print("Yes")
            exit()
        if all(A[n][len(A)-n-1] == 0 for n in range(len(A))):
            print("Yes")
            exit()
    print("No")


if __name__ == '__main__':
    main()


Fixed submission:
import sys
input = sys.stdin.readline


def main():
    N = int(input())
    print(N//2+1) if N % 2 else print(N//2)


if __name__ == '__main__':
    main()
Buggy python submission (verdict: Time Limit Exceeded):
import sys
input = sys.stdin.readline


def main():
    N = int(input())
    A = list(map(int, input().split()))
    for i in range(N):
        for j in range(i+1, N):
            if A[i] == A[j]:
                print("NO")
                exit()
    print("YES")


if __name__ == '__main__':
    main()


Fixed submission:
import sys
input = sys.stdin.readline


def main():
    N = int(input())
    A = list(map(int, input().split()))
    A.sort()
    for i in range(1, N):
        if A[i-1] == A[i]:
            print("NO")
            exit()
    print("YES")


if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline


def main():
    K, X = map(int, input().split())
    print("Yes") if 500*K >= X else print("No")


if __name__ == '__main__':
    main()


Fixed submission:
import sys
input = sys.stdin.readline


def main():
    K, X = map(int, input().split())
    print("Yes") if 500*K >= X else print("No")


if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
s = str(input())
s_ = list(s)
for i in range(len(s)):
  if i==0 and len(s)==1 and s_[i]=='?':
    s_[i]='D'
  elif i==0 and s_[i]=='?' and s_[i+1]=='D':
      s_[i]='P'
  elif i==0 and s_[i]=='?' and s_[i+1]=='P':
      s_[i]='D'
  elif s_[i]=='?' and s[i-1]=='P':
    s_[i]='D'
  elif s_[i]=='?' and s[i-1]=='D':
    if i=len(s)-1:
      s_[i]='D'
    if s_[i+1]=='D':
      s_[i]='P'
    elif s_[i+1]=='?':
      s_[i]='P'
      s_[i+1]='D'
    else:
      s_[i]='D'
    
S = "".join(s_)
print(S)

Fixed submission:
s = str(input())
s_ = list(s)
for i in range(len(s)):
  if s_[i]=='?':
    s_[i]='D'
S = "".join(s_)
print(S)

Buggy python submission (verdict: Runtime Error):
s = str(input())
s_ = list(s)
for i in range(len(s)):
  if i==0 and len(s)==1 and s_[i]=='?':
    s_[i]='D'
  elif i==0 and s_[i]=='?' and s_[i+1]=='D':
      s_[i]='P'
  elif i==0 and s_[i]=='?' and s_[i+1]=='P':
      s_[i]='D'
  elif s_[i]=='?' and s[i-1]=='P':
    s_[i]='D'
  elif s_[i]=='?' and s[i-1]=='D':
    if s_[i+1]=='D':
      s_[i]='P'
    elif s_[i+1]=='?':
      s_[i]='P'
      s_[i+1]='D'
    else:
      s_[i]='D'
    
S = "".join(s_)
print(S)

Fixed submission:
s = str(input())
s_ = list(s)
for i in range(len(s)):
  if s_[i]=='?':
    s_[i]='D'
S = "".join(s_)
print(S)

Buggy python submission (verdict: Runtime Error):
s = str(input())
s_ = list(s)
for i in range(len(s)):
  if i==0 and s_[i]=='?' and s_[i+1]=='D':
      s_[i]='P'
  elif i==0 and s_[i]=='?' and s_[i+1]=='P':
      s_[i]='D'
  elif s_[i]=='?' and s[i-1]=='P':
    s_[i]='D'
  elif s_[i]=='?' and s[i-1]=='D':
    if s_[i+1]=='D' or s_[i+1]=='?':
      s_[i]='P'
      s_[i+1]='D'
    else:
      s_[i]='D'
    
S = "".join(s_)
print(S)

Fixed submission:
s = str(input())
s_ = list(s)
for i in range(len(s)):
  if s_[i]=='?':
    s_[i]='D'
S = "".join(s_)
print(S)

Buggy python submission (verdict: Runtime Error):
s = str(input())
s_ = list(s)
for i in range(len(s)):
  if s_[i]=='?' and i>0 and s_[i-1]=='P':
    s_[i]='D'
  elif s_[i]=='?' and s_[i+1]=='D':
    s_[i]='P'
  elif s_[i]=='?' and s_[i+1]=='P':
    s_[i]='D'
  elif s_[i]=='?':
    s_[i]='P'
    
S = "".join(s_)
print(S)

Fixed submission:
s = str(input())
s_ = list(s)
for i in range(len(s)):
  if s_[i]=='?':
    s_[i]='D'
S = "".join(s_)
print(S)
Buggy python submission (verdict: Runtime Error):
x, n = map(int, input().split())
if n == 100:
    print("")
elif n > 0:
    ps = list(map(int, input().split()))
else:
    print(x)
nums = [n for n in range(1, 101) if n not in ps]

abs_plus = sorted([n-x for n in nums if n-x >= 0])
abs_minus = sorted([-(n-x) for n in nums if n-x < 0])
if abs_plus == []:
    print(x-abs_minus[0])
elif abs_minus == []:
    print(x+abs_plus[0])
elif abs_plus[0] >= abs_minus[0]:
    print(x-abs_minus[0])
else:
    print(x+abs_plus[0])

Fixed submission:
x, n = map(int, input().split())
if n > 0:
    ps = list(map(int, input().split()))
else:
    print(x)
    exit()
nums = [n for n in range(-1, 102) if n not in ps]

abs_plus = sorted([n-x for n in nums if n-x >= 0])
abs_minus = sorted([-(n-x) for n in nums if n-x < 0])
if abs_plus == []:
    print(x-abs_minus[0])
elif abs_minus == []:
    print(x+abs_plus[0])
elif abs_plus[0] >= abs_minus[0]:
    print(x-abs_minus[0])
else:
    print(x+abs_plus[0])

Buggy python submission (verdict: Runtime Error):
x, n = map(int, input().split())
if n > 0:
    ps = list(map(int, input().split()))
else:
    ps = []
nums = [n for n in range(1, 101) if n not in ps]

if x in nums:
    print(x)
else:
    abs_plus = sorted([n-x for n in nums if n-x >= 0])
    abs_minus = sorted([-(n-x) for n in nums if n-x < 0])
    if abs_plus == []:
        print(x-abs_minus[0])
    elif abs_minus == []:
        print(x+abs_plus[0])
    elif abs_plus[0] >= abs_minus[0]:
        print(x-abs_minus[0])
    else:
        print(x+abs_plus[0])

Fixed submission:
x, n = map(int, input().split())
if n > 0:
    ps = list(map(int, input().split()))
else:
    print(x)
    exit()
nums = [n for n in range(-1, 102) if n not in ps]

abs_plus = sorted([n-x for n in nums if n-x >= 0])
abs_minus = sorted([-(n-x) for n in nums if n-x < 0])
if abs_plus == []:
    print(x-abs_minus[0])
elif abs_minus == []:
    print(x+abs_plus[0])
elif abs_plus[0] >= abs_minus[0]:
    print(x-abs_minus[0])
else:
    print(x+abs_plus[0])

Buggy python submission (verdict: Runtime Error):
x, n = map(int, input().split())
if n > 0:
    ps = list(map(int, input().split()))
else:
    ps = []
nums = [n for n in range(1, 101) if n not in ps]

if x in nums:
    print(x)
else:
    abs_plus = sorted([n-x for n in nums if n-x >= 0])
    abs_minus = sorted([-(n-x) for n in nums if n-x < 0])
    if abs_plus[0] >= abs_minus[0]:
        print(x-abs_minus[0])
    else:
        print(x+abs_plus[0])

Fixed submission:
x, n = map(int, input().split())
if n > 0:
    ps = list(map(int, input().split()))
else:
    print(x)
    exit()
nums = [n for n in range(-1, 102) if n not in ps]

abs_plus = sorted([n-x for n in nums if n-x >= 0])
abs_minus = sorted([-(n-x) for n in nums if n-x < 0])
if abs_plus == []:
    print(x-abs_minus[0])
elif abs_minus == []:
    print(x+abs_plus[0])
elif abs_plus[0] >= abs_minus[0]:
    print(x-abs_minus[0])
else:
    print(x+abs_plus[0])
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
result = 1
for _a in a:
    result *= _a
if result > 10**18:
    print("-1")
else:
    print(result)

Fixed submission:
int(input())
a = sorted(list(map(int, input().split())))
result = 1
if a[0] == 0:
    print("0")
    exit()
for _a in a:
    result *= _a
    if result > 10**18:
        print("-1")
        exit()
print(result)
Buggy python submission (verdict: Runtime Error):
import sympy
n = int(input())
i = 0
remove_nums = [1]
while True:
    divisors = sympy.divisors(int(n))
    z_cand = [d for d in divisors if d not in remove_nums]
    if z_cand == []:
        break
    z = min(z_cand)
    remove_nums.append(z)
    n = n/z
    i += 1
print(i)

Fixed submission:
import math
import numpy as np
n = int(input())
fac = []
sqrt_n = math.sqrt(n)
for i in range(2, int(sqrt_n)):
    if not n % i:
        fac.append(0)
    while not n % i:
        n /= i
        fac[-1] += 1
if n > sqrt_n:
    fac.append(1)
num = 0
for f in fac:
    num += np.count_nonzero(f >= np.cumsum(range(1, f+1)))
print(num)
Buggy python submission (verdict: Time Limit Exceeded):
class Node:
    def __init__(self):
        self.label = None
        self.left = None
        self.right = None

    def searchORinsert(self,num):
        #もしなければ、新しいノードを作る
        if self.label==None:
            self.label=num
            
            return 1

        elif  self.label>num:
                if self.left!=None:
                    return((self.left).searchORinsert(num))
                else :
                    self.left=Node()
                    return((self.left).searchORinsert(num))
                



        elif  self.label<num:
                if self.right!=None:
                    return((self.right).searchORinsert(num))
                else :
                    self.right=Node()
                   
                    return((self.right).searchORinsert(num))

                
    #あったら、警告する

        else :
            return 0






N =int(input())


l=list(map(int, input().split())) 


No=Node()
f=1
for i in l:
    
    if No.searchORinsert(i)!=1:
        f=0
        break


if f!=0:
        print("YES")

else:
        print("NO")

Fixed submission:


N =int(input())


l=list(map(int, input().split())) 

l.sort()
f=1
for i in range(0,N-1):
    
    if l[i]==l[i+1]:
        f=0
        break


if f!=0:
        print("YES")

else:
        print("NO")
Buggy python submission (verdict: Runtime Error):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = input()
T = int(t)

d = b - a
d = int(d)
dv = v - w
dv = int(dv)
d = abs(d)
if abs(d) % abs(dv) == 0 and abs(d) <= int(dv) * T:
    print('YES')
else:
    print('NO')

Fixed submission:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = input()
T = int(t)

d = b - a
d = int(d)
dv = v - w
dv = int(dv)
d = abs(d)
if dv > 0 and abs(d) <= abs(dv) * T:
    print('YES')
else:
    print('NO')

Buggy python submission (verdict: Runtime Error):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = input()
T = int(t)

d = b - a
d = int(d)
dv = v - w
dv = int(dv)
d = abs(d)
if int(d) % abs(dv) == 0 and int(d) <= int(dv) * T:
    print('YES')
else:
    print('NO')

Fixed submission:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = input()
T = int(t)

d = b - a
d = int(d)
dv = v - w
dv = int(dv)
d = abs(d)
if dv > 0 and abs(d) <= abs(dv) * T:
    print('YES')
else:
    print('NO')

Buggy python submission (verdict: Runtime Error):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = input()
T = int(t)

d = b - a
d = int(d)
dv = v - w
d = abs(d)
if int(d) % int(dv) == 0 and  int(d) <= int(dv) * T:
    print('YES')
else:
    print('NO')

Fixed submission:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = input()
T = int(t)

d = b - a
d = int(d)
dv = v - w
dv = int(dv)
d = abs(d)
if dv > 0 and abs(d) <= abs(dv) * T:
    print('YES')
else:
    print('NO')

Buggy python submission (verdict: Runtime Error):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = input()
T = int(t)

d = b - a
dv = v - w
if int(d) % int(dv) == 0:
    if int(d) <= int(dv) * T:
        print('YES')
else:
    print('NO')

Fixed submission:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = input()
T = int(t)

d = b - a
d = int(d)
dv = v - w
dv = int(dv)
d = abs(d)
if dv > 0 and abs(d) <= abs(dv) * T:
    print('YES')
else:
    print('NO')
Buggy python submission (verdict: Runtime Error):
n = print()
 
s = int(n) % 10
 
if s == 3:
	print('bon')
if s == 1:
	print('pon')
if s == 2:
    print('hon')
if s == 4:
    print('hon')
if s == 5:
    print('hon')
if s == 6:
    print('pon')
if s == 7:
    print('hon')
if s == 8:
    print('pon')
if s == 9:
    print('hon')
if s == 0:
    print('pon')

Fixed submission:
N = input()
s = int(N) % 10
if s == 3:
    print('bon')
if s == 0:
    print('pon')
if s == 1:
    print('pon')
if s == 6:
    print('pon')
if s == 8:
    print('pon')

if s == 2:
    print('hon')
if s == 4:
    print('hon')
if s == 5:
    print('hon')
if s == 7:
    print('hon')
if s == 9:
    print('hon')

Buggy python submission (verdict: Runtime Error):
n = print()

s = int(n) % 10

if s == 3:
  print('bon')
if s == 1:
  print('pon')
if s == 2:
  print('hon')
if s == 4:
  print('hon')
if s == 5:
  print('hon')
if s == 6:
  print('pon')
if s == 7:
  print('hon')
if s == 8:
  print('pon')
if s == 9:
  print('hon')
if s == 0:
  print('pon')

Fixed submission:
N = input()
s = int(N) % 10
if s == 3:
    print('bon')
if s == 0:
    print('pon')
if s == 1:
    print('pon')
if s == 6:
    print('pon')
if s == 8:
    print('pon')

if s == 2:
    print('hon')
if s == 4:
    print('hon')
if s == 5:
    print('hon')
if s == 7:
    print('hon')
if s == 9:
    print('hon')

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

s = N % 10

if s in [3]
	print('bon')
if s in [0, 1, 6, 8]
	print('hon')
if s in [2, 4, 5, 7, 9]
    print('pon')

Fixed submission:
N = input()
s = int(N) % 10
if s == 3:
    print('bon')
if s == 0:
    print('pon')
if s == 1:
    print('pon')
if s == 6:
    print('pon')
if s == 8:
    print('pon')

if s == 2:
    print('hon')
if s == 4:
    print('hon')
if s == 5:
    print('hon')
if s == 7:
    print('hon')
if s == 9:
    print('hon')
Buggy python submission (verdict: Runtime Error):
k = input()
s = input()
i = 0
l = int(k)
p = str()

while i < l:
    p = p + s[i]
    i = i + 1

if len(s) > l:
	print(p + '...')
else:
	print(p)


Fixed submission:
k = input()
s = input()
i = 0
l = int(k)
p = str()
 
while i < l and len(s) > l:
    p = p + s[i]
    i = i + 1
while i < len(s) and len(s) <=l:
    p = p + s[i]
    i = i + 1
if len(s) > l:
	print(p + '...')
else:
	print(p)

Buggy python submission (verdict: Runtime Error):
k = input()
s = input()
i = 0
l = int(k)
p = str()

while i < l:
    p = p + s[i]
    i = i + 1

print(p)

Fixed submission:
k = input()
s = input()
i = 0
l = int(k)
p = str()
 
while i < l and len(s) > l:
    p = p + s[i]
    i = i + 1
while i < len(s) and len(s) <=l:
    p = p + s[i]
    i = i + 1
if len(s) > l:
	print(p + '...')
else:
	print(p)

Buggy python submission (verdict: Runtime Error):
k = input()
s = input()
i = 0
l = int(k)
p = None

while i < l:
    p = p + s[i]
    i = i + 1

print(p)

Fixed submission:
k = input()
s = input()
i = 0
l = int(k)
p = str()
 
while i < l and len(s) > l:
    p = p + s[i]
    i = i + 1
while i < len(s) and len(s) <=l:
    p = p + s[i]
    i = i + 1
if len(s) > l:
	print(p + '...')
else:
	print(p)

Buggy python submission (verdict: Runtime Error):
k = input()
s = input()
i = 0
l = int(k)

while i < l:
    p = p + s[i]
    i = i + 1

print(p)

Fixed submission:
k = input()
s = input()
i = 0
l = int(k)
p = str()
 
while i < l and len(s) > l:
    p = p + s[i]
    i = i + 1
while i < len(s) and len(s) <=l:
    p = p + s[i]
    i = i + 1
if len(s) > l:
	print(p + '...')
else:
	print(p)

Buggy python submission (verdict: Runtime Error):
k = input()
s = input()
i = 0
list = []
l = int(k)

while i < l:
    list.append(s[i])
    i = i + 1

print(list)

Fixed submission:
k = input()
s = input()
i = 0
l = int(k)
p = str()
 
while i < l and len(s) > l:
    p = p + s[i]
    i = i + 1
while i < len(s) and len(s) <=l:
    p = p + s[i]
    i = i + 1
if len(s) > l:
	print(p + '...')
else:
	print(p)

Buggy python submission (verdict: Runtime Error):
k = input()
s = input()
i = 0
l = int(k)

while i < l:
	print(s[i])
    i = i + 1

Fixed submission:
k = input()
s = input()
i = 0
l = int(k)
p = str()
 
while i < l and len(s) > l:
    p = p + s[i]
    i = i + 1
while i < len(s) and len(s) <=l:
    p = p + s[i]
    i = i + 1
if len(s) > l:
	print(p + '...')
else:
	print(p)

Buggy python submission (verdict: Runtime Error):
k = input()
s = input()
i = 0

while i < int(k):
	print(s[i])
    i = i + 1

Fixed submission:
k = input()
s = input()
i = 0
l = int(k)
p = str()
 
while i < l and len(s) > l:
    p = p + s[i]
    i = i + 1
while i < len(s) and len(s) <=l:
    p = p + s[i]
    i = i + 1
if len(s) > l:
	print(p + '...')
else:
	print(p)

Buggy python submission (verdict: Runtime Error):
k = input()
s = input()
i = 0

while i < 7:
	print(s[i])
    i = i + 1

Fixed submission:
k = input()
s = input()
i = 0
l = int(k)
p = str()
 
while i < l and len(s) > l:
    p = p + s[i]
    i = i + 1
while i < len(s) and len(s) <=l:
    p = p + s[i]
    i = i + 1
if len(s) > l:
	print(p + '...')
else:
	print(p)
Buggy python submission (verdict: Runtime Error):
n = input()
pi = 3.142592
R = 2 * pi * n
print(R)

Fixed submission:
n = input()
pi = 3.142592
R = 2 * pi * int(n)
print(R)
Buggy python submission (verdict: Runtime Error):
x, y = map(int, input().spilit())
array = list(map(int, input().spilit()))
su = sum(array)
a = x - su
if a > -1:
    print(a)
else:
    print(-1)

Fixed submission:
x, y = map(int, input().split())
array = list(map(int, input().split()))
su = sum(array)
a = x - su
if a > -1:
    print(a)
else:
    print(-1)

Buggy python submission (verdict: Runtime Error):
x,y = map(int, input().spilit())
array = list(map(int, input().spilit()))
su = sum(array)
a = x - su
if a > -1:
	print(a)
else:
	print(-1)

Fixed submission:
x, y = map(int, input().split())
array = list(map(int, input().split()))
su = sum(array)
a = x - su
if a > -1:
    print(a)
else:
    print(-1)

Buggy python submission (verdict: Runtime Error):
x,y = map(int, input().spilit())
array = list(map(int, input().spilit()))
su = sum(array)
a = x - su
if a > -1:
  print(a)
else:
  print(-1)

Fixed submission:
x, y = map(int, input().split())
array = list(map(int, input().split()))
su = sum(array)
a = x - su
if a > -1:
    print(a)
else:
    print(-1)
Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
a = list(map(int, input().split()))
b = []

for k in range(K):
    b = [0 for _ in range(N)]
    for i in range(N):
        for j in range(max(i-a[i], 0), min(i+a[i]+1, N)):
            b[j] += 1
    a = b
    
ans = " ".join([str(i) for i in a])
print(ans)

Fixed submission:
S = input()
print(S[0:3])
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
answer = 1
for i in a:
    answer *= i
if answer <= 10**18:
    print(answer)
if answer > 10**18:
        print ("-1")

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
answer = 1
if 0 in a:
    answer = 0
for i in a:
    answer *= i        
    if answer > 10**18:
        print ("-1")
        break
if answer <= 10**18:
    print(answer)
Buggy python submission (verdict: Runtime Error):
s = input()
count = 0
for i in range(len(s)+1):
    for j in range(i+1, len(s)+1):
        if (int(s[i:j])%3 == 0 and int(s[i:j])%673 == 0):
            count += 1
            #print("ok", s[i:j])
print(count)

Fixed submission:
s, w = map(int, input().split())
if w >= s:
  print('unsafe')
else:
  print('safe')