input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N = eval(input())
A = list(map(int, input().split()))
num = 1
for i in A:
if 0 in A:
num = 0
break
elif num > 1000000000000000000:
break
num = num*int(i)
if num > 1000000000000000000:
print((-1))
else:
print(num)
| N = eval(input())
A = list(map(int, input().split()))
newA = sorted(A,reverse=True)
num = 1
if 0 in A:
num = 0
else:
for i in newA:
if num > 1000000000000000000:
break
num = num*int(i)
if num > 1000000000000000000:
print((-1))
else:
print(num) | p02658 |
#import numpy as np
import math
n = int(eval(input()))
a= list(map(int,input().split()))
ans = a[0]
for i in range(1,n):
if a[i] == 0:
print("0")
exit()
elif a[i] > 10**18:
print("-1")
exit()
else:
ans *= a[i]
if ans > 10**18:
ans = -1
print(ans)
| #import numpy as np
import math
n = int(eval(input()))
a= list(map(int,input().split()))
a.sort(reverse=1)
ans = a[0]
for i in range(1,n):
if a[-1] == 0:
print("0")
exit()
elif a[i] > 10**18:
print("-1")
exit()
elif ans > 10**18:
print("-1")
exit()
else:
ans *= a[i]
if ans > 10**18:
ans = -1
print(ans)
| p02658 |
import sys
N=int(sys.stdin.readline())
values = []
res = 1
values=(sys.stdin.readline().split())
for v in values:
res *= int(v)
if res > 1000000000000000000:
print((-1))
else:
print(res)
| import sys
N=int(sys.stdin.readline())
values = []
res = 1
values=sys.stdin.readline().split()
for v in values:
if int(v) == 0:
print((0))
exit(0)
for v in values:
res *= int(v)
if res > 1000000000000000000:
print((-1))
exit(0)
print(res)
| p02658 |
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort(reverse = True)
sum = 1
for i in range(n):
if(0 in a):
print((0))
break
sum *= a[i]
if(sum > 10 ** 18):
print((-1))
break
else:
print(sum)
| n = int(eval(input()))
a = list(map(int, input().split()))
a.sort(reverse = True)
sum = 1
if 0 in a:
print((0))
else:
for i in range(n):
sum *= a[i]
if(sum > 10 ** 18):
print((-1))
break
else:
print(sum)
| p02658 |
import sys
n = int(sys.stdin.readline().rstrip("\n"))
l = [int(s) for s in sys.stdin.readline().rstrip("\n").split()]
s = 1
for i in l:
s *= i
if s > 10**18:
print((-1))
else:
print(s) | import sys
n = int(sys.stdin.readline().rstrip("\n"))
l = [int(s) for s in sys.stdin.readline().rstrip("\n").split()]
s = 1
if 0 in l:
print((0))
else:
for i in l:
s *= i
if s > 10**18:
print((-1))
break
else:
print(s) | p02658 |
import math
n = int(eval(input()))
A = list(map(int, input().split()))
lg = 0
for a in A:
if a == 0:
print((0))
exit()
lg += math.log10(a)
if lg > 18:
print((-1))
else:
ans = 1
for a in A:
ans *= a
if ans > 10**18:
print((-1))
else:
print(ans) | n = int(eval(input()))
A = list(map(int, input().split()))
ans = 1
if 0 in set(A):
print((0))
exit()
for a in A:
ans *= a
if ans > 10**18:
print((-1))
exit()
print(ans) | p02658 |
N = int(eval(input()))
A = list(map(int, input().split()))
lim = 10**18
ans = 1
for a in A:
ans *= a
if (ans > lim):
print("-1")
else:
print(ans)
| N = int(eval(input()))
A = list(map(int, input().split()))
A.sort(reverse=True)
lim = 10**18
if A[-1] == 0:
print("0")
exit(0)
ans = 1
for a in A:
ans *= a
if (ans > lim):
print("-1")
exit(0)
print(ans)
| p02658 |
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
m = 10 ** 18
ans = A[0]
for i in range(1, N):
ans *= A[i]
if(ans > m):
ans = -1
print(ans)
if __name__ == "__main__":
main() | def main():
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
m = 10 ** 18
ans = A[0];
if(A[0] == 0):
ans = 0;
else:
for i in range(1, N):
ans *= A[i]
if(ans > m):
ans = -1
break
print(ans)
if __name__ == "__main__":
main() | p02658 |
n = int(eval(input()))
lst = list(map(int, input().split(' ')))
ans = 1
for i in range(0, len(lst)):
ans *= lst[i]
if ans > 1000000000000000000:
print("-1")
else:
print(ans) | import sys
if __name__ == "__main__":
a = int(eval(input()))
n = list(map(int, input().strip().split(' ')))
ans = 1
n.sort()
for i in n:
ans *= i
if ans > 10**18:
break
if ans > 10**18:
print((-1))
else:
print(ans) | p02658 |
n = int(eval(input()))
a = [int(x) for x in input().split()]
prod = 1
a.sort()
for i in range(n):
if a[i] == 0:
prod = 0
break
else:
prod *= a[i]
if prod > int(1e18):
print((-1))
else:
print (prod) | N = eval(input())
A = list(map(int, input().split()))
k = 1
if 0 in A:
print((0))
else:
for i in A:
k = k * i
if k > 10 ** 18:
print((-1))
break
if k <= 10 ** 18:
print(k) | p02658 |
c = 10**18
n = int(eval(input()))
a = list(map(int, input().split()))
b = 1
for i in a:
b *= i
if b > c:
print('-1')
else:
print(b) | def main():
N = int(eval(input()))
A = list(map(int, input().split()))
if 0 in A:
print((0))
return
prod = 1
for a in A:
prod *= a
if prod > 1000000000000000000:
print((-1))
return
print(prod)
main() | p02658 |
n = int(eval(input()))
a = list(map(int,input().split()))
ans = 1
ok = True
for i in a:
ans *= i
if ans > 1000000000000000000:
ok = False
if i == 0:
print((0))
exit()
if ok:
print(ans)
else:
print((-1)) | n = int(eval(input()))
a = list(map(int,input().split()))
ans = 1
ok = True
for i in a:
if ok == True:
ans *= i
if ans > 1000000000000000000:
ok = False
if i == 0:
print((0))
exit()
if ok:
print(ans)
else:
print((-1)) | p02658 |
N = int(eval(input()))
A = list(map(int, input().split()))
if 0 in A:
ans = 0
else:
ans = 1
for i in range(N):
ans *= A[i]
if ans > 10**18:
ans = -1
print(ans) | N = int(eval(input()))
A = list(map(int, input().split()))
if 0 in A:
ans = 0
else:
ans = 1
for i in range(N):
ans *= A[i]
if ans > 10**18:
ans = -1
break
print(ans) | p02658 |
N = int(eval(input()))
a = list(map(int,(input().split())))
ans = 1
for i in range(N):
ans *= a[i]
if ans > 10**18:
print((-1))
else:
print(ans) | N = int(eval(input()))
a = list(map(int,(input().split())))
ans = 1
if 0 in a:
print((0))
else:
for i in range(N):
ans *= a[i]
if ans > 10**18:
print((-1))
break
else:
print(ans) | p02658 |
inp = int(eval(input()))
lst = list(map(int,input().split()))
sum = 1
for i in lst:
sum *= i
if sum <= 1e18:
print(sum)
else:
print((-1)) | import sys
inp = int(eval(input()))
lst = list(map(int,input().split()))
sum = 1
if 0 in lst:
print((0))
sys.exit(0)
else:
num = 1;
for i in range(inp):
num *= lst[i]
if num > 10 ** 18:
print("-1")
sys.exit()
print(num) | p02658 |
N = int(eval(input()))
line = list(map(int,input().split()))
if line.count(0) > 0:
a = 0
elif line.count(10**18) > 0:
a = -1
else:
a = line[0]
for i in range(len(line)):
if i == 0:
pass
else:
a = a * line[i]
if a > 10**18:
a = -1
break
print(a) | N = int(eval(input()))
line = list(map(int,input().split()))
if 0 in line:
a = 0
else:
a = 1
for ele in line:
if ele >= 10**18:
a = -1
break
a = a * ele
if a > 10**18:
a = -1
break
print(a) | p02658 |
N = int(eval(input()))
line = list(map(int,input().split()))
if 0 in line:
a = 0
else:
a = 1
for ele in line:
if ele >= 10**18:
a = -1
break
a = a * ele
if a > 10**18:
a = -1
break
print(a) | N = int(eval(input()))
line = list(map(int,input().split()))
if 0 in line:
a = 0
else:
a = 1
for ele in line:
a *= ele
if a > 10**18:
a = -1
break
print(a) | p02658 |
def main():
MAX = 1_000_000_000_000_000_000
n = int(eval(input()))
nums = [int(_x) for _x in input().split()]
result = 1
for num in nums:
result = result * num
if result > MAX:
print((-1))
else:
print(result)
main()
|
def main():
MAX = 1_000_000_000_000_000_000
n = int(eval(input()))
nums = [int(_x) for _x in input().split()]
if 0 in nums:
print((0))
return
result = 1
for num in nums:
result = result * num
if result > MAX:
print((-1))
return
print(result)
main()
| p02658 |
N = int(eval(input()))
A = list(map(int, input().split()))
j = 1
for i in A:
j = i * j
if j > 10**18:
print((-1))
else:
print(j) | N = int(eval(input()))
A = sorted(list(map(int, input().split())), )
j = 1
if A[0] == 0:
print((0))
exit()
for i in A:
j = i * j
if j > 10**18:
print((-1))
exit()
if j > 10**18:
print((-1))
else:
print(j) | p02658 |
n=int(eval(input()))
arr=list(map(int, input().split()))
mul=1
done=False
for i in range(len(arr)):
mul*=arr[i]
if mul>int(1e18):
print("-1")
else:
print(mul) | n=int(eval(input()))
arr=list(map(int, input().split()))
if 0 in arr:
print("0")
else:
done=False
mul=1
for i in range(len(arr)):
if mul*arr[i]<=int(1e18):
mul*=arr[i]
else:
print("-1")
done=True
break
if not done:
print(mul)
| p02658 |
n=int(eval(input()))
a=list(map(int,input().split()))
ans=1
for i in a:
ans*=i
if ans>10**18:
ans=-1
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
ans=1
flag=True
if 0 in a:
ans=0
flag=False
if flag:
for i in a:
#print(ans)
ans*=i
if ans>10**18:
ans=-1
break
print(ans) | p02658 |
N=int(eval(input()))
A=list(map(int,input().split()))
ans=1
for i in range(N):
ans=ans*A[i]
if ans>1e+18:
print((-1))
else:
print(ans) | N=int(eval(input()))
A=list(map(int,input().split()))
ans=1
for i in range(N):
if (A[i]==0):
ans=0
if (ans!=0):
for i in range(N):
ans=ans*A[i]
if ans>1e+18:
ans=-1
break
print(ans) | p02658 |
n=int(eval(input()))
a=list(map(int,input().split()))
b=1
flag=1
for i in range(n):
b*=a[i]
if(0 in a):
flag=2
break
if(b>10**18):
flag=0
break
if(flag==0):
print((-1))
if(flag==1):
print(b)
if(flag==2):
print((0)) | n=int(eval(input()))
a=list(map(int,input().split()))
b=1
flag=-1
for i in range(n):
b*=a[i]
if(flag==-1):
flag=1
if(0 in a):
flag=2
break
if(b>10**18):
flag=0
break
if(flag==0):
print((-1))
if(flag==1):
print(b)
if(flag==2):
print((0)) | p02658 |
N = int(eval(input()))
s = list(map(int, input().split()))
result = 1
for value in s:
result *= value
if result > pow (10,18):
print((-1))
else:
print(result)
| import sys
N = int(eval(input()))
s = list(map(int, input().split()))
if 0 in s:
print((0))
sys.exit()
result = 1
for value in s:
result *= value
if result > pow (10,18):
print((-1))
sys.exit()
print(result)
| p02658 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = a[0]
for i in range(1, n):
ans *= a[i]
if(ans > 1000000000000000000):
print((-1))
else:
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
ans = a[0]
if(0 in a):
print((0))
exit()
for i in range(1, n):
ans *= a[i]
if(ans > 1000000000000000000):
print((-1))
exit()
print(ans)
| p02658 |
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline().strip()
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]
# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
return [ int(input()) for _ in range(n)]
# 改行またはスペース区切りの入力をすべて読み込んでイテレータを返します。
def get_all_int():
return map(int, open(0).read().split())
def rangeI(it, l, r):
for i, e in enumerate(it):
if l <= i < r:
yield e
elif l >= r:
break
def log(*args):
print("DEBUG:", *args, file=sys.stderr)
INF = 999999999999999999999999
MOD = 10**9+7
n,*A = get_all_int()
ans = 1
for a in A:
ans *= a
print(ans if ans <= 10**18 else -1)
| import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline().strip()
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]
# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
return [ int(input()) for _ in range(n)]
# 改行またはスペース区切りの入力をすべて読み込んでイテレータを返します。
def get_all_int():
return map(int, open(0).read().split())
def rangeI(it, l, r):
for i, e in enumerate(it):
if l <= i < r:
yield e
elif l >= r:
break
def log(*args):
print("DEBUG:", *args, file=sys.stderr)
INF = 999999999999999999999999
MOD = 10**9+7
n,*A = get_all_int()
if min(A) == 0:
print(0)
exit()
ans = 1
for a in A:
ans *= a
if ans > 10**18:
print(-1)
exit()
print(ans)
| p02658 |
n = int(eval(input()))
a_list = list(map(int, input().split()))
ans = 1
for i in a_list:
ans *= i
if ans > pow(10,18):
print((-1))
else:
print(ans) | n = int(eval(input()))
a_list = list(map(int, input().split()))
ans = 1
for i in a_list:
ans *= i
if ans > 1000000000000000000:
break
if ans > 1000000000000000000 and 0 not in a_list:
print("-1")
elif 0 in a_list:
print((0))
else:
print(ans) | p02658 |
#B
N = int(eval(input()))
A = list(sorted(map(int,input().split())))
ans=1
if A[0]==0:
print((0))
else:
for i in A:
ans*=i
if ans > 10**18:
print((-1))
else:
print(ans) | #B
N = int(eval(input()))
A = list(sorted(map(int,input().split())))
ans=1
if A[0]==0:
print((0))
else:
for i in A:
ans*=i
if ans > 10**18:
ans =-1
break
print(ans) | p02658 |
n = int(eval(input()))
a = list(map(int,input().split()))
ans = 1
if 0 in a :
ans = 0
else:
for i in a :
ans *= i
if ans > 10**18:
print((-1))
else:
print(ans) | n = int(eval(input()))
a = list(map(int,input().split()))
ans = 1
if 0 in a :
ans = 0
print((0))
else:
for i in a :
ans *= i
if ans > 10**18:
print((-1))
break
else:
print(ans) | p02658 |
from math import *
def cin(): # To take limited number of inputs
return map(int,input().split())
def cins(): # To take space sepreated strings
return input.split()
def cino(test=False): # To take individual int input (test = False)
if not test:
return int(input())
else: # To take string input (test = True)
return input()
def cina(): # array input
return list(map(int,input().split()))
def ssplit(): # multiple string input
return list(input().split())
def printlist(l): # To print space seperated array
for i in l:
print(i,end=" ")
def main():
a = cino()
l = cina()
ans = prod(l)
# print(ans)
if ans>1000000000000000000:
print(-1)
else:
print(ans)
if __name__ == '__main__':
main()
| from math import *
def cin(): # To take limited number of inputs
return map(int,input().split())
def cins(): # To take space sepreated strings
return input.split()
def cino(test=False): # To take individual int input (test = False)
if not test:
return int(input())
else: # To take string input (test = True)
return input()
def cina(): # array input
return list(map(int,input().split()))
def ssplit(): # multiple string input
return list(input().split())
def printlist(l): # To print space seperated array
for i in l:
print(i,end=" ")
def main():
a = cino()
l = cina()
check = True
suma = 1
l.sort()
if l[0]==0:
print(0)
else:
for i in l:
suma = suma*i
if suma>1000000000000000000:
check = False
break
if check:
print(suma)
else:
print(-1)
if __name__ == '__main__':
main()
| p02658 |
n = int(eval(input()))
arr = list(map(int, input().split()))
ans = 1
for i in arr:
ans *= i
if ans > 1000000000000000000:
print((-1))
else:
print(ans) | n = int(eval(input()))
arr = list(map(int, input().split()))
ans = 1
f = 0
arr.sort()
for i in arr:
ans *= i
if ans > 1e18:
f = 1
print((-1))
break
if f == 0:
print(ans) | p02658 |
n=int(eval(input()))
t = list(map(int,input().split()))
ans = 1
for i in t:
ans *= i
if 10**18 < ans:
print((-1))
else:
print(ans) | n=int(eval(input()))
t = list(map(int,input().split()))
t.sort()
ans = 1
for i in t:
ans *= i
if 10**18 < ans:
print((-1))
exit()
print(ans) | p02658 |
n = int(eval(input()))
a = [int(x) for x in input().split()]
p = 1
for e in a:
if a == 0:
print((0))
exit()
p *= e
if p > 10**18:
print((-1))
else:
print(p) | N = int(eval(input()))
A = list(map(int,input(). split ()))
max = 10**18
if 0 in A:
print((0))
exit()
prod = 1
for a in A:
prod *= a
if prod > max:
print((-1))
exit()
print(prod)
| p02658 |
ans = 1
n = eval(input())
n = int(n)
nums = input().split()
for i in range(n):
mul = int(nums[i])
ans = ans * mul
if ans > 10**18:
print((-1))
else:
print(ans) | ans = 1
n = eval(input())
n = int(n)
nums = input().split()
for i in range(n):
mul = int(nums[i])
if mul == 0:
print((0))
exit()
for i in range(n):
mul = int(nums[i])
ans = ans * mul
if ans > 10**18:
print((-1))
exit()
if ans > 10**18:
print((-1))
else:
print(ans)
exit() | p02658 |
def main():
n = int(eval(input()))
a = list(map(int,input().split()))
inf = 10**18
res = a[0]
for i in range(1,n):
res *= a[i]
if res > inf:
print((-1))
return 0
else:
print(res)
if __name__ == '__main__':
main()
| def main():
n = int(eval(input()))
a = sorted(list(map(int,input().split())),reverse=True)
inf = 10**18
res = a[0]
if 0 in a:
print((0))
return 0
for i in range(1,n):
res *= a[i]
if res > inf:
print((-1))
return 0
if res > inf:
print((-1))
return 0
else:
print(res)
if __name__ == '__main__':
main()
| p02658 |
N = int(eval(input()))
A = list(map(int, input().split()))
m = 1
for a in A:
m *= a
print((m if m <= 10**18 else -1)) | N = int(eval(input()))
A = list(map(int, input().split()))
m = 1
for a in A:
m *= a
if m > 10**18:
break
if min(A) == 0:
m = 0
print((m if m <= 10**18 else -1)) | p02658 |
eval(input())
ans = 1
for a in map(int, input().split()):
ans *= a
print((ans if ans <= 10**18 else -1)) | import sys
eval(input())
A = list(map(int, input().split()))
ans = 1
if 0 in A:
print((0))
sys.exit()
else:
for a in A:
ans *= a
if ans > 10**18:
print((-1))
sys.exit()
print(ans) | p02658 |
n = eval(input())
nums = list(map(int, input().split(' ')))
result = 1
for i in nums:
result *= i
if result > 10**18:
print((-1))
else:
print(result) | n = eval(input())
nums = list(map(int, input().split(' ')))
nums.sort()
result = 1
for i in nums:
result *= i
if result > 10**18:
result = -1
break
if result == 0:
break
print(result) | p02658 |
eval(input())
ls = list(map(int, input().split(' ')))
result = 1
for i in ls:
result *= i
if result > 10 ** 18:
print((-1))
else:
print(result) | eval(input())
ls = list(map(int, input().split(' ')))
ls.sort(reverse=True)
def main(ls):
if ls.count(0) > 0:
print((0))
return
result = 1
for i in ls:
result *= i
if result > 10 ** 18:
print((-1))
return
print(result)
main(ls) | p02658 |
eval(input())
ls = list(map(int, input().split(' ')))
ls.sort(reverse=True)
def main(ls):
if ls.count(0) > 0:
print((0))
return
result = 1
for i in ls:
result *= i
if result > 10 ** 18:
print((-1))
return
print(result)
main(ls) | eval(input())
ls = list(map(int, input().split(' ')))
if ls.count(0) > 0:
result = 0
else:
result = 1
for i in ls:
result *= i
if result > 10 ** 18:
result = -1
break
print(result) | p02658 |
import math
n = int(eval(input()))
ls = list(map(int, input().split()))
ans = math.prod(ls)
if ans > 10**18:
print((-1))
else:
print(ans)
| n = int(eval(input()))
num = list(map(int, input().split()))
ans = 1
if 0 in num:
print((0))
exit()
else:
for i in num:
ans *= i
if ans > 10**18:
print((-1))
exit()
print(ans)
| p02658 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 1
if 0 in a:
print((0))
sys.exit()
for i in a:
ans *= i
if ans > 10**18:
ans = -1
print(ans) | import sys
input = sys.stdin.readline
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 1
if 0 in a:
print((0))
sys.exit(0)
for i in a:
ans *= i
if ans > 10**18:
print((-1))
sys.exit(0)
print(ans) | p02658 |
import functools
import operator
n = eval(input())
li = list(map(int, input().split()))
result = functools.reduce(operator.mul, li)
if result > 10 ** 18:
print((-1))
else:
print(result) | n = int(eval(input()))
li = list(map(int, input().split()))
if 0 in li:
print((0))
else:
result = 1
flag = True
for i in range(n):
result *= li[i]
if result > 10 ** 18:
flag = False
print((-1))
break
if flag == True:
print(result) | p02658 |
N = int(eval(input()))
A = list(map(int,input().split()))
result = 1
for a in A:
result *= a
if result > 1e18:
print((-1))
else:
print(result) | N = int(eval(input()))
A = sorted(list(map(int,input().split())))
if A[0] == 0:
print((0))
quit()
result = 1
for a in A:
result *= a
if result > 1e18:
print((-1))
quit()
print(result) | p02658 |
n=int(eval(input()))
a=list(map(int, input().split()))
sum=1
for i in a:
sum*=i
if sum > 10**18:
sum = -1
print(sum)
| n=int(eval(input()))
a=list(map(int, input().split()))
sum=1
for i in a:
sum*=i
if sum > 10**18:
if 0 in a:
sum = 0
break
else:
sum = -1
break
print(sum)
| p02658 |
from operator import mul
from functools import reduce
N=int(eval(input()))
li = list(map(int,input().split()))
if reduce(mul, li)<=10**18:
print((reduce(mul, li)))
else:
print("-1") | n = int(eval(input()))
As = list(map(int, input().split()))
result = As[0]
if 0 in As:
print((0))
else:
for i in range(n-1):
result = result*As[i+1]
if result > 10**18 :
print((-1))
break
else:
continue
if result <= 10**18 :
print(result) | p02658 |
n=int(eval(input()))
a = list(map(int, input().split())) #
ans=1
for i in range(n):
ans=ans*a[i]
if ans>10**18:
print((-1))
else:
print(ans) | n=int(eval(input()))
a = list(map(int, input().split())) #
ans=1
for i in range(n):
if a[i]==0:
print((0))
exit()
for i in range(n):
if a[i]*ans>10**18:
print((-1))
exit()
else:
ans=ans*a[i]
print(ans) | p02658 |
# cook your dish here
num = int(eval(input()))
arr = list(map(int,input().split(" ")));
maxi = 1000000000000000000
val = 1;
for i in arr:
val = val*i;
if val>maxi:
print("-1")
else:
print(val)
| # cook your dish here
num = int(eval(input()))
arr = list(map(int,input().split(" ")));
maxi = 1000000000000000000
val = 1;
arr.sort()
if arr[0]==0:
print((0))
else:
for i in arr:
val = val*i;
if val>maxi:
val = -1
break
print(val)
| p02658 |
eval(input())
A = list(map(int, input().split()))
ans = 1
for a in A:
ans *= a
if 1000000000000000000 < ans:
print((-1))
else:
print(ans) | eval(input())
A = list(map(int, input().split()))
ans = 1
if 0 in A:
print((0))
exit()
for a in A:
ans *= a
if 1000000000000000000 < ans:
print((-1))
exit()
print(ans)
| p02658 |
N = int(eval(input()))
A = list(map(int,input().split()))
result = 1
for i in A:
result *= i
if result > 1000000000000000000:
print((-1))
else:
print(result) | def main():
N = int(eval(input()))
A = list(map(int,input().split()))
result = 1
if 0 in A:
print((0))
return
for i in A:
result *= i
if result > 10**18:
print((-1))
return
print(result)
main()
| p02658 |
import sys
N = int(eval(input()))
l = list(map(int, input().split()))
def solve():
if 0 in l:
return (0)
sys.exit()
x = 1
for i in range(N):
x = x * l[i]
if x > (1000000000000000000):
x = -1
return str(x)
else:
return str(x)
print((solve())) | import sys
N = int(eval(input()))
l = list(map(int, input().split()))
def solve():
if 0 in l:
return (0)
sys.exit()
x = 1
for i in range(N):
x = x * l[i]
if x > (1000000000000000000):
x = -1
break
return str(x)
print((solve())) | p02658 |
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list([int(x)-1 for x in input().split()])
def II(): return int(eval(input()))
def IF(): return float(eval(input()))
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float("INF")
#solve
def solve():
n = II()
a = LI()
ans = 1
for ai in a:
ans *= ai
if ans > 10 ** 18:
print((-1))
else:
print(ans)
return
#main
if __name__ == '__main__':
solve()
| #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list([int(x)-1 for x in input().split()])
def II(): return int(eval(input()))
def IF(): return float(eval(input()))
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float("INF")
#solve
def solve():
n = II()
a = LI()
a.sort()
ans = 1
for ai in a:
ans *= ai
if ans > 10 ** 18:
print((-1))
return
print(ans)
return
#main
if __name__ == '__main__':
solve()
| p02658 |
import operator
from functools import reduce
N = int(eval(input()))
A = input().split()
length = len(A)
list = []
for num in range(length):
list.append(int(A[num]))
result = reduce(operator.mul, list, 1)
max = 10**18
if result <= max:
print(result)
else:
print("-1") | n=int(eval(input()))
arr=list(map(int,input().split()))
arr=sorted(arr) #配列を昇順ソートしておく(配列に0がある場合0が先頭に来るので、場合分けの必要がなくなる)
ans=1
for val in arr:
ans*=val #Pythonは多倍長整数をサポートしているので単に積を求めれば十分
if ans>10**18:
print((-1))
break
else:
print(ans) | p02658 |
n=int(eval(input()))
arr=list(map(int,input().split()))
arr=sorted(arr) #配列を昇順ソートしておく(配列に0がある場合0が先頭に来るので、場合分けの必要がなくなる)
ans=1
for val in arr:
ans*=val #Pythonは多倍長整数をサポートしているので単に積を求めれば十分
if ans>10**18:
print((-1))
break
else:
print(ans) | N = int(eval(input()))
A = list(map(int, input().split()))
A = sorted(A)
result=1
max=10**18
for a in A:
result *= a
if result>max:
print((-1))
break
else:
print(result) | p02658 |
n = int(eval(input()))
d = list(map(int, input().split()))
a = 1
flag = False
for i in range(n):
a *= d[i]
if a > 10**18:
print((-1))
else:
print(a) | n = int(eval(input()))
d = list(map(int, input().split()))
c_nega = 0
flag = False
for i in range(n):
if d[i] == 0:
flag = True
break
if flag:
print((0))
else:
a = 1
for i in range(n):
a *= d[i]
if a > 10**18:
flag = True
break
if flag:
print((-1))
else:
print(a) | p02658 |
N = eval(input())
A = list(map(int, input().split()))
answer = 1
if 0 in A:
print((0))
else:
for i in A:
answer *= i
if answer > 10**18:
print((-1))
else:
print(answer) | N = eval(input())
A = list(map(int, input().split()))
answer = 1
if 0 in A:
print((0))
else:
for i in A:
answer *= i
if answer > 10**18:
answer = -1
break
print(answer) | p02658 |
from functools import reduce
from operator import mul
N = int(eval(input()))
a = list(map(int,input().split()))
ans = reduce(mul, a)
if ans > 10 ** 18:
print((-1))
else:
print(ans) | N = int(eval(input()))
A = list(map(int,input().split()))
A.sort()
A.reverse()
if A.count(0) > 0:
print((0))
else:
ans = A[0]
flag = 0
for i in range(1,N):
ans *= A[i]
if ans > 10 ** 18:
print((-1))
flag += 1
break
if flag == 0:
print(ans) | p02658 |
import sys
import heapq
import re
from itertools import permutations
from bisect import bisect_left, bisect_right
from collections import Counter, deque
from math import factorial, sqrt, ceil, gcd
from functools import lru_cache, reduce
INF = 1 << 60
MOD = 1000000007
sys.setrecursionlimit(10 ** 7)
# UnionFind
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()}
def __str__(self):
return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
# ダイクストラ
def dijkstra_heap(s, edge, n):
#始点sから各頂点への最短距離
d = [10**20] * n
used = [True] * n #True:未確定
d[s] = 0
used[s] = False
edgelist = []
for a,b in edge[s]:
heapq.heappush(edgelist,a*(10**6)+b)
while len(edgelist):
minedge = heapq.heappop(edgelist)
#まだ使われてない頂点の中から最小の距離のものを探す
if not used[minedge%(10**6)]:
continue
v = minedge%(10**6)
d[v] = minedge//(10**6)
used[v] = False
for e in edge[v]:
if used[e[1]]:
heapq.heappush(edgelist,(e[0]+d[v])*(10**6)+e[1])
return d
# 素因数分解
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr.append([n, 1])
return arr
# 2数の最小公倍数
def lcm(x, y):
return (x * y) // gcd(x, y)
# リストの要素の最小公倍数
def lcm_list(numbers):
return reduce(lcm, numbers, 1)
# リストの要素の最大公約数
def gcd_list(numbers):
return reduce(gcd, numbers)
# 素数判定
def is_prime(n):
if n <= 1:
return False
p = 2
while True:
if p ** 2 > n:
break
if n % p == 0:
return False
p += 1
return True
# limit以下の素数を列挙
def eratosthenes(limit):
A = [i for i in range(2, limit+1)]
P = []
while True:
prime = min(A)
if prime > sqrt(limit):
break
P.append(prime)
i = 0
while i < len(A):
if A[i] % prime == 0:
A.pop(i)
continue
i += 1
for a in A:
P.append(a)
return P
# 同じものを含む順列
def permutation_with_duplicates(L):
if L == []:
return [[]]
else:
ret = []
# set（集合）型で重複を削除、ソート
S = sorted(set(L))
for i in S:
data = L[:]
data.remove(i)
for j in permutation_with_duplicates(data):
ret.append([i] + j)
return ret
# ここから書き始める
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 1
for i in a:
ans *= i
if ans > 10 ** 18:
print((-1))
else:
print(ans) | import sys
import heapq
import re
from itertools import permutations
from bisect import bisect_left, bisect_right
from collections import Counter, deque
from math import factorial, sqrt, ceil, gcd
from functools import lru_cache, reduce
INF = 1 << 60
MOD = 1000000007
sys.setrecursionlimit(10 ** 7)
# UnionFind
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()}
def __str__(self):
return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
# ダイクストラ
def dijkstra_heap(s, edge, n):
#始点sから各頂点への最短距離
d = [10**20] * n
used = [True] * n #True:未確定
d[s] = 0
used[s] = False
edgelist = []
for a,b in edge[s]:
heapq.heappush(edgelist,a*(10**6)+b)
while len(edgelist):
minedge = heapq.heappop(edgelist)
#まだ使われてない頂点の中から最小の距離のものを探す
if not used[minedge%(10**6)]:
continue
v = minedge%(10**6)
d[v] = minedge//(10**6)
used[v] = False
for e in edge[v]:
if used[e[1]]:
heapq.heappush(edgelist,(e[0]+d[v])*(10**6)+e[1])
return d
# 素因数分解
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr.append([n, 1])
return arr
# 2数の最小公倍数
def lcm(x, y):
return (x * y) // gcd(x, y)
# リストの要素の最小公倍数
def lcm_list(numbers):
return reduce(lcm, numbers, 1)
# リストの要素の最大公約数
def gcd_list(numbers):
return reduce(gcd, numbers)
# 素数判定
def is_prime(n):
if n <= 1:
return False
p = 2
while True:
if p ** 2 > n:
break
if n % p == 0:
return False
p += 1
return True
# limit以下の素数を列挙
def eratosthenes(limit):
A = [i for i in range(2, limit+1)]
P = []
while True:
prime = min(A)
if prime > sqrt(limit):
break
P.append(prime)
i = 0
while i < len(A):
if A[i] % prime == 0:
A.pop(i)
continue
i += 1
for a in A:
P.append(a)
return P
# 同じものを含む順列
def permutation_with_duplicates(L):
if L == []:
return [[]]
else:
ret = []
# set（集合）型で重複を削除、ソート
S = sorted(set(L))
for i in S:
data = L[:]
data.remove(i)
for j in permutation_with_duplicates(data):
ret.append([i] + j)
return ret
# ここから書き始める
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 1
if 0 in a:
print((0))
sys.exit()
for i in a:
ans *= i
if ans > 10 ** 18:
print((-1))
break
else:
print(ans) | p02658 |
n = int(eval(input()))
li = [int(x) for x in input().split()]
ans = 1
for i in range(n):
ans = ans * li[i]
if ans > 1000000000000000000:
print("-1")
else:
print(ans)
| n = int(eval(input()))
li = [int(x) for x in input().split()]
ans = 1
if 0 in li:
print("0")
else:
for i in range(n):
ans = ans * li[i]
if ans > 1000000000000000000:
print("-1")
exit()
print(ans)
| p02658 |
N=int(eval(input()))
a=list(map(int,input().split()))
b=1
for i in range(N):
b=b*a[i]
if b>10**18:
print((-1))
else:
print(b) | N=int(eval(input()))
a=list(map(int,input().split()))
a.sort()
b=1
if a[0]==0:
print((0))
exit()
for i in range(N):
b=b*a[i]
if b>10**18:
print((-1))
exit()
print(b) | p02658 |
n=eval(input())
a = list(map(int, input().split()))
ans=1
for i in range(len(a)):
ans*= a[i]
if ans<1000000000000000001:
print(ans)
else:
print((-1))
| n=eval(input())
a = list(map(int, input().split()))
ans=1
az=a.count(0)
if az>0:
print((0))
else:
for i in range(len(a)):
ans*= a[i]
if ans>=1000000000000000001:
ans=-1
break
print(ans)
| p02658 |
N = int(eval(input()))
A = list(input().split())
ans = 1
lim = 10 ** 18
for i in range(len(A)):
ans *= int(A[i])
if lim < ans and "0" not in A:
print('-1')
else:
print(ans)
# print(ans, lim)
| n = int(eval(input()))
a = list(map(int, input().split()))
ans = 1
if 0 in a:
print((0))
exit()
for i in a:
ans *= i
if ans > 1e18:
break
if ans > 1e18:
print((-1))
else:
print(ans)
| p02658 |
def main():
N = int(eval(input()))
A = [int(x) for x in input().split()]
out = 1
for n in A:
out = n * out
if out > 1000000000000000000:
print((-1))
else:
print(out)
main() | #!/usr/bin/env python3
def main():
N = int(eval(input()))
A = [int(x) for x in input().split()]
if 0 in A:
print((0))
else:
out = 1
for n in A:
out = n * out
if out > 1000000000000000000:
break
else:
continue
if out > 1000000000000000000:
print((-1))
else:
print(out)
main() | p02658 |
n=int(eval(input()))
a=list(map(int,input().split()))
if 0 in a:
ans=0
else:
ans=1
for i in range(n):
ans*=a[i]
if ans<=10**18:
continue
else:
ans=-1
break
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
ans=1
if 0 in a:
ans=0
else:
for i in range(n):
ans*=a[i]
if ans>10**18:
ans=-1
break
print(ans) | p02658 |
N = int(eval(input()))
line = [int(i) for i in input().split()]
sum = 1
for num in line:
if num == 0:
print((0))
exit()
sum = sum * num
if sum > 10 ** 18:
print((-1))
else:
print(sum) | N = int(eval(input()))
line = [int(i) for i in input().split()]
sum = 1
line.sort(reverse=True)
if line[len(line) -1]== 0:
print((0))
exit()
for num in line:
sum = sum * num
if sum > 10 ** 18:
print((-1))
exit()
print(sum) | p02658 |
n=int(eval(input()))
a=list(map(int, input().split()))
m=1
for i in range(n):
m*=a[i]
if m > 10**18:
print("-1")
else:
print(m)
| n=int(eval(input()))
a=list(map(int, input().split()))
if 0 in a:
print((0))
else:
m=1
for i in a:
m*=i
if 10**18 < m:
print((-1))
break
else:
print(m)
| p02658 |
a = []
x = 1
n = int(eval(input()))
a = input().split()
for i in range(n):
a[i-1] = int(a[i-1])
x = x * a[i-1]
if x <= 10**18:
print(x)
else:
print((-1)) | n = int(eval(input()))
a = list(map(int,input().split()))
ans = 1
a.sort()
for i in range(n):
ans = ans * a[i]
if ans > 10**18:
ans = -1
break
print(ans) | p02658 |
import sys
N = int(eval(input()))
As = [int(n) for n in input().split()]
limit = 10**18
prod = 1
over = False
for A in As:
prod *= A
if prod == 0:
print((0))
sys.exit(0)
if prod > limit:
over = True
if over:
print((-1))
else:
print(prod) | import sys
N = int(eval(input()))
As = [int(n) for n in input().split()]
As_set = set(As)
limit = 10**18
prod = 1
if 0 in As_set:
print((0))
sys.exit(0)
over = False
for A in As:
prod *= A
if prod > limit:
print((-1))
sys.exit(0)
print(prod) | p02658 |
N = eval(input())
A = list(map(int, input().split()))
ans = 1
for i in A:
ans = ans * i
if ans == 0:
break
if ans > 1000000000000000000:
print((-1))
else:
print(ans) | N = eval(input())
A = list(map(int, input().split()))
A.sort()
ans = 1
for i in A:
ans = ans * i
if ans == 0:
break
if ans > 1000000000000000000:
ans = -1
break
print(ans) | p02658 |
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 1
for i in range(N):
ans *= A[i]
if ans > 10**18:
ans = -1
print(ans) | import sys
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 1
if 0 in A:
print((0))
sys.exit()
for a in A:
ans *= a
if ans > 10**18:
print((-1))
sys.exit()
print(ans) | p02658 |
from functools import reduce
n, *a = list(map(int, open(0).read().split()))
ans = reduce(lambda x, y: x*y, a, 1)
print((-1 if ans > 10**18 else ans))
| n, *a = list(map(int, open(0).read().split()))
ans = 1
for i in range(n):
if ans == -1:
if a[i] == 0:
ans = 0
break
else:
ans *= a[i]
if ans > 10**18:
ans = -1
print(ans)
| p02658 |
import functools
import operator
n = int(eval(input()))
a = list(map(int, input().split()))
pre = functools.reduce(operator.mul, a)
if pre <= 1000000000000000000:
print(pre)
else:
print((-1))
| def main():
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort(reverse=True)
if 0 in A:
print('0')
return
prod=1
for a in A:
prod*=a
if prod> 1000000000000000000:
print('-1')
return
print(prod)
ans=main()
| p02658 |
n = int(eval(input()))
lista = [int(e) for e in input().split()]
ans = 1
for i in lista:
ans = ans *i
if ans > 10**18:
ans=-1
print(ans) | n = int(eval(input()))
lista = [int(e) for e in input().split()]
if 0 in lista:
ans = 0
else:
ans = 1
for i in lista:
ans *= i
if ans>10**18:
ans = -1
break
print(ans) | p02658 |
n = eval(input())
a = list(map(int,input().split()))
temp = pow(10, 18)
ans = 1
flag = 0
for i in a:
ans = ans * i
if ans <= temp:
print(ans)
else:
print((-1))
| n = eval(input())
a = list(map(int,input().split()))
temp = pow(10, 18)
ans = 1
flag = 0
if 0 in a:
print((0))
flag = 1
else:
for i in a:
ans = ans * i
if ans > temp:
print((-1))
flag = 1
break
if flag == 0:
print(ans)
| p02658 |
n = int(eval(input()))
a = list(map(int, input().split()))
result = 1
for i in a:
result *= i
if i == 0:
break
if result > 10**18:
print((-1))
else:
print(result)
| n = int(eval(input()))
a = list(map(int, input().split()))
result = 1
overflow = False
for i in a:
result *= i
if result > 1e18:
result = 1
overflow = True
if result != 0 and overflow:
print((-1))
else:
print(result) | p02658 |
def check():
n=int(eval(input()))
A=list(map(int,input().split()))
if 0 in A:
print((0))
return
a=1
for i in A:
a=a*i
if a>1000000000000000000:
print((-1))
return
print(a)
return
check()
| n=int(eval(input()))
A=list(map(int,input().split()))
ans=1
if 0 in A:
print((0))
exit()
for i in A:
ans=ans*i
if ans>10**18:
print((-1))
exit()
print(ans) | p02658 |
n = int(eval(input()))
a = list(map(int, input().split()))
MAX = 1000000000000000000
ans = 1
for i in range(n) :
ans *= a[i]
if (ans > MAX) :
print((-1))
else :
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
MAX = 1000000000000000000
ans = 1
for i in range(n) :
if (a[i] == 0) :
print((0))
exit()
for i in range(n) :
ans *= a[i]
if (ans > MAX) :
print((-1))
exit()
if (ans > MAX) :
print((-1))
else :
print(ans)
| p02658 |
N=int(eval(input()))
A=input().split()
answer=1
for i in range(N):
answer=answer*int(A[i])
if answer>1*10**18:
print((-1))
else:
print(answer)
| N=int(eval(input()))
A=input().split()
answer=1
for i in range(N):
if int(A[i])==0:
answer=0
for i in range(N):
answer=answer*int(A[i])
if answer>1*10**18:
answer=-1
break
print(answer) | p02658 |
from operator import mul
from functools import reduce
#while True:
N = int(eval(input()))
# if N>=2 and N<=10**5:break
if 2 <= N <= 10**5:
num = list(map(int, input().split()))
ans = reduce(mul,num)
if ans > 10**18:
print((-1))
else:
print(ans) | def main():
n = int(eval(input()))
a = list(map(int,input().split()))
if 0 in a:
print((0))
return
ans = 1
for ai in a:
ans *= ai
if ans > 10**18:
print((-1))
return
print(ans)
if __name__ =="__main__":
main() | p02658 |
#ABC169b
n = int(eval(input()))
a = list(map(int, input().split()))
sum = 1
for i in range(n):
sum = sum * a[i]
if sum > 10**18:
print((-1))
else:
print(sum)
| #ABC169b
n = int(eval(input()))
a = list(map(int, input().split()))
sum = 1
if 0 in a:
sum = 0
else:
for i in range(n):
sum = sum * a[i]
if sum > 10**18:
break
if sum > 10**18:
print((-1))
else:
print(sum)
| p02658 |
def solve():
N = int(eval(input()))
A = [int(i) for i in input().split()]
ans = 1
for num in A:
ans *= num
if ans > 10**18:
ans = -1
print(ans)
if __name__ == "__main__":
solve() | def solve():
N = int(eval(input()))
A = [int(i) for i in input().split()]
ans = 1
for i in range(N):
if ans == -1 and A[i] != 0:
continue
ans *= A[i]
if ans > 10**18:
ans = -1
print(ans)
if __name__ == "__main__":
solve() | p02658 |
from functools import reduce
n = int(eval(input()))
a = list(map(int, input().split()))
ans = reduce(lambda x, y: x*y, a)
if ans > 10**18:
print((-1))
exit()
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
ans = 1
if 0 in a:
print((0))
exit()
for i in a:
ans *= i
if ans > 10**18:
print((-1))
exit()
print(ans)
| p02658 |
N=int(eval(input()))
A=[int(x) for x in input().split()]
ans=1
for i in range(0,N):
ans=ans*A[i]
if ans>1000000000000000000:
ans=-1
print(ans)
| N=int(eval(input()))
A=[int(x) for x in input().split()]
ans=1
if 0 in A:
ans=0
else:
for i in range(0,N):
ans=ans*A[i]
if ans>1000000000000000000:
ans=-1
break
print(ans) | p02658 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 1
for i in a:
ans *= i
if ans > 10 ** 18:
print("-1")
else:
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
if 0 in a:
print((0))
exit()
ans = 1
for i in a:
ans *= i
if ans > 10 ** 18:
print("-1")
exit()
print(ans)
| p02658 |
n = int(eval(input()))
a = list(map(int, input().split()))
pro = 1
for i in a:
pro = pro * i
if pro > 10 ** 18:
print((-1))
else:
print(pro) | n = int(eval(input()))
a = list(map(int, input().split()))
pro = 1
if 0 in a:
pro = 0
else:
for i in a:
if pro > 10 ** 18:
pro = -1
break
else:
pro = pro * i
if pro > 10 ** 18:
print((-1))
else:
print(pro) | p02658 |
n = int(eval(input()))
a = input().split(" ")
sum = 1
for i in a:
sum = sum * int(i)
if sum > 1000000000000000000:
print((-1))
else:
print(sum) | n = int(eval(input()))
a = input().split(" ")
sum = 1
for i in a:
sum = sum * int(i)
if sum > 1000000000000000000:
break
if "0" in a:
print((0))
elif sum > 1000000000000000000:
print((-1))
else:
print(sum) | p02658 |
n = int(eval(input()))
a = list(map(int,input().split()))
pdt = 1
for i in range(n):
pdt *= a[i]
if pdt>10**18:
print((-1))
else:
print(pdt) | n = int(eval(input()))
a = list(map(int,input().split()))
pdt = 1
a.sort()
for i in range(n):
pdt *= a[i]
if pdt==0:
print(pdt)
break
elif pdt>10**18:
print((-1))
break
else:
print(pdt) | p02658 |
import sys
n = sys.stdin.readline()
l = list(map(int, sys.stdin.readline().split()))
tmp = 1000000000000000000
ans = 1
for i in l:
if i == 0:
ans = 0
break
ans *= i
if ans <= 1000000000000000000:
print(ans)
else:
print((-1))
| import sys
n = sys.stdin.readline()
l = list(map(int, sys.stdin.readline().split()))
tmp = 1000000000000000000
if 0 in l:
print((0))
else:
ans = 1
for i in l:
ans *= i
if 1000000000000000000 < ans:
break
if ans <= 1000000000000000000:
print(ans)
else:
print((-1))
| p02658 |
n=int(eval(input()))
a=input().split()
ans=1
for i in range(n):
ans=ans*int(a[i])
if ans>(10**18):
print((-1))
else:
print(ans) | n=int(eval(input()))
a=input().split()
ans=1
if a.count("0"):
print((0))
exit()
for i in range(n):
ans=ans*int(a[i])
if ans>(10**18):
print((-1))
exit()
print(ans) | p02658 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 1
for i in a:
ans *= i
if ans > 10**18:
ans = -1
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
for i in a:
if i == 0:
print((0))
exit()
ans = 1
for i in a:
ans *= i
if ans > 10**18:
ans = -1
break
print(ans)
| p02658 |
N = int(eval(input()))
A = list(map(int,input().split(" ")))
ans = 1
for x in A:
ans *= x
if ans <= 10**18:
print(ans)
else:
print("-1")
| N = int(eval(input()))
A = list(map(int,input().split(" ")))
flag = 0
ans = 1
if 0 in A:
flag = 2
print((0))
if flag != 2:
for x in A:
ans *= x
#print(ans)
if ans > 10**18:
flag = 1
break
if flag == 0:
print(ans)
elif flag == 1:
print("-1") | p02658 |
N=int(eval(input()))
A=list(map(int,input().split()))
result=1
if 0 in A:
result=0
else:
for i in range(N):
result = result*A[i]
if result > 10**18:
result=-1
print(result) | import sys
n = eval(input())
list_num =list(map(int,input().split()))
output = 1
if 0 in list_num:
print((0))
sys.exit()
for i in list_num:
output = output * i
if output > 10 ** 18:
print((-1))
sys.exit()
print(output)
| p02658 |
N=int(eval(input()))
A=list(map(int,input().split()))
result=1
if 0 in A:
result=0
else:
for i in A:
result = result*i
if result > 10**18:
result=-1
print(result)
| n = int(eval(input()))
a = list(map(int, input().split()))
if 0 in a:
print((0))
else:
ma = 10**18
ans = 1
for i in a:
ans = ans * i
if ans > ma:
ans = -1
break
print(ans) | p02658 |
N = int(eval(input()))
A = list(map(int, input().split()))
result = 1
for i in range(N):
result = result * A[i]
if result > 1000000000000000000:
print((-1))
else:
print(result)
| N = int(eval(input()))
A = list(map(int, input().split()))
def judge(A):
for i in range(len(A)):
if A[i] == 0:
print((0))
return
result = 1
for i in range(N):
result = result * A[i]
if result > 1000000000000000000:
print((-1))
return
if result <= 1000000000000000000:
print(result)
return
judge(A) | p02658 |
N = int(eval(input()))
sum = 1
for num in input().split():
sum *= int(num)
if sum == 0:
print((0))
exit()
if len(str(sum)) > 19:
print((-1))
exit()
elif len(str(sum)) == 19:
if str(sum).count("1") == 1 and str(sum).count("0") == 18:
pass
else:
print((-1))
exit()
print(sum)
| N = int(eval(input()))
sum = 1
keta = 0
numbers = input().split()
if not ("0" in numbers):
for num in numbers:
keta += len(num) - 1
if keta > 19:
print((-1))
exit()
sum *= int(num)
if len(str(sum)) > 19:
print((-1))
exit()
if len(str(sum)) == 19:
if str(sum).count("1") == 1 and str(sum).count("0") == 18:
pass
else:
print((-1))
exit()
else:
print((0))
exit()
print(sum) | p02658 |
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 1
for x in A:
ans *= x
if ans < 0:
print((-1))
exit()
if ans > 1000000000000000000:
print((-1))
exit()
print(ans)
| N = int(eval(input()))
A = list(map(int, input().split()))
ans = 1
keta = 0
if 0 in A:
print((0))
exit()
for x in A:
ans *= x
keta += len(str(x))
if ans > 1000000000000000000:
print((-1))
exit()
print(ans)
| p02658 |
N = int(eval(input()))
a = list(map(int, input().split()))
ans = 1
for i in a:
ans *= i
if ans > 10**18:
ans = -1
print(ans)
| N = int(eval(input()))
a = list(map(int, input().split()))
ans = 1
for i in a:
ans *= i
if ans > 10**18:
ans = -1
break
if a.count(0) > 0:
ans = 0
print(ans)
| p02658 |
n = int(eval(input()))
l = list(map(int,input().split()))
total = 1
for i in l:
total *= i
if total > 1000000000000000000 :
total = -1
print(total) | n = int(eval(input()))
l = list(map(int, input().split()))
total = 1
if __name__ == '__main__':
for i in l:
total *= i
if total > 1000000000000000000:
total = -1
break
if 0 in l :
total = 0
print(total) | p02658 |
n = int(eval(input()))
a = list(map(int,input().split()))
ans = 1
for i in range(n):
ans *= a[i]
if ans > 10**18:
print((-1))
else:
print(ans) | n = int(eval(input()))
a = list(map(int,input().split()))
a = sorted(a)
#print(a)
ans = 1
if a.count(0):
print((0))
exit()
for i in range(n):
ans *= a[i]
if ans > 10**18:
print((-1))
exit()
print(ans)
| p02658 |
n=int(eval(input()))
a=input().split()
a=list(map(int,a))
i=0
ans=1
if(n==0):
print((0))
exit()
elif(len(a)==0):
print((0))
exit()
for calc in a:
if(0 in a):
print((0))
exit()
ans=ans*calc
if(ans>1000000000000000000):
print((-1))
exit()
i+=1
if(i==n):
break
if(ans>1000000000000000000):
print((-1))
else:
print(ans)
| n=int(eval(input()))
a=input().split()
a=list(map(int,a))
ans=1
if(0 in a):
print((0))
exit()
for calc in a:
ans*=calc
if(ans>10**18):
print((-1))
exit()
if(ans>10**18):
print((-1))
else:
print(ans)
| p02658 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.