Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())

if A = 1 and B = 2:
  print(3)
elif A = 2 and B = 3:
  print(1)
else:
  print(2)

Fixed submission:
A = int(input())
B = int(input())

if A == 1 and B == 2:
  print(3)
elif A == 1 and B == 3:
  print(2)
elif A == 2 and B == 1:
  print(3)
elif A == 2 and B == 3:
  print(1)
elif A == 3 and B == 1:
  print(2)
else:
  print(1)
Buggy python submission (verdict: Runtime Error):
r = int(input)

print(int(r**2))


Fixed submission:
r = int(input())

print(int(r**2))

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

print(r**2)

Fixed submission:
r = int(input())

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

if N % 2 == 1:
  print('No')
else:
  if S[0:(N // 2) + 1] = S[N // 2:]:
    print('Yes')
  else:
    print('No')

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

if N % 2 == 1:
  print('No')
else:
  if S[0:N // 2] == S[N // 2:]:
    print('Yes')
  else:
    print('No')
Buggy python submission (verdict: Runtime Error):
s = input()
t = input()

c = 0

for i in s:
  for j in t:
    if i == j and s[i] == t[j]:
      c += 1

print(c)

Fixed submission:
s = input()
t = input()

if s[0] == t[0] and s[1] == t[1] and s[2] == t[2]:
  print(3)
elif (s[0] == t[0] and s[1] == t[1]) or (s[1] == t[1] and s[2] == t[2]) or (s[2] == t[2] and s[0] == t[0]):
  print(2)
elif s[0] == t[0] or s[1] == t[1] or s[2] == t[2]:
  print(1)
else:
  print(0)
Buggy python submission (verdict: Runtime Error):
a = int(input())
s = input()

if a>= 3200:
  print(S)
else:
  print('red')

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

if a>= 3200:
  print(s)
else:
  print('red')
Buggy python submission (verdict: Runtime Error):
A, B = map(int, input()split())
x = A+B
y = A-B
z = A*B

if B>=0:
  if x - z >= 0:
    print(x)
  else:
    print(z)
else:
  if y - z >= 0:
    print(y)
  else:
    print(z)


Fixed submission:
A, B = map(int, input().split())
x = A+B
y = A-B
z = A*B

if B>=0:
  if x - z >= 0:
    print(x)
  else:
    print(z)
else:
  if y - z >= 0:
    print(y)
  else:
    print(z)

Buggy python submission (verdict: Runtime Error):
A, B = map(int, input()split())
x = A+B
y = A-B
z = A*B

if y>=0:
  if x - z >= 0:
    print(x)
  else:
    print(z)
else:
  if y - z >= 0:
    print(y)
  else:
    print(z)

Fixed submission:
A, B = map(int, input().split())
x = A+B
y = A-B
z = A*B

if B>=0:
  if x - z >= 0:
    print(x)
  else:
    print(z)
else:
  if y - z >= 0:
    print(y)
  else:
    print(z)
Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().split)

if (A+B)&2 == 0:
  print((A+B)//2)
else:
  print("IMPOSSIBLE")

Fixed submission:
A, B = map(int, input().split())

if (A+B)%2 == 0:
  print((A+B)//2)
else:
  print("IMPOSSIBLE")
Buggy python submission (verdict: Runtime Error):
s = input()
a = s[0]
b = s[1]
c = s[2]
d = s[3]

if a=b and c=d:
  print("Yes")
elif a=c and b=d:
  print("Yes")
elif a=d and b=c:
  print("Yes")
else:
  print("No")

Fixed submission:
s = input()
a = s[0]
b = s[1]
c = s[2]
d = s[3]

if a==b==c==d:
  print("No")
elif a==b and c==d:
  print("Yes")
elif a==c and b==d:
  print("Yes")
elif a==d and b==c:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
s = int(input())

if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
  print('Bad')
else:
  print('Good')


Fixed submission:
s = input()

if s[0] != s[1] and s[1] != s[2] and s[2] != s[3]:
  print('Good')
else:
  print('Bad')

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

if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
  print('Bad')
else:
  print('Good')


Fixed submission:
s = input()

if s[0] != s[1] and s[1] != s[2] and s[2] != s[3]:
  print('Good')
else:
  print('Bad')

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

if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
  print('Bad')
else:
  print('Good')


Fixed submission:
s = input()

if s[0] != s[1] and s[1] != s[2] and s[2] != s[3]:
  print('Good')
else:
  print('Bad')

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

if S[0] == S[1] or S[0] == S[2] or S[0] == S[3] or S[1] == S[2] or S[1] == S[3] or S[2] == S[3]:
  print('Bad')
else:
  print('Good')


Fixed submission:
s = input()

if s[0] != s[1] and s[1] != s[2] and s[2] != s[3]:
  print('Good')
else:
  print('Bad')

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

if S[0] == S[1] or S [0] == S[2] or S[0] == S[3] or S[1] == S[2] or S[1] == S[3] or S[2] == S[3]:
  print('Bad')
else:
  print('Good')


Fixed submission:
s = input()

if s[0] != s[1] and s[1] != s[2] and s[2] != s[3]:
  print('Good')
else:
  print('Bad')

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

if S[0] == S[1] or S [0] == S [2] or S[0] == S[3] or S[1] == S[2] or S[1] == S[3] or S[2] == S [3]:
  print('Bad')
else:
  print('Good')

Fixed submission:
s = input()

if s[0] != s[1] and s[1] != s[2] and s[2] != s[3]:
  print('Good')
else:
  print('Bad')
Buggy python submission (verdict: Runtime Error):
H, W = map(int, input().split())
h, w = map(int input().split())

s = (H - h) * (W - w)

print(s)

Fixed submission:
H, W = map(int, input().split())
h, w = map(int, input().split())

s = (H - h) * (W - w)

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

c = N.count(2)

print(c)

Fixed submission:
N = input()

c = N.count('2')

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

a = a.count('+')
b = a.count('-')

x = a - b

print(x)

Fixed submission:
s = input()

a = s.count('+')
b = s.count('-')

x = a - b

print(x)
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())

x = a + b
y = a - b
z = a * b

print(max[x, y, z])

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

x = a + b
y = a - b
z = a * b

print(max([x, y, z]))
Buggy python submission (verdict: Runtime Error):
a, b, c, d = map(int, inmput().split())

x = abs(a - b)
y = abs(b - c)
z = abs(c - a)

if z <= d:
  print('Yes')
elif x<= d and y <= d:
  print('Yes')
else:
  print('No')


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

x = abs(a - b)
y = abs(b - c)
z = abs(c - a)

if z <= d:
  print('Yes')
elif x<= d and y <= d:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
a, b, c, d = map(int, inmput().split())

x = abs(a - b)
y = abs(b - c)
z = abs(c - a)

if z <= d:
  print('Yes')
elif if x<= d and y <= d:
  print('Yes')
else:
  print('No')


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

x = abs(a - b)
y = abs(b - c)
z = abs(c - a)

if z <= d:
  print('Yes')
elif x<= d and y <= d:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input(),split())

r = a * b % 2

if r == 0:
  print('Even')
else:
  print('Odd')

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

r = a * b % 2

if r == 0:
  print('Even')
else:
  print('Odd')
Buggy python submission (verdict: Runtime Error):
n = int(input())

if n[0] == n[1] == n[2] or n[1] == n[2] == n[3]:
  print('Yes')
else:
  print('No')

Fixed submission:
n = input()

if n[0] == n[1] == n[2] or n[1] == n[2] == n[3]:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input().split())

if a == b:
  input(c)
elif b == c:
  input(a)
else:
  input(b)


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

if a == b:
  print(c)
elif b == c:
  print(a)
else:
  print(b)

Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input().split())

if a = b:
  input(c)
elif b = c:
  input(a)
else:
  input(b)

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

if a == b:
  print(c)
elif b == c:
  print(a)
else:
  print(b)
Buggy python submission (verdict: Runtime Error):
N = int(input())
N_reverse = N[::-1]

if N == N_reverse:
  print('Yes')
else:
  print('No')


Fixed submission:
N = input()
N_reverse = N[::-1]

if N == N_reverse:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
N = int(input())
N_reverse = N[::-1]

if N = N_reverse:
  print('Yes')
else:
  print('No')

Fixed submission:
N = input()
N_reverse = N[::-1]

if N == N_reverse:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
s = input()

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


Fixed submission:
s = input()

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

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

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

Fixed submission:
s = input()

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

Buggy python submission (verdict: Runtime Error):
s = input()
m = str(len(s) -2)

print(s[0] +　m + s[-1])

Fixed submission:
s = input()

print(s[0]+str(len(s)-2)+s[-1])
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())

if a == 1:
  if b == 1:
    print('Draw')
  else:
    print(Alice)
else:
  if b == 1:
    print('Bob')
  elif a > b:
    print('Alice')
  elif a == b:
    print('Draw')
  else:
    print('Bob')

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

if a == 1:
  if b == 1:
    print('Draw')
  else:
    print('Alice')
else:
  if b == 1:
    print('Bob')
  elif a > b:
    print('Alice')
  elif a == b:
    print('Draw')
  else:
    print('Bob')
Buggy python submission (verdict: Runtime Error):
c = input()

if c == a or c == i or  c == u or c == e or c == 0:
  print('vowel')
else:
  print('consonant')

Fixed submission:
c = input()

if c == 'a' or c == 'i' or  c == 'u' or c == 'e' or c == 'o':
  print('vowel')
else:
  print('consonant')
Buggy python submission (verdict: Runtime Error):
a = input().split()

initial_middle = a[7]

print('A'+ initial_middle +'C')

Fixed submission:
a = input()

initial_middle = a[8]

print('A'+ initial_middle +'C')
Buggy python submission (verdict: Runtime Error):
n = int(input())
k = int(input())
x = int(input())
y = int(input())

f_normal = x * k
f_addition = f_formal + (n - k) * y

if n <= k:
  print(f_normal)
else:
  print(f_addition)

Fixed submission:
n = int(input())
k = int(input())
x = int(input())
y = int(input())

f_normal = x * n
f_addition = x * k  + y * (n - k)

if n <= k:
  print(f_normal)
else:
  print(f_addition)
Buggy python submission (verdict: Runtime Error):
A, B, C = map(int, input().split())

if A + B + C == 17:
  if (A = 5 or 7) and (B = 5 or 7) and (C = 5 or 7):
    print('YES')
  else:
    print('NO')
else:
  print('NO')

Fixed submission:
A, B, C = map(int, input().split())

if A + B + C == 17:
  if (A == 5 or 7) and (B == 5 or 7) and (C == 5 or 7):
    print('YES')
  else:
    print('NO')
else:
  print('NO')
Buggy python submission (verdict: Runtime Error):
nums = input().split()
a = int(nums[0])
b = nums[1]

res = ""
for ch in b:
	if ch not in ('0', '.'):
		res += ch
		
b = int(res)

prod = (a * b) // 100

print(prod)


Fixed submission:
nums = input().split()
a = int(nums[0])
b = nums[1]

res = ""
for ch in range(len(b)):
	if b[ch] != '.':
		res += b[ch]
		
b = int(res)

prod = (a * b) // 100

print(prod)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
ans = 1
A = list(map(int, input().split()))
flag = 0

for j in range(len(A)):
  if A[j] == 0:
    flag = 1
    ans = 0

if flag == 0:
  for i in range(N):
    ans = ans * A[i]
    if ans == 0:
      break


if ans > 10 ** 18:
  print('-1')
else:
  print(ans)

Fixed submission:
N = int(input())
ans = 1
A = list(map(int, input().split()))
flag = 0

for j in range(len(A)):
  if A[j] == 0:
    flag = 1
    ans = 0

if flag == 0:
  for i in range(N):
    ans = ans * A[i]
    if ans > 10 ** 18:
      break


if ans > 10 ** 18:
  print('-1')
else:
  print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
ans = 1
A = list(map(int, input().split()))

for i in range(N):
  ans = ans * A[i]
  if ans == 0:
    break

if ans > 10 ** 18:
  print('-1')
else:
  print(ans)

Fixed submission:
N = int(input())
ans = 1
A = list(map(int, input().split()))
flag = 0

for j in range(len(A)):
  if A[j] == 0:
    flag = 1
    ans = 0

if flag == 0:
  for i in range(N):
    ans = ans * A[i]
    if ans > 10 ** 18:
      break


if ans > 10 ** 18:
  print('-1')
else:
  print(ans)

Buggy python submission (verdict: Runtime Error):
N = int(input())
ans = 1
A = list(map(int, input().split()))

for i in range(N):
  ans = ans * A[i]
  if ans = 0:
    break

if ans > 10 ** 18:
  print('-1')
else:
  print(ans)

Fixed submission:
N = int(input())
ans = 1
A = list(map(int, input().split()))
flag = 0

for j in range(len(A)):
  if A[j] == 0:
    flag = 1
    ans = 0

if flag == 0:
  for i in range(N):
    ans = ans * A[i]
    if ans > 10 ** 18:
      break


if ans > 10 ** 18:
  print('-1')
else:
  print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
ans = 1
A = list(map(int, input().split()))

for i in range(N):
  ans = ans * A[i]

if ans > 10 ** 18:
  print('-1')
else:
  print(ans)

Fixed submission:
N = int(input())
ans = 1
A = list(map(int, input().split()))
flag = 0

for j in range(len(A)):
  if A[j] == 0:
    flag = 1
    ans = 0

if flag == 0:
  for i in range(N):
    ans = ans * A[i]
    if ans > 10 ** 18:
      break


if ans > 10 ** 18:
  print('-1')
else:
  print(ans)
Buggy python submission (verdict: Runtime Error):
A, B, C, K = map(int, input().split())

if (A+B) == K:
  print(A)
elif (A+B) > K:
  if a > K:
    print(K)
  else:
    print(A)
elif (A+B) < K:
  print(A - (K - (A+B)))


Fixed submission:
A, B, C, K = map(int, input().split())

if (A+B) == K:
  print(A)
elif (A+B) > K:
  if A > K:
    print(K)
  else:
    print(A)
elif (A+B) < K:
  print(A - (K - (A+B)))

Buggy python submission (verdict: Runtime Error):
A, B, C, K = map(int, input().split())

if A+B == K:
  print(A)
elif A+B > K:
  if a > K:
    print(K)
  else:
    print(A)
elif A+B < K:
  print(A - (K - (A+B)))


Fixed submission:
A, B, C, K = map(int, input().split())

if (A+B) == K:
  print(A)
elif (A+B) > K:
  if A > K:
    print(K)
  else:
    print(A)
elif (A+B) < K:
  print(A - (K - (A+B)))
Buggy python submission (verdict: Time Limit Exceeded):
import math 
 
K = int(input())
sum = 0
 
for i in range(K):
    for j in range(K):
        for k in range(K):
            sum += math.gcd(math.gcd((i+1),(j+1)),(k+1))
 
print(sum)

Fixed submission:
from math import gcd

K = int(input())
sum = 0

for i in range(1, K+1):
    for j in range(1, K+1):
        for k in range(1, K+1):
            sum += gcd(gcd(i,j),k)

print(sum)

Buggy python submission (verdict: Time Limit Exceeded):
import math 
 
K = int(input())
sum = 0
 
for i in range(K):
    for j in range(K):
        for k in range(K):
            sum += math.gcd(math.gcd((i+1),(j+1)),(k+1))
 
print(sum)

Fixed submission:
from math import gcd

K = int(input())
sum = 0

for i in range(1, K+1):
    for j in range(1, K+1):
        for k in range(1, K+1):
            sum += gcd(gcd(i,j),k)

print(sum)

Buggy python submission (verdict: Time Limit Exceeded):
import math
from functools import reduce

def gcd(*numbers):
    return reduce(math.gcd, numbers)

K = int(input())
sum = 0

for i in range(K):
    for j in range(K):
        for k in range(K):
            sum += gcd((i+1),(j+1),(k+1))

print(sum)

Fixed submission:
from math import gcd

K = int(input())
sum = 0

for i in range(1, K+1):
    for j in range(1, K+1):
        for k in range(1, K+1):
            sum += gcd(gcd(i,j),k)

print(sum)

Buggy python submission (verdict: Time Limit Exceeded):
import math
from functools import reduce

def gcd(*numbers):
    return reduce(math.gcd, numbers)

K = int(input())
sum = 0

for i in range(K):
    for j in range(K):
        for k in range(K):
            sum += gcd((i+1),(j+1),(k+1))

print(sum)



Fixed submission:
from math import gcd

K = int(input())
sum = 0

for i in range(1, K+1):
    for j in range(1, K+1):
        for k in range(1, K+1):
            sum += gcd(gcd(i,j),k)

print(sum)
Buggy python submission (verdict: Runtime Error):
S = input()

def kaibunn_boolean(s):
  return s == s[::-1]

ans = true

if kaibunn_boolean(S) and kaibunn_boolean(S[:3]):
  ans = kaibunn_boolean(S)

if ans:
  print('Yes')
else:
  print('No')



Fixed submission:
S = input()
ans = True
def isP(s):
    return s == s[::-1]

if not isP(S):
    ans = False
if not isP(S[:(len(S)//2)]):
    ans = False

if ans:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
i = list(map(int, input().split()))
A = i[0]
B = i[1]

if(A - B > 1 || B - A > 1):
  print(':(')

if((A - B) == 0 || (A - B) == 1 || (B - A) == 0 || (B - A) == 1):
  print('Yay!')

Fixed submission:
i = list(map(int, input().split()))
A = i[0]
B = i[1]

if(A - B > 1 or B - A > 1):
  print(':(')

if((A - B) == 0 or (A - B) == 1 or (B - A) == 0 or (B - A) == 1):
  print('Yay!')
Buggy python submission (verdict: Time Limit Exceeded):
N, K = map(int,input().split())
nums = list(map(int,input().split()))
ans = []

for i in range(N):
  ans.append((nums[i]+1)/2)

M = sum(ans[0:K])
for i in range(1,N-K+1):
  S = sum(ans[i:i+K])
  M = max(M,S)

print(M)

Fixed submission:
N, K = map(int,input().split())
nums = list(map(int,input().split()))
ans = []

for i in range(N):
  ans.append((nums[i]+1)/2)

M = sum(ans[0:K])
S = M
for i in range(K,N):
  S = S + ans[i] - ans[i-K]
  M = max(M,S)

print(M)

Buggy python submission (verdict: Time Limit Exceeded):
N, K = map(int,input().split())
nums = list(map(int,input().split()))
ans = []

for i in range(N):
  ans.append((nums[i]+1)/2)

sums = []
for i in range(N-K+1):
  number =0
  for j in range(i,K+i):
    number += ans[j]
  sums.append(number)
print(max(sums))
  

Fixed submission:
N, K = map(int,input().split())
nums = list(map(int,input().split()))
ans = []

for i in range(N):
  ans.append((nums[i]+1)/2)

M = sum(ans[0:K])
S = M
for i in range(K,N):
  S = S + ans[i] - ans[i-K]
  M = max(M,S)

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

an = ''
for i in range(n):
  an = an + str(ans[i]) + ' '
 
print(an)

Fixed submission:
n = int(input())
a = list(map(int,input().split(' ')))
#print(a)
ans = [0] * n
for i in range(n):
  ans[a[i]-1] = i + 1

for i in range(n):
  print(ans[i])
Buggy python submission (verdict: Runtime Error):
N = int(input())
num = 1
flag = 0
c=list(map(int, input().split()))
for i in c:
    if i == 0:
        flag = 1
        print("0")
if flag == 0:
    for i in c:
        num *= i
    if num > 1000000000000000000:
        print("-1")
    else:
        print(num)

Fixed submission:
a,b=map(int, input().split())
print(a*b)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
num = 1
flag = 0
c=[int(i) for i in input().split()]
for i in c:
    if i == 0:
        flag = 1
        print("0")
if flag == 0:
    for i in c:
        num *= i
    if num > 1000000000000000000:
        print("-1")
    else:
        print(num)

Fixed submission:
N = int(input())
num = 1
flag = 0
c=[int(i) for i in input().split()]
for i in c:
    if i == 0:
        flag = 1
        print("0")
if flag == 0:
    for i in c:
        num *= i
        if num > 1000000000000000000:
            print("-1")
            flag =1
            break
if flag == 0:
    
    print(num)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
num = 1
flag = 0
c=list(map(int, input().split()))
for i in c:
    if i == 0:
        flag = 1
        print("0")
if flag == 0:
    for i in c:
        num *= i
    if num > 1000000000000000000:
        print("-1")
    else:
        print(num)

Fixed submission:
N = int(input())
num = 1
flag = 0
c=[int(i) for i in input().split()]
for i in c:
    if i == 0:
        flag = 1
        print("0")
if flag == 0:
    for i in c:
        num *= i
        if num > 1000000000000000000:
            print("-1")
            flag =1
            break
if flag == 0:
    
    print(num)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
num = 1
c=list(map(int, input().split()))
for i in c:
    num *= i
if num > 1000000000000000000:
    print("-1")
else:
    print(num)

Fixed submission:
N = int(input())
num = 1
flag = 0
c=[int(i) for i in input().split()]
for i in c:
    if i == 0:
        flag = 1
        print("0")
if flag == 0:
    for i in c:
        num *= i
        if num > 1000000000000000000:
            print("-1")
            flag =1
            break
if flag == 0:
    
    print(num)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
num = 1
c=list(map(int, input().split()))
for i in c:
    num *= i
if num > 1000000000000000000:
    print("-1")
else:
    print(num)

Fixed submission:
N = int(input())
num = 1
flag = 0
c=[int(i) for i in input().split()]
for i in c:
    if i == 0:
        flag = 1
        print("0")
if flag == 0:
    for i in c:
        num *= i
        if num > 1000000000000000000:
            print("-1")
            flag =1
            break
if flag == 0:
    
    print(num)
Buggy python submission (verdict: Runtime Error):
A, B = map(float, input().split())
print(int((A*(B*100))/100)

Fixed submission:
A, B = input().split()
ans = 0
A = int(A)
B = B.replace(".", "")
ans = A*int(B)
print(ans//100)
Buggy python submission (verdict: Runtime Error):
s = str(n)
flag = 0
    # １文字ずつ数値化し配列にする。
array = list(map(int, s))
    # 合計値を返す
for i in array:
  if i == 7:
    flag = 1
if flag ==1:
  print("Yes")
else:
  print("No")

Fixed submission:
s = input()
flag = 0
    # １文字ずつ数値化し配列にする。
array = list(map(int, s))
    # 合計値を返す
for i in array:
  if i == 7:
    flag = 1
if flag ==1:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
S=input()
re_list=[]
ele = list(map(str, S))
for i in range(1,len(ele)+1):
    for j in range(i+1,len(ele)+1):
        for k in range(j+1,len(ele)+1):
            re_str=ele[i-1]+ele[j-1]+ele[k-1]
            re_list.append(re_str)
re_list=list(set(re_list))
print(len(re_list))


Fixed submission:
N=int(input())
S=input()
re_list=[]
ele = list(map(str, S))
v_list=[]
vi_list=[]
flag = 0
count = 0
for i in range(1000):
    if i < 10:
        v_list.append("00"+str(i))
    elif i < 100:
        v_list.append("0" + str(i))
    else:
        v_list.append(str(i))

for i in range(1000):
    for j in range(N):
        if ele[j] == v_list[i][0] and flag == 0:
            flag = 1
            continue
        if ele[j] == v_list[i][1] and flag == 1:
            flag = 2
            continue
        if ele[j] == v_list[i][2] and flag == 2:
            count += 1
            break
    flag = 0
print(count)
Buggy python submission (verdict: Runtime Error):
S = list(input())
F = ["A", "C", "G", "T"]
count = 0
max = 0
for i in S:
    for j in F:
        if j == i:
            count += 1
    if max < count:

        max = count
    else:
        count = 0
        f = max
        max = 0
print(max if max > f else f)

Fixed submission:
S = list(input())
F = ["A", "C", "G", "T"]
count = 0
max = 0
f = 0
for i in S:
    for j in F:
        if j == i:
            count += 1
    if max < count:

        max = count
    else:
        count = 0
        if max != 0:
            f = max
        max = 0
    
print(max if max > f else f)
Buggy python submission (verdict: Runtime Error):
a, b = int(input().split())
if a*b % 2 == 0:
    print("Even")
else:
    print("Odd")

Fixed submission:
a, b = map(int, input().split())
if a*b % 2 == 0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
a, b = int(input())
if a*b % 2 == 0:
    print("Even")
else:
    print("Odd")

Fixed submission:
a, b = map(int, input().split())
if a*b % 2 == 0:
    print("Even")
else:
    print("Odd")