Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
s = input()
s = s.split(" ")
a = int(s[0])
b = int(s[1])
c = int(s[2])
res = b // x
res -= ((a - 1) // x)
print(res)

Fixed submission:
s = input()
s = s.split(" ")
a = int(s[0])
b = int(s[1])
x = int(s[2])
res = b // x
res -= ((a - 1) // x)
print(res)
Buggy python submission (verdict: Runtime Error):
#include <bits/stdc++.h>

using namespace std;

const double eps = 1e-9;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  long long ans = 1;
  vector<long long> a(n);
  bool ok = false;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    if (a[i] == 0) ok = true;
  }
  if (ok) {
    cout << "0\n";
    return 0;
  }
  double foo = (double)1e18;
  for (int i = 0; i < n; i++) {
    if (a[i] == 0) {
      cout << "0\n";
      return 0;
    }
    double bar = foo / a[i];
    if (bar < 1.0 * ans) {
      cout << "-1\n";
      return 0;
    }
    ans *= a[i];
  }
  cout << ans << '\n';
  return 0;
}

Fixed submission:
from math import *
n = int(input())
a = [int(x) for x in input().split()]
ans = 1
ok = False
fail = False
for x in a:
  if (x == 0):
    ok = True
    break
for x in a:
  if (ans * x > 1000000000000000000):
    fail = True
    break
  ans *= x
if (ok):
  print(0)
else:
  if (fail):
    print("-1")
  else:
    print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = [int(x) for x in input().split()]
ans = 1
for x in a:
  ans *= x
if (ans > 1000000000000000000):
  print("-1")
else:
  print(ans)

Fixed submission:
from math import *
n = int(input())
a = [int(x) for x in input().split()]
ans = 1
ok = False
fail = False
for x in a:
  if (x == 0):
    ok = True
    break
for x in a:
  if (ans * x > 1000000000000000000):
    fail = True
    break
  ans *= x
if (ok):
  print(0)
else:
  if (fail):
    print("-1")
  else:
    print(ans)
Buggy python submission (verdict: Runtime Error):
a = list(map(int, input().split()))
if (a[0]==a[1] and a[0] != a[2]) or (a[1]==a[2] and a[1] != a[0]) or (a[0]==a[2] and a[0] != a[1]):
print('Yes')
else:
print('No')

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

print(a*b)

Fixed submission:
a, b = map(int, input().split())
ans = a*b
print(ans)
Buggy python submission (verdict: Runtime Error):
k = input()
a, b = map(int,input().split())

if k*4 >= a:
    if k*4 <= b:
        print("OK")
    else:
        print("NG")

else:
    print("NG")
    

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

flug = 0

A = list(range(a, b+1))

for number in A:
    if number % k == 0:
        flug = 1
        
    else:
        continue

if flug == 1:
    print("OK")
else:
    print("NG")
Buggy python submission (verdict: Runtime Error):
N = int,input()

M = str(N)
print(M)

L = list(map(int, M))
print(L)

if L[0] == 7:
    print("Yes")
    
elif L[1] == 7:
    print("Yes")

elif L[2] == 7:
    print("Yes")

else:
    print("No")

Fixed submission:
N = input()

M = str(N)

L = list(map(int, M))

if L[0] == 7:
    print("Yes")
    
elif L[1] == 7:
    print("Yes")

elif L[2] == 7:
    print("Yes")

else:
    print("No")

Buggy python submission (verdict: Runtime Error):
def calc():
    for i in L:
        if L[i] == 7:
            print("Yes")
        else:
            return
    print("No")

N = int,input()

M = str(N)
print(M)

L = list(map(int, M))

calc()

Fixed submission:
N = input()

M = str(N)

L = list(map(int, M))

if L[0] == 7:
    print("Yes")
    
elif L[1] == 7:
    print("Yes")

elif L[2] == 7:
    print("Yes")

else:
    print("No")
Buggy python submission (verdict: Runtime Error):
def calc():
    d = a
    a = b
    b = d

    d = a
    a = c
    c = d

    print(a,b,c)

a, b, c = map(int, input().split())
calc()


Fixed submission:
def calc():
    x, y, z = c, a, b

    print(x, y, z)

a, b, c = map(int, input().split())
calc()

Buggy python submission (verdict: Runtime Error):
def calc():
    d = a
    a = b
    b = d

    d = a
    a = c
    c = d

    mytuple = (a,b,c)
    return mytuple

a, b, c = map(int, input().split())
ans = calc()
print(*ans)

Fixed submission:
def calc():
    x, y, z = c, a, b

    print(x, y, z)

a, b, c = map(int, input().split())
calc()

Buggy python submission (verdict: Runtime Error):
def calc():
    d = a
    a = b
    b = d

    d = a
    a = c
    c = d

    list = [a,b,c]
    return list

a, b, c = map(int, input().split())
print(calc())

Fixed submission:
def calc():
    x, y, z = c, a, b

    print(x, y, z)

a, b, c = map(int, input().split())
calc()

Buggy python submission (verdict: Runtime Error):
def calc():
    d = a
    a = b
    b = d

    d = a
    a = c
    c = d
    return a, b, c

a, b, c = map(int, input().split())
print(calc())

Fixed submission:
def calc():
    x, y, z = c, a, b

    print(x, y, z)

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

if S[2] == S[3]:
  if S[4] == S[5]:
    print("Yes")
  else:
    print("No")
else:
  print("No")

Fixed submission:
S = list(input())

if S[2] == S[3]:
  if S[4] == S[5]:
    print("Yes")
  else:
    print("No")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
S = list(str.imput())

if S[2] == S[3]:
  if S[4] == S[5]:
    print("Yes")
  else:
    print("No")
else:
  print("No")


Fixed submission:
S = list(input())

if S[2] == S[3]:
  if S[4] == S[5]:
    print("Yes")
  else:
    print("No")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
def calc():
    ans = r + g + b
    
    if ans%4 == 0:
        return "YES"
    
    else:
        return "NO"
 
r, g, b = list(map(int, input()))
print(calc)


Fixed submission:
def calc():
    ans = (r*100 + g*10 + b)
    
    if ans%4 == 0:
        return "YES"
    
    else:
        return "NO"
 
r, g, b = map(int, input().split())
print(calc())

Buggy python submission (verdict: Runtime Error):
def calc():
    ans = r + g + b
    
    if ans%4 == 0:
        return "YES"
    
    else:
        return "NO"

r, g, b = input list(map(int, input()))
print(calc)

Fixed submission:
def calc():
    ans = (r*100 + g*10 + b)
    
    if ans%4 == 0:
        return "YES"
    
    else:
        return "NO"
 
r, g, b = map(int, input().split())
print(calc())
Buggy python submission (verdict: Runtime Error):
2*5=10
100*100=10000

Fixed submission:
a,b = map(int,input(). split ())
print(a*b)
Buggy python submission (verdict: Time Limit Exceeded):
import functools
import math

a,b = input().split()


def divisor(n): #nの約数を全て求める
    i = 1
    table = []
    while i * i <= n:
        if n%i == 0:
            table.append(i)
            table.append(n//i)
        i += 1
    table = list(set(table))
    return table

a = divisor(int(a))
b = divisor(int(b))
ans_list = list(set(a) & set(b))

# print(ans_list)
an = 0

for i in range(len(ans_list)):
    hantei = []
    hantei = divisor(ans_list[i])
#     print(hantei)
    if len(hantei) == 2 or len(hantei) == 1:
#         print("1")
        an += 1
print(an)

Fixed submission:
import functools
import math

a,b = input().split()


def divisor(n): #nの約数を全て求める
    i = 1
    table = []
    while i * i <= n:
        if n%i == 0:
            table.append(i)
            table.append(n//i)
        i += 1
    table = list(set(table))
    return table

def is_prime(n):
    if n == 1:
        return False
    for i in range(2,int(n**0.5)+1):
        if n % i == 0:
            return False
    return True

a = divisor(int(a))
b = divisor(int(b))
ans_list = list(set(a) & set(b))

# print(ans_list)
an = 1

for i in range(len(ans_list)):
    if is_prime(ans_list[i]):
#         print(ans_list[i])
        an += 1

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

if s == "Sunny":
  return "Cloudy"
elif s == "Cloudy":
  return "Rainy"
elif s == "Rainy":
  return "Sunny"

Fixed submission:
s = input()

if s == "Sunny":
  print("Cloudy")
elif s == "Cloudy":
  print("Rainy")
elif s == "Rainy":
  print("Sunny")
Buggy python submission (verdict: Runtime Error):
import collections
N,K,Q = map(int,input().split())

A=[]
for i in range(Q):
    A.append(int(input()))
    
jud = Q - K

ans_list = [0] * N

c = collections.Counter(A)
key = list(c.keys())
val = list(c.values())
for i in range(len(c)):
    ans_list[key[i]] = val[i]
#print(ans_list)

for i in range(N):
    if ans_list[i] > jud:
        print("Yes")
    else:
        print("No")

Fixed submission:
import collections
N,K,Q = map(int,input().split())

A=[]
for i in range(Q):
    A.append(int(input()))
    
jud = Q - K

ans_list = [0] * N

c = collections.Counter(A)
key = list(c.keys())
val = list(c.values())
for i in range(len(c)):
  ans_list[key[i]-1] = val[i]

for i in range(len(c)):
    if val[i] > jud:
        ans_list[key[i]-1] +=1
for i in range(N):
    if ans_list[i] > jud:
        print("Yes")
    else:
        print("No")

Buggy python submission (verdict: Time Limit Exceeded):
N,K,Q = map(int,input().split())

A=[]
for i in range(Q):
    A.append(int(input()))

ans_list = [K] * N
# print(ans_list)

for i in range(Q):
    for j in range(N):
        if j != A[i]-1:
            ans_list[j] -=1
#     print(ans_list)
for i in range(N):
#     print(ans_list[i])
    if ans_list[i] > 0:
          print("Yes")
    else:
          print("No")

Fixed submission:
import collections
N,K,Q = map(int,input().split())

A=[]
for i in range(Q):
    A.append(int(input()))
    
jud = Q - K

ans_list = [0] * N

c = collections.Counter(A)
key = list(c.keys())
val = list(c.values())
for i in range(len(c)):
  ans_list[key[i]-1] = val[i]

for i in range(len(c)):
    if val[i] > jud:
        ans_list[key[i]-1] +=1
for i in range(N):
    if ans_list[i] > jud:
        print("Yes")
    else:
        print("No")

Buggy python submission (verdict: Runtime Error):
N,K,Q = map(int,input().split())

A=[]
for i in range(Q):
    A.append(int(input()))

ans_list = [K] * N

for i in range(Q):
    ans_list[A[i-1]] +=1

for i in range(N):
    if ans_list[i] > K+1:
        print("Yes")
    else:print("No")

Fixed submission:
import collections
N,K,Q = map(int,input().split())

A=[]
for i in range(Q):
    A.append(int(input()))
    
jud = Q - K

ans_list = [0] * N

c = collections.Counter(A)
key = list(c.keys())
val = list(c.values())
for i in range(len(c)):
  ans_list[key[i]-1] = val[i]

for i in range(len(c)):
    if val[i] > jud:
        ans_list[key[i]-1] +=1
for i in range(N):
    if ans_list[i] > jud:
        print("Yes")
    else:
        print("No")
Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
A = [-1*int(i) for i in input().split()]

# import heapq
# print(A)
heapq.heapify(A)
# print(A)
for _ in range(M):
    a = heapq.heappop(A)
#     print( "aaa",a)
    heapq.heappush(A,-1*((-1*a)//2))
#     print("AAA",A)
    
# print("list",A)

print(-1*sum(A))


Fixed submission:
N, M = map(int, input().split())
A = [-1*int(i) for i in input().split()]

import heapq
# print(A)
heapq.heapify(A)
# print(A)
for _ in range(M):
    a = heapq.heappop(A)
#     print( "aaa",a)
    heapq.heappush(A,-1*((-1*a)//2))
#     print("AAA",A)
    
# print("list",A)

print(-1*sum(A))
Buggy python submission (verdict: Runtime Error):
n = input()

print(n**3)

Fixed submission:
n = int(input())

print(n**3)

Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
S = input()

dup = 0
for i in range(1,N):
    if S[i] == S[i-1]:
        dup += 1
#print(min(N-1, dup + K*2))
print(min(N-1,dup + K * 2))

Fixed submission:
n = int(input())

print(n**3)
Buggy python submission (verdict: Runtime Error):
n  = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = list(map(int,input().split()))

ans = 0

for i in range(n):
      #print(i)
      ans += b[a[i]-1]
      #print("ans",ans)
  #print("aaa",a[i])
      if i != 0:
        hantei = a[i-1] + 1
        if a[i] == hantei:
            ans += c[i]
    
print(ans)

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

ans = 0

for i in range(n):
      #print(i)
      ans += b[a[i]-1]
      #print("ans",ans)
  #print("aaa",a[i])
      if i != 0:
        hantei = a[i-1] + 1
        if a[i] == hantei:
          ans += c[a[i]-2]
    
print(ans)

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

ans = 0

for i in range(n):
    ans += b[a[i]]
    if a[i]+1 == a[i+1]:
        ans += c[i]
        
print(ans)

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

ans = 0

for i in range(n):
      #print(i)
      ans += b[a[i]-1]
      #print("ans",ans)
  #print("aaa",a[i])
      if i != 0:
        hantei = a[i-1] + 1
        if a[i] == hantei:
          ans += c[a[i]-2]
    
print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(input())
b = list(map(int,input().split()))
ans=[0] * n
ans[0] = b[0]
ans[1] = b[0]
ans1 = 0

for i in range(1,n-1):
  if i == n-2:
    ans1 += b[i]
    break
  if b[i] >= max([ans[i],ans[i+1]]):
    ans += min([b[i],b[i+1]])

print(sum(ans) + ans1)
  

Fixed submission:
n=int(input())
b=[int(i) for i in input().split()]
ans=b[-1]+b[0]
for i,j in zip(b[:-1],b[1:]):
  ans+=min(i,j)
print(ans)
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
aaa = 0
c = 1
while c < b:
    c += a
    aaa += 1
        
print(aaa)


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

count = 0
for i in range(len(s)):
    if s[i] == t[i]:
        count += 1
        
print(count)

Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
res = 0
c = 1
while c < b:
  c += a
  res += 1
        
print(res)


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

count = 0
for i in range(len(s)):
    if s[i] == t[i]:
        count += 1
        
print(count)

Buggy python submission (verdict: Runtime Error):
n = int(input())
ans = (n * (n + 1) // 2) - n
#ans = int(a)
print(ans)

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

count = 0
for i in range(len(s)):
    if s[i] == t[i]:
        count += 1
        
print(count)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = (n * (n + 1) / 2) - n
ans = int(a)
print(ans)

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

count = 0
for i in range(len(s)):
    if s[i] == t[i]:
        count += 1
        
print(count)

Buggy python submission (verdict: Runtime Error):
n = int(input())
ans = (n * (n + 1) / 2) - n
print(int(ans))

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

count = 0
for i in range(len(s)):
    if s[i] == t[i]:
        count += 1
        
print(count)
Buggy python submission (verdict: Runtime Error):
n = int(input())
h = [list(map(int,input().split()))]
ans = 0
h = h[0]

for i in range(n-1):
    if h[i] >= h[i+1]:
        ans += 1
        max_ans = ans
    elif h[i] <h[i+1]:
        if ans != 0:
            max_ans = ans
        ans = 0
print(max_ans)
    

Fixed submission:
n = int(input())
h = [list(map(int,input().split()))]
ans = 0
h = h[0]
max_ans = 0

for i in range(n-1):
    if h[i] >= h[i+1]:
        ans += 1
        if max_ans < ans:
            max_ans = ans
    elif h[i] < h[i+1]:
        if ans != 0:
          if max_ans < ans:
            max_ans = ans
        ans = 0
print(max_ans)
Buggy python submission (verdict: Runtime Error):
import numpy as np

n = int(input())

n_list =np.arange(1,n+1)
# print(n_list)
ans = np.sum(n_list)- n_list[-1]
print(ans)

Fixed submission:
n = int(input())
print(n*(n-1)//2)
Buggy python submission (verdict: Runtime Error):
import numpy as np

n,q = map(int,input().split())
ab = [list(map(int,input().split())) for _ in range(n+q-1)]

matrix = np.zeros((n,n))
ans = np.zeros((n,n))

for i in range(n-1):
  matrix[ab[i][0]-1,ab[i][1]-1] = 1
#  matrix[ab[i][1]-1,ab[i][0]-1] = 1

for l in range(n):
  for m in range(n):
    if matrix[l][m]:
      for o in range(n):
        if matrix[m][o]:
          matrix[l][o] = 1
          
ans = np.zeros((n))

for j in range(n-1,n+q-1):
  ans[ab[j][0]-1] += ab[j][1]
  for k in range(n):
    if matrix[ab[j][0]-1][k] == 1:
      ans[k] += ab[j][1]
  

for p in range(n):
  print(int(ans[p]))

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


if(a >= 3200):
    ans = s
else:
    ans = 'red'
    
print(ans)
Buggy python submission (verdict: Runtime Error):
k,x = map(int,input().split())

for i in range(x-k-1,x+k-1)
	print(i)

Fixed submission:
import numpy as np
k,x = map(int,input().split())

result = np.arange(x-k+1,x+k,1,dtype = 'int')

for i in range(len(result)):
    print(result[i],end = " ")

Buggy python submission (verdict: Runtime Error):
import numpy as np
k,x = map(int,input().split())

result = np.linspace(x-k+1,x+k-1,k*2-1,dtype = 'int')

for i in range(k*2-1):
    print(str(result[i]),end = " ")

Fixed submission:
import numpy as np
k,x = map(int,input().split())

result = np.arange(x-k+1,x+k,1,dtype = 'int')

for i in range(len(result)):
    print(result[i],end = " ")

Buggy python submission (verdict: Runtime Error):
import numpy as np
k,x = map(int,input().split())

result = np.linspace(x-k+1,x+k-1,k*2-1,dtype = 'int')

for i in range(k*2-1):
    print(str(result[i]),end = "　")

Fixed submission:
import numpy as np
k,x = map(int,input().split())

result = np.arange(x-k+1,x+k,1,dtype = 'int')

for i in range(len(result)):
    print(result[i],end = " ")

Buggy python submission (verdict: Runtime Error):
import numpy as np
k,x = map(int,input().split())

result = np.linspace(x-k+1,x+k-1,k*2-1,dtype = 'int')

for i in range(k*2-1):
    print(result[i],end = "　")

Fixed submission:
import numpy as np
k,x = map(int,input().split())

result = np.arange(x-k+1,x+k,1,dtype = 'int')

for i in range(len(result)):
    print(result[i],end = " ")

Buggy python submission (verdict: Runtime Error):
import numpy as np
k,x = map(int,input().split())

result = np.linspace(x-k+1,x+k-1,k*2-1,dtype = 'int')

for i in range(k*2-1):
    print(result[i],end = " ")

Fixed submission:
import numpy as np
k,x = map(int,input().split())

result = np.arange(x-k+1,x+k,1,dtype = 'int')

for i in range(len(result)):
    print(result[i],end = " ")

Buggy python submission (verdict: Runtime Error):
import numpy as np
k,x = map(int,input().split())

result = np.linspace(x-k+1,x+k-1,k*2-1,dtype = 'int')
print(result)

Fixed submission:
import numpy as np
k,x = map(int,input().split())

result = np.arange(x-k+1,x+k,1,dtype = 'int')

for i in range(len(result)):
    print(result[i],end = " ")
Buggy python submission (verdict: Runtime Error):
n = str(input())

N = int(len(n))
result = 0

if N == 1:
    result = n
elif N % 2 != 0:
    result += (int(n) - (10 ** (N-1))) + 1
    count = 0
    for i in range(N // 2):
        count += 1 
        a = "9" * count
        result += int(a)
else:
    for i in range(N // 2):
        count += 1 
        a = "9" * count
        result += int(a)

print(result)

Fixed submission:
N = int(input())
 
ans = 0
for i in range(1,N+1):
        if len(str(i))%2 == 1:
                ans += 1
 
print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(input())
h = list(map(int,input().split()))

falg = 0

for i in range(len(h) - 1):
    if h[i] < h[i+1]:
        h[i+1] -= 1
    elif h[i] > h[i+1]:
        flag = 1
        break
            
print("Yes" if flag == 0 else "No")


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

falg = 0

for i in range(n - 1):
    if h[i] < h[i+1]:
        h[i+1] -= 1
    elif h[i] > h[i+1]:
        print("No")
        exit()
            
print("Yes")

Buggy python submission (verdict: Runtime Error):
n = int(input())
h = list(map(int,input().split()))
max_h = h[0]

falg = 0

for i in range(1,n):
    
    if h[i] > max_h:
        max_h = h[i]-1
    elif h[i] < max_h:
        flag = 1
            
print("Yes" if flag == 0 else "No")


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

falg = 0

for i in range(n - 1):
    if h[i] < h[i+1]:
        h[i+1] -= 1
    elif h[i] > h[i+1]:
        print("No")
        exit()
            
print("Yes")
Buggy python submission (verdict: Runtime Error):
HW = list(map(int, input().split()))
H = HW[0]
W = HW[1]
a = []

for i in range(H):
  a.append(list(map(int, input().split())))
  
for i in range(H):
  for j in range(W):
    if a[i][j] % 2 == 1:
      if j+1 < W:
        a[i][j] -= 1
        a[i][j+1] += 1
      	print("%d %d %d %d" % (j+1, i+1, j+2, i+1))
      elif i+1 < H:
        a[i][j] -= 1
        a[i+1][j] += 1
        print("%d %d %d %d" % (j+1, i+1, j+1, i+2))


Fixed submission:
HW = list(map(int, input().split()))
H = HW[0]
W = HW[1]
a = []
ans = []

for i in range(H):
  a.append(list(map(int, input().split())))
  
for i in range(H):
  for j in range(W):
    if a[i][j] % 2 == 1:
      if j+1 < W:
        a[i][j] -= 1
        a[i][j+1] += 1
        ans.append((i, j, i, j+1))
      elif i+1 < H:
        a[i][j] -= 1
        a[i+1][j] += 1
        ans.append((i, j, i+1, j))

print(len(ans))
for (y1, x1, y2, x2) in ans:
  print("%d %d %d %d" % (y1+1, x1+1, y2+1, x2+1))
Buggy python submission (verdict: Runtime Error):
N = int(input())
As = map(int, input().split())
result = 1
 
for a in As:
  result = result * a
 
if a >= 10**18:
  print(-1)
else:
  print(result)

Fixed submission:
nums = input().split()
print(int(nums[0]) * int(nums[1]))

Buggy python submission (verdict: Runtime Error):
N = int(input())
As = map(int, input().split())
result = 1
 
for a in As:
  result *= a
 
if a >= 10**18:
  print(-1)
else:
  print(result)

Fixed submission:
nums = input().split()
print(int(nums[0]) * int(nums[1]))

Buggy python submission (verdict: Runtime Error):
nums = input().split()
print(nums[0] * nums[1])

Fixed submission:
nums = input().split()
print(int(nums[0]) * int(nums[1]))
Buggy python submission (verdict: Runtime Error):
nums = input().split()
a = int(nums[0])
b = float(nums[1])
print(int((a*(100*b))/100)

Fixed submission:
from decimal import Decimal
a, b = map(Decimal, input().split())
print(int(a*b))

Buggy python submission (verdict: Runtime Error):
nums = list(map(float, input().split()))
print(math.floor(nums[0] * nums[1]))

Fixed submission:
from decimal import Decimal
a, b = map(Decimal, input().split())
print(int(a*b))
Buggy python submission (verdict: Runtime Error):
int A,B
A=6
B=6
print(A*B)

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

Buggy python submission (verdict: Runtime Error):
A,B = map(input,input.split())
return A*B

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

Buggy python submission (verdict: Runtime Error):
A=input()
B=input()

print(int(A)*int(B))

Fixed submission:
A,B = map(int,input().split())
print(A*B)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int,input().split()))
d =1
for i in  range(n):
    d = d*a[i]
if d>(10**18):
  print(-1)
else:
  print(d)


Fixed submission:
n = int(input())
a = list(map(int,input().split()))
d =1

if 0 in a:
    print(0)
    exit()
for i in  range(n):
    d = d*a[i]
    if d>(10**18):
        print(-1)
        exit()
print(d)
Buggy python submission (verdict: Runtime Error):
num1=input()
num1=int(num1)
num2=input()
num2=int(num2)
print(num1*num2)

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

Buggy python submission (verdict: Runtime Error):
num1=input()
num1=(int)num1
num2=input()
num2=(int)num2
print(num1*num2)

Fixed submission:
a,b=input().split()
print(int(a)*int(b))
Buggy python submission (verdict: Runtime Error):
a = int(input())
print a**2

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