input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N = int(eval(input()))
A = list(map(int,input().split()))
re = 1
if int(0 in A) == 1:
re = 0
N = 0
for i in range(N):
re *= A[i]
if re > 10**18:
re = -1
print(re) | N = int(eval(input()))
A = list(map(int,input().split()))
re = 1
if int(0 in A) == 1:
re = 0
N = 0
for i in range(N):
re *= A[i]
if re > 10**18:
re = -1
break
print(re) | p02658 |
N = int(eval(input()))
ls = list(map(int, input().split()))
goukei = 1
for i in ls:
goukei *= i
if goukei > 10**18:
print('-1')
else:
print(goukei) | N = int(eval(input()))
ls = list(map(int, input().split()))
if 0 in ls:
print('0')
exit()
goukei = 1
for i in ls:
goukei *= i
if goukei > 1000000000000000000:
print('-1')
exit()
print((int(goukei))) | p02658 |
n = int(eval(input()))
ret = 1
a = list(map(int, input().split()))
for ai in a:
ret *= ai
if ret > 1000000000000000000:
print((-1))
else:
print(ret)
| n = int(eval(input()))
ret = 1
a = sorted(list(map(int, input().split())))
for ai in a:
ret *= ai
if ret > 1000000000000000000:
print((-1))
exit(0)
print(ret)
| p02658 |
import functools
import operator
num = int(eval(input()))
a = list(map(int, input().split()))
result = functools.reduce(operator.mul, a)
if result > 1000000000000000000:
print((-1))
else:
print(result) | ans = 1
flag = 0
n = int(eval(input()))
a = list(map(int, input().split()))
if 0 in a:
print((0))
else:
for i in range(n):
ans *= a[i]
if ans > 1000000000000000000:
flag = 1
print((-1))
break
if flag == 0:
print(ans) | p02658 |
n = int(eval(input()))
nums = list(map(int, input().split()))
ans = 1
for i in range(n):
ans *= nums[i]
if ans > 10**18:
ans = -1
print(ans) | n = int(eval(input()))
nums = list(map(int, input().split()))
ans = 1
if nums.count(0) > 0:
ans = 0
else:
for i in range(n):
ans *= nums[i]
if ans > 10**18:
ans = -1
break
print(ans)
| p02658 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
def input():
return sys.stdin.readline()
def resolve():
n = int(input().rstrip())
a_list = list(map(int, input().split()))
ans = 1
for i in a_list:
ans *= i
if ans > 10 ** 18:
print((-1))
else:
print(ans)
if __name__ == "__main__":
resolve()
| #!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
def input():
return sys.stdin.readline()
def resolve():
n = int(input().rstrip())
a_list = list(map(int, input().split()))
flag = False
try:
if a_list.index(0):
flag = True
print((0))
exit()
except:
if flag:
exit()
ans = 1
for i in a_list:
ans *= i
if ans > 10 ** 18:
print((-1))
exit()
print(ans)
if __name__ == "__main__":
resolve()
| p02658 |
n = int(eval(input()))
A = input().split(sep=' ')
pro = 1
for el in A:
pro *= int(el)
if pro > 1e18:
print((-1))
else:
print(pro) | n = int(eval(input()))
A = list(map(int, input().split()))
if 0 in A:
print((0))
else:
pro = 1;
ok = True
for el in A:
pro *= el
if(pro > 1e18):
ok = False
break
if ok: print(pro)
else: print((-1))
| p02658 |
n = int(eval(input()))
la = list(map(int, input().split()))
import functools
import operator
ans = functools.reduce(operator.mul, la)
if ans > 10**18:
print((-1))
else:
print(ans) | def my_index(l, x, default=False):
if x in l:
return l.index(x)
else:
return default
n = int(eval(input()))
la = list(map(int, input().split()))
import sys
if my_index(la, 0) > 0:
print((0))
sys.exit()
ans = 1
for i in la:
ans *= i
if ans > 10**18:
print((-1))
sys.exit()
print(ans) | p02658 |
n=int(eval(input()))
A=list(map(int,input().split()))
s=1
for a in A:
s*=a
print((-1 if s>10**18 else s)) | n=int(eval(input()))
A=list(map(int,input().split()))
s=1
if 0 in A:
s=0
else:
for a in A:
s*=a
if s>10**18:
s=-1
break
print(s) | p02658 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 1
flag = False
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()))
if 0 in a:
print((0))
else:
ans = 1
flag = False
for i in range(n):
ans = ans * a[i]
if ans > 10**18:
flag = True
break
if flag:
print((-1))
else:
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)
| def pyn():
n = int(eval(input()))
a = list(map(int, input().split()))
if 0 in a:
print((0))
return
ans=1
for i in a:
ans *= i
if ans>10**18:
print((-1))
return
print(ans)
pyn() | p02658 |
num = eval(input())
input_data = input().split()
result = 1
for i in range(int(num)):
result = result * int(input_data[i])
if pow(10, 18) < result:
print((-1))
else:
print(result) | num = int(eval(input()))
input_data = list(map(int,input().split()))
for i in input_data:
if i == 0:
print((0))
exit()
result = 1
for i in range(num):
result = result * int(input_data[i])
if pow(10, 18) < result:
print((-1))
exit()
print(result) | p02658 |
N=int(eval(input()))
A=list(map(int,input().split()))
ans=1
for a in A:
ans=ans*a
if ans > 10**18:
ans=-1
if ans<0:
ans=-1
print(ans) | N=int(eval(input()))
A=list(map(int,input().split()))
ans=1
if 0 in A:
ans=0
else:
for a in A:
ans=ans*a
if ans > 10**18:
ans=-1
break
print(ans)
| p02658 |
from operator import mul
from functools import reduce
N = int(eval(input()))
x = [int(i) for i in input().split()]
y = reduce(mul, x)
if y > 10**18:
print((-1))
else:
print(y) | n=int(eval(input()))
A=list(map(int,input().split()))
now=1
if 0 in A:
print((0))
exit()
for a in A:
now = now * a
if now>10**18:
print((-1))
exit()
print(now) | p02658 |
n=int(eval(input()))
A=list(map(int,input().split()))
now=1
if 0 in A:
print((0))
exit()
for a in A:
now = now * a
if now>10**18:
print((-1))
exit()
print(now) | N = int(eval(input()))
A = list(map(int, input().split()))
num = 1
if 0 in A:
print((0))
exit()
for i in A:
num = num * i
if num > 10**18:
print((-1))
exit()
print(num) | p02658 |
n = int(eval(input()))
a = list(map(int,input().split()))
result = 1
for x in a:
result *= x
if result > 10 ** 18:
result = -1
print(result) | n = int(eval(input()))
a = list(map(int,input().split()))
result = 1
if 0 in a:
result = 0
else:
for x in a:
result *= x
if result > 10 ** 18:
result = -1
break
print(result) | p02658 |
import sys
n = int(eval(input()))
a_list = list(map(int, input().split()))
ans = 1
for a in a_list:
if a == 0:
print((0))
sys.exit()
if a > 1000000000000000000:
print((-1))
sys.exit()
ans *= a
if ans > 1000000000000000000:
print((-1))
else:
print(ans)
| import sys
n = int(eval(input()))
a_list = list(map(int, input().split()))
a_list.sort(reverse=True)
if a_list[-1] == 0:
print((0))
sys.exit()
if a_list[0] > 1000000000000000000:
print((-1))
sys.exit()
ans = 1
for a in a_list:
ans *= a
if ans > 1000000000000000000:
print((-1))
sys.exit()
print(ans)
| p02658 |
n = int(eval(input()))
ls = list(map(int, input().split()))
res = 1
if 0 in ls:
res = 0
for x in ls:
res *= x
if res > 10**18:
res = -1
print(res) | n = int(eval(input()))
ls = list(map(int, input().split()))
res = 1
if 0 in ls:
print((0))
quit()
for x in ls:
res *= x
if res > 10**18:
print((-1))
quit()
print(res) | p02658 |
# import numpy as np
# import math
# import copy
# from collections import deque
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10000)
def main():
N = int(eval(input()))
A = list(map(int,input().split()))
INF = 10 ** 18
res = 1
for i in range(N):
res *= A[i]
if res > INF:
res = -1
print(res)
main()
| # import numpy as np
# import math
# import copy
# from collections import deque
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10000)
# from numba import njit
def main():
N = int(eval(input()))
A = list(map(int,input().split()))
Aset = set(A)
if 0 in Aset:
print((0))
sys.exit()
A.sort(reverse=True)
res = 1
INF = 10 ** 18
for i in range(N):
res *= A[i]
if res > INF:
res = -1
break
print(res)
main()
| p02658 |
n = int(eval(input()))
lt=input().split(" ")
ans=1
for i in range(n):
ans*=int(lt[i])
if(ans<=10**18):
print(ans)
else:
print((-1)) | n = int(eval(input()))
A = [*list(map(int,input().split()))]
ok = 0
ans = 1
lim = 10**18
for i in range(n):
ans *= A[i]
if(ans>lim):
ok =1
break
if(ok and 0 not in A):
print((-1))
elif(0 in A):
print((0))
else:
print(ans) | p02658 |
n=int(eval(input()))
a_list=list(map(int,input().split()))
ans=a_list[0]
for i in range(1,n):
ans*=a_list[i]
if ans>10**18:
ans=-1
print(ans)
| n=int(eval(input()))
a_list=list(map(int,input().split()))
ans=a_list[0]
if 0 in a_list:
ans=0
else:
for i in range(1,n):
ans*=a_list[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 a[i]==0:
ans=0
break
if ans>1000000000000000000:
ans=-1
print(ans) | N = int(eval(input()))
a = list(map(int,input().split()))
ans=1
check=0
for i in range(N):
ans=ans*a[i]
if a[i]==0:
ans=0
check=2
break
if ans>1000000000000000000:
ans=1
check=1
if check==1:
ans=-1
print(ans) | p02658 |
n = int(eval(input()))
a = list(map(int, input().split()))
answer = 1
for i in a:
answer *= i
if answer <= 10**18:
print(answer)
if answer > 10**18:
print ("-1") | n = int(eval(input()))
a = list(map(int, input().split()))
answer = 1
if 0 in a:
answer = 0
for i in a:
answer *= i
if answer > 10**18:
print ("-1")
break
if answer <= 10**18:
print(answer) | p02658 |
#!/usr/bin/python
# -*- coding: utf-8 -*-
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(ans)
else:
print((-1))
|
#!/usr/bin/python
# -*- coding: utf-8 -*-
N = int(eval(input()))
A = list(map(int,input().split()))
if A.count(0) > 0:
print((0))
exit()
ans = 1
for i in range(N):
ans *= A[i]
if ans > 10**18:
print((-1))
exit()
if ans <= 10**18:
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 > pow(10, 18):
ans = -1
print(ans) | n = int(eval(input()))
A = list(map(int, input().split()))
if 0 in A:
print((0))
exit()
ans = 1
lim = pow(10, 18)
for a in A:
ans *= a
if ans > lim:
ans = -1
break
print(ans) | p02658 |
N = int(eval(input()))
An = list(map(int,input().split()))
a = 1
if 0 in An:
print("0")
else:
for i in range(N):
a *= An[i]
if a <= 10**18:
print(a)
else:
print("-1") | import sys
N = int(eval(input()))
An = list(map(int,input().split()))
a = 1
if 0 in An:
print("0")
sys.exit()
else:
for i in range(N):
a *= An[i]
if a > 10**18:
print("-1")
sys.exit()
if a <= 10**18:
print(a)
sys.exit()
| p02658 |
n = int(eval(input()))
a = list(map(int, input().split(' ')))
ret = 1
for ai in a:
ret *= ai
if ret > 10**18:
print((-1))
else:
print(ret) | n = int(eval(input()))
a = list(map(int, input().split(' ')))
# import numpy as np
# ret = np.prod(a)
if a.count(0) > 0:
print((0))
else:
ret = 1
for ai in a:
ret *= ai
if ret > 10**18:
print((-1))
break
else:
if ret > 10**18:
print((-1))
else:
print(ret)
# if ret > 10**18 or ret < 0:
# print(-1)
# else:
# print(ret) | p02658 |
import sys
if sys.platform =='ios':
sys.stdin=open('input_file.txt')
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n=int(eval(input()))
l=list(map(int,input().split()))
a=1
for i in range(0,n):
a=a*l[i]
if a>10**18:
print((-1))
if a<10**18+1:
print(a) | import sys
if sys.platform =='ios':
sys.stdin=open('input_file.txt')
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n=int(eval(input()))
l=sorted(list(map(int,input().split())))
a=1
if l[0]==0:
print("0")
else:
for i in range(0,n):
a=a*l[i]
if a>10**18:
print((-1))
break
if a<10**18+1:
print(a) | p02658 |
n = int(eval(input()))
a = list(map(int,input().split()))
if 0 in a:
ans = 0
else:
ans = 1
for i in a:
if ans * i > 10**18:
ans = -1
else:
ans = ans * i
print(ans) | n = int(eval(input()))
a = list(map(int,input().split()))
if 0 in a:
ans = 0
else:
ans = 1
for i in a:
if ans * i > 10**18:
ans = -1
break
else:
ans = ans * i
print(ans) | p02658 |
# 制約条件
MAX_RESULT = 1000000000000000000
N = int(eval(input()))
A1 = [int(x) for x in input().split()]
tmp = 1
for x in range(len(A1)):
tmp = tmp * A1[x]
result = tmp
if (result > MAX_RESULT):
result = -1
print(result) | def main():
# 制約条件
MAX_RESULT = 1000000000000000000
N = int(eval(input()))
A = [int(x) for x in input().split()]
if 0 in A:
result = 0
print(result)
return
result = 1
for x in A:
result *= x
if result > MAX_RESULT:
print((-1))
return
print(result)
main() | p02658 |
#JMD
#Nagendra Jha-4096
import sys
import math
#import fractions
#import numpy
###File Operations###
fileoperation=0
if(fileoperation):
orig_stdout = sys.stdout
orig_stdin = sys.stdin
inputfile = open('W:/Competitive Programming/input.txt', 'r')
outputfile = open('W:/Competitive Programming/output.txt', 'w')
sys.stdin = inputfile
sys.stdout = outputfile
###Defines...###
mod=1000000007
###FUF's...###
def nospace(l):
ans=''.join(str(i) for i in l)
return ans
##### Main ####
t=1
for tt in range(t):
n=int(eval(input()))
#n,k,s= map(int, sys.stdin.readline().split(' '))
a=list(map(int,sys.stdin.readline().split(' ')))
ams=1
for x in a:
ams*=x
if ams>pow(10,18):
ams=-1
print(ams)
#####File Operations#####
if(fileoperation):
sys.stdout = orig_stdout
sys.stdin = orig_stdin
inputfile.close()
outputfile.close() | #JMD
#Nagendra Jha-4096
import sys
import math
#import fractions
#import numpy
###File Operations###
fileoperation=0
if(fileoperation):
orig_stdout = sys.stdout
orig_stdin = sys.stdin
inputfile = open('W:/Competitive Programming/input.txt', 'r')
outputfile = open('W:/Competitive Programming/output.txt', 'w')
sys.stdin = inputfile
sys.stdout = outputfile
###Defines...###
mod=1000000007
###FUF's...###
def nospace(l):
ans=''.join(str(i) for i in l)
return ans
##### Main ####
t=1
for tt in range(t):
n=int(eval(input()))
#n,k,s= map(int, sys.stdin.readline().split(' '))
a=list(map(int,sys.stdin.readline().split(' ')))
ams=1
if 0 in a:
print((0))
continue
for x in a:
ams*=x
if ams> 1000000000000000000:
ams=-1
break
print(ams)
#####File Operations#####
if(fileoperation):
sys.stdout = orig_stdout
sys.stdin = orig_stdin
inputfile.close()
outputfile.close()
| p02658 |
N = int(eval(input()))
S = [int(s) for s in input().split()]
l = 1
for s in S:
l = l * s
if l > 10**18:
l = -1
print(l) | N = int(eval(input()))
S = [int(s) for s in input().split()]
if 0 in S:
l = 0
else:
l = 1
for s in S:
l = l * s
if l > 10**18:
l = -1
break
print(l) | p02658 |
import sys
#from collections import defaultdict, deque, Counter
#import bisect
#import heapq
#import math
#from itertools import accumulate
#from itertools import permutations as perm
#from itertools import combinations as comb
#from itertools import combinations_with_replacement as combr
#from fractions import gcd
#import numpy as np
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
INF = float("inf")
IINF = 10 ** 18
def main():
n = int(stdin.readline().rstrip())
#A, B = map(float, stdin.readline().rstrip().split())
A = list(map(int, stdin.readline().rstrip().split()))
#numbers = [[int(c) for c in l.strip().split()] for l in sys.stdin]
#word = [stdin.readline().rstrip() for _ in range(n)]
#number = [[int(c) for c in stdin.readline().rstrip()] for _ in range(n)]
#zeros = [[0] * w for i in range(h)]
import functools
import operator
result = functools.reduce(operator.mul, A)
if result > 10**18:
print((-1))
else:
print(result)
main()
| import sys
stdin = sys.stdin
def main():
n = int(stdin.readline().rstrip())
A = list(map(int, stdin.readline().rstrip().split()))
A.sort()
ans = 1
for i in range(n):
if ans > 10**18:
if A[0] == 0:
print((0))
exit()
print((-1))
exit()
ans *= A[-i]
print((ans if ans <= 10**18 else -1))
main()
| p02658 |
n=int(eval(input()))
a=input().split()
ans=1
for i in range(n):
ans*=int(a[i])
if ans>10**18:
print("-1")
else:
print((str(ans))) | n=int(eval(input()))
a=input().split()
ans=1
if "0" in a:
print("0")
exit()
for i in range(n):
ans*=int(a[i])
if ans>10**18:
print("-1")
exit()
print((str(ans))) | p02658 |
n = int(eval(input()))
mod = 10**18
li = list(map(int, input().split()))
ans = 1
for i in range(n):
ans = ans * li[i]
if ans > mod:
print((-1))
else:
print(ans)
| n = int(eval(input()))
mod = 10**18
li = list(map(int, input().split()))
li.sort()
ans = 1
for i in range(n):
ans *= li[i]
if ans > mod:
ans = -1
break
print(ans)
| p02658 |
eval(input())
a=[int(i) for i in input().split()]
ans=1
for i in a:
ans*=i
print((ans if ans<=10**18 else -1)) | eval(input())
a=[int(i) for i in 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=list(map(int,input().split()))
x=10**18
ans=1
for i in a:
ans=ans*i
if(ans>x):
ans=-1
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
x=10**18
ans=1
if 0 in a:
ans=0
else:
for i in a:
ans=ans*i
if(ans>x):
ans=-1
break
print(ans) | p02658 |
N, = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
ans = 1
for x in A:
ans *= x
if ans > 10 ** 18:
print((-1))
else:
print(ans)
| N, = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
if 0 in A:
print((0))
exit()
ans = 1
for x in A:
ans *= x
if ans > 10 ** 18:
print((-1))
exit()
print(ans)
| p02658 |
N = int(eval(input()))
A = list(map(int,input().split()))
PI = 1
for i in range(N):
PI = PI*A[i]
if PI > 10**(18):
print((-1))
else:
print(PI) | N = int(eval(input()))
A = list(map(int,input().split()))
PI = 1
if 0 in A:
PI = 0
else:
for i in range(N):
PI = PI*A[i]
if PI > 10**(18):
PI = -1
break
print(PI)
| p02658 |
wfwfe=eval(input())
b=input().split()
if "0" in b:
print((0))
else:
count=1
for i in b:
count=count*int(i)
if count>10**18:
print((-1))
else:
print (count)
| wfwfe=eval(input())
check=0
b=input().split()
if "0" in b:
print((0))
else:
count=1
for i in b:
count=count*int(i)
if count>10**18:
print((-1))
check=1
break
if check==0:
print (count)
| p02658 |
n=int(eval(input()))
l=list(map(int,input().split()))
res=1
f=1
for x in l:
res=res*x
if(res>1000000000000000000):
f=0
else:
f=1
if(f==1):
print(res)
else:
print((-1))
|
n=int(eval(input()))
l=list(map(int,input().split()))
res=1
f=1
if(0 in l):
print((0))
f=0
if(f==1):
for x in l:
res=res*x
if(res>1000000000000000000):
print((-1))
f=0
break
if(f==1):
print(res)
| p02658 |
n=int(eval(input()))
a=list(map(int,input().split()))
import math
total=1
for i in range(n):
total*=a[i]
b = int(math.pow(10,18))
if total-b>0:
print((-1))
else:
print(total)
| n=int(eval(input()))
a=list(map(int,input().split()))
if a.count(0)>0:
print((0))
exit(0)
total=1
for i in a:
total *=i
if total>10**18:
print((-1))
exit(0)
print(total) | p02658 |
N = int(eval(input()))
A = list(map(int, input().split()))
limit = 10 ** 18
current = 1
maxFlag = False
for x in range(N):
current *= A[x]
if current > limit:
print((-1))
else:
print(current)
| N = int(eval(input()))
A = list(map(int, input().split()))
rev_A = sorted(A, reverse=True)
if 0 in rev_A:
print((0))
exit()
else:
limit = 10 ** 18
current = 1
for x in range(N):
current *= rev_A[x]
if current > limit:
print((-1))
exit()
print(current)
| p02658 |
#!/usr/bin/env python3
import math
import sys
input = sys.stdin.readline
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):
ans = ans * A[i]
if ans > 10**18:
ans =-1
break
if 0 in A:
print((0))
else:
print(ans) | p02658 |
#!/usr/bin/env python3
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) | #!/usr/bin/env python3
N = int(eval(input()))
A = list(map(int,input().split()))
ans = 1
if 0 in A:
print((0))
exit()
else:
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()))
ans = 1
for i in a:
ans *= i
if ans > 1000000000000000000:
print((-1))
else:
print(ans)
| import sys
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 1
flag = True
if 0 in a:
print((0))
sys.exit()
for i in a:
ans *= i
if ans > 1000000000000000000:
flag = False
break
if flag == False:
print((-1))
else:
print(ans)
| p02658 |
import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(eval(input()))
A = list(map(int, input().split()))
res = 1
for a in A:
res *= a
print((res if res <= 10 ** 18 else -1))
if __name__ == '__main__':
resolve()
| import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(eval(input()))
A = sorted(list(map(int, input().split())))
res = 1
for a in A:
res *= a
if res > 10 ** 18:
print((-1))
break
else:
print(res)
if __name__ == '__main__':
resolve()
| p02658 |
#A
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 1
b = 0
for i in a:
ans *= i
if ans > 10 ** 18:
b = -1
if ans == 0:#例外ans=0のときは途中で10^18を超えても0となる
b = 0
if b == -1:#10^18を超えてる
print((-1))
else:
print(ans)
| #B
n=int(eval(input()))
a = list(map(int, input().split()))
a.sort()
ans=1
for i in a:
ans *= i
if ans == 0:
break
if ans > 10 ** 18:
ans = -1
break
print(ans) | p02658 |
n=int(eval(input()))
s=1
f=0
x=[int(x) for x in input().split()]
if x.count(0)>0:
print((0))
else:
for i in range(len(x)):
s=s*x[i]
if s>10**18:
print((-1))
else:print(s) | n=int(eval(input()))
s=1
f=0
x=[int(x) for x in input().split()]
if x.count(0)>0:
print((0))
else:
for i in range(len(x)):
s=s*x[i]
if s>10**18:
f=1
break
if f:
print((-1))
else:print(s) | 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))
exit()
print(ans) | N = int(eval(input()))
*A, = list(map(int, input().split()))
def dfs(l, r):
if l==r:
return A[l]
mid = (l+r)//2
ans = 1
ans = ans * dfs(l, mid)
ans = ans * dfs(mid+1, r)
return ans
ans = dfs(0, len(A)-1)
if ans>10**18:
print((-1))
exit()
print(ans) | 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 > 10 ** 18:
print((-1))
quit()
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
ans = a[0]
if 0 in a:
print((0))
quit()
for i in range(1, n):
ans *= a[i]
if ans > 10 ** 18:
print((-1))
quit()
print(ans)
| p02658 |
N = int(eval(input()))
a = [int(x) for x in input().split(" ")]
ans = 1
fail = False
zero = False
for i in range(N):
ans*=a[i]
if(ans>1000000000000000000 or ans<0) :
fail = True
elif(a[i]==0) :
zero = True
break
if(fail and not zero) :
print("-1")
else:
print(ans) | N = int(eval(input()))
a = [int(x) for x in input().split(" ")]
ans = 1
fail = False
zero = False
for i in range(N):
if(not fail):
ans*=a[i]
if(not fail and ans>1000000000000000000 or ans<0) :
fail = True
elif(a[i]==0) :
zero = True
ans=0
break
if(fail and not zero) :
print("-1")
else:
print(ans) | p02658 |
n = int(eval(input()))
a = list(map(int, input().split()))
multi = 1
for i in a:
multi *= i
if multi > 1000000000000000000:
print("-1")
else:
print(multi) | n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
multi = 1
for i in a:
multi *= i
if multi > pow(10,18):
break
if multi > pow(10,18):
print("-1")
else:
print(multi) | p02658 |
from operator import mul
from functools import reduce
# nums = [1,2,3,4,5]
# print(reduce(mul, nums)) #結果=>120
N = int(eval(input()))
A = [int(a) for a in input().split()]
if reduce(mul, A)>10**18:
print((-1))
else:
print((reduce(mul, A))) | a=int(eval(input()))
b=input().split(" ")
sum1=1
if "0" in b:
print("0")
else:
for i in range(a):
sum1=sum1*int(b[i])
if sum1>10**18:
sum1=-1
break
print(sum1) | p02658 |
N = int(eval(input()))
a_list = list(map(int, input().split()))
res = 1
for a in a_list:
res *= a
if res > (10 ** 18):
res = -1
print(res) | N = int(eval(input()))
a_list = list(map(int, input().split()))
res = 1
if 0 in a_list:
print((0))
exit()
for a in a_list:
res *= a
if res > (10 ** 18):
res = -1
break
print(res) | p02658 |
eval(input())
l = list(map(int, input().split()))
r = 1
for i in l:
r *= i
print((-1 if r > 1e18 else r)) | eval(input())
l = list(map(int, input().split()))
if 0 in l:
print((0))
else:
r = 1
for i in l:
r *= i
if r > 1e18:
break
print((-1 if r > 1e18 else r)) | p02658 |
N = int(eval(input()))
*A, = list(map(int, input().split()))
if 0 in A: print((0))
else:
ans = 1
for a in A:
ans *= a
if ans > 10**18: ans = -1
print(ans) | N = int(eval(input()))
*A, = list(map(int, input().split()))
if 0 in A: print((0))
else:
ans = 1
for a in A:
ans *= a
if ans > 10**18: ans = -1; break
print(ans) | p02658 |
import functools
_ = eval(input())
l = list(map(int, input().split(" ")))
ans = functools.reduce(lambda x, y : x* y, l, 1)
if ans > 10**18:
print((-1))
else:
print(ans) |
import sys
_ = eval(input())
l = list(map(int, input().split(" ")))
if 0 in l:
print((0))
sys.exit()
ans = 1
for i in l:
ans *= i
if ans > 10 **18:
print((-1))
sys.exit()
print(ans) | p02658 |
from functools import reduce
n = int(eval(input()))
A = list(map(int,input().split()))
b = sorted(A)
if b[0] == 0:
ans = 0
else:
ans = reduce(lambda x,y : x * y, b)
if ans > 10**18:
print((-1))
else:
print(ans) | from functools import reduce
n = int(eval(input()))
A = list(map(int,input().split()))
b = sorted(A,reverse=True)
c = 1
if b[-1] == 0:
c = 0
else:
for i in range(n):
if c > 10 ** 18:
break
c *= b[i]
if c > 10**18:
print((-1))
else:
print(c) | p02658 |
from operator import mul
from functools import reduce
n = int(eval(input()))
lis = list(map(int, input().split()))
ans = reduce(mul, lis)
if ans > 10**18:
print("-1")
else:
print(ans) | n = int(eval(input()))
lis = list(map(int, input().split()))
if 0 in lis:
print((0))
exit()
ans = 1
for i in lis:
ans *= i
if ans >= 10**18:
break
if ans > 10**18:
print("-1")
else:
print(ans) | p02658 |
import functools
import operator
n = int(eval(input()))
a = list(map(int, input().split()))
result = functools.reduce(operator.mul, a)
if result > (10**18):
print("-1")
else:
print(result) | def main():
n = int(eval(input()))
a = list(map(int, input().split()))
if 0 in a:
print((0))
return
prod = 1
for i in a:
prod *= i
if prod > 1000000000000000000:
print((-1))
return
print(prod)
main() | p02658 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 1
for i in range(n):
ans *= a[i]
if(ans > 1000000000000000000):
print((-1))
else:
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
ans = 1
for i in range(n):
ans *= a[i]
if(ans > 1000000000000000000):
break
if(ans > 1000000000000000000):
print((-1))
else:
print(ans)
| p02658 |
n=int(eval(input()))
L=list(map(int,input().split()))
ans=1
for i in range(n):
ans=ans*L[i]
if L[i]==0:
break
if ans > 1e18:
print((-1))
else:
print(ans)
| n=int(eval(input()))
L=list(map(int,input().split()))
L.sort()
if L[0]==0:
print((0))
else:
ans=1
for i in range(n-1,-1,-1):
ans=ans*L[i]
if ans >1e18:
print((-1))
break
else:
print(ans)
| p02658 |
N=int(eval(input()))
L = [int(i) for i in input().split()]
ans = 1;
for i in range(N):
ans *= L[i]
if ans > 1000000000000000000:
ans = -1
print(ans)
| N = int(eval(input()))
L = list(map(int, input().split()))
ans = 1
if 0 in L:
print((0))
exit()
for i in range(N):
ans *= L[i]
if ans > 10**18:
print((-1))
exit()
print(ans) | p02658 |
N=int(eval(input()))
A=list(map(int,input().split()))
ans=1
for k in range(N):
ans = ans*A[k]
if ans > 1000000000000000000:
print("-1")
else:
print(ans) | N=int(eval(input()))
A=list(map(int,input().split()))
ans=1
if A.count(0) >= 1:
print((0))
else:
B=[i for i in A if i != 1]
if len(B) >= 100:
print("-1")
else:
for k in range(len(B)):
ans=ans*B[k]
if ans > 1000000000000000000:
print("-1")
else:
print(ans) | p02658 |
n = int(eval(input()))
a = list(map(int,input().split()))
a.sort
p = True
ans = 1
for i in a :
ans *= i
if(ans == 0) :
print((0))
p = False
break
if p:
if ans > 10 **18 :
print((-1))
else:
print(ans) | n = int(eval(input()))
a = list(map(int,input().split()))
a.sort()
p = True
ans = 1
for i in a :
ans *= i
if(ans == 0) :
print((0))
p = False
break
if(ans > 1000000000000000000):
print((-1))
p =False
break
if p:
if ans > 1000000000000000000:
print((-1))
else:
print(ans)
| p02658 |
n = int(eval(input()))
l = list(map(int, input().split(" ")))
a = 1
for i in range(n):
a = a*l[i]
if a>10**18:
print("-1")
else:
print(a) | import sys
n = int(eval(input()))
l = list(map(int, input().split(" ")))
l.sort()
a = 1
for i in range(n):
if a <= 10**18:
a = a*l[i]
elif a > 10**18:
print("-1")
sys.exit()
if a > 10**18:
print("-1")
else:
print(a) | p02658 |
from collections import deque
N = int(eval(input()))
A = deque(list(map(int, input().split())))
ans = 1
for i in range(N):
ans *= A.pop()
if ans > 10 ** 18:
print((-1))
else:
print(ans) | #from collections import deque
def hanbun(L):
N = len(L)
flag = N % 2
N = N // 2
ans = []
for i in range(N):
ans.append(L[2 * i] * L[2 * i + 1])
if flag == 1:
ans.append(L[-1])
return(ans)
N = int(eval(input()))
A = list(map(int, input().split()))
while len(A) > 1:
A = hanbun(A)
ans = A[0]
if ans > 10 ** 18:
print((-1))
else:
print(ans) | p02658 |
# Template 1.0
import sys, re
from collections import deque, defaultdict, Counter, OrderedDict
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log
from heapq import heappush, heappop, heapify, nlargest, nsmallest
def STR(): return list(eval(input()))
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
def list2d(a, b, c): return [[c] * b for i in range(a)]
def sortListWithIndex(listOfTuples, idx): return (sorted(listOfTuples, key=lambda x: x[idx]))
def sortDictWithVal(passedDic):
temp = sorted(list(passedDic.items()), key=lambda kv: (kv[1], kv[0]))
toret = {}
for tup in temp:
toret[tup[0]] = tup[1]
return toret
def sortDictWithKey(passedDic):
return dict(OrderedDict(sorted(passedDic.items())))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
n = INT()
a = LIST()
ans = 1
for el in a:
ans*=el
if(ans>10**18):
print((-1))
else:
print(ans) | # Template 1.0
import sys, re
from collections import deque, defaultdict, Counter, OrderedDict
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log
from heapq import heappush, heappop, heapify, nlargest, nsmallest
def STR(): return list(eval(input()))
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
def list2d(a, b, c): return [[c] * b for i in range(a)]
def sortListWithIndex(listOfTuples, idx): return (sorted(listOfTuples, key=lambda x: x[idx]))
def sortDictWithVal(passedDic):
temp = sorted(list(passedDic.items()), key=lambda kv: (kv[1], kv[0]))
toret = {}
for tup in temp:
toret[tup[0]] = tup[1]
return toret
def sortDictWithKey(passedDic):
return dict(OrderedDict(sorted(passedDic.items())))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
n = INT()
a = LIST()
a.sort()
if(0 in a):
print((0))
else:
ans = 1
for el in a:
ans*=el
if(ans>10**18):
break
if(ans>10**18):
print((-1))
else:
print(ans) | p02658 |
import math
from collections import deque
from collections import defaultdict
import time
#自作関数群
def readInt():
return int(eval(input()))
def readInts():
return list(map(int, input().split()))
def readChar():
return eval(input())
def readChars():
return input().split()
def factorization(n):
res = []
if n%2==0:
res.append(2)
for i in range(3,math.floor(n//2)+1,2):
if n%i==0:
c = 0
for j in res:
if i%j==0:
c=1
if c==0:
res.append(i)
return res
def fact2(n):
p = factorization(n)
res = []
for i in p:
c=0
z=n
while 1:
if z%i==0:
c+=1
z/=i
else:
break
res.append([i,c])
return res
def fact(n):#階乗
ans = 1
m=n
for _i in range(n-1):
ans*=m
m-=1
return ans
def comb(n,r):#コンビネーション
if n<r:
return 0
l = min(r,n-r)
m=n
u=1
for _i in range(l):
u*=m
m-=1
return u//fact(l)
def combmod(n,r,mod):
return (fact(n)/fact(n-r)*pow(fact(r),mod-2,mod))%mod
def printQueue(q):
r=copyQueue(q)
ans=[0]*r.qsize()
for i in range(r.qsize()-1,-1,-1):
ans[i] = r.get()
print(ans)
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1]*n
def find(self, x): # root
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 -1*self.parents[self.find(x)]
def same(self,x,y):
return self.find(x)==self.find(y)
def members(self,x): # much time
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()} # 1~n
def bitArr(n):#ビット全探索
x = 1
zero = "0"*n
ans = []
ans.append([0]*n)
for i in range(2**n-1):
ans.append(list([int(x) for x in list((zero+bin(x)[2:])[-1*n:])]))
x+=1
return ans;
def arrsSum(a1,a2):
for i in range(len(a1)):
a1[i]+=a2[i]
return a1
def maxValue(a,b,v):
v2 = v
for i in range(v2,-1,-1):
for j in range(v2//a+1): #j:aの個数
k = i-a*j
if k%b==0:
return i
return -1
def copyQueue(q):
nq = queue.Queue()
n = q.qsize()
for i in range(n):
x = q.get()
q.put(x)
nq.put(x)
return nq
n = readInt()
a = readInts()
ans = 1
d = defaultdict(int)
for i in a:
d[i]+=1
for k in d:
ans*=k**d[k]
if ans>10**18:
print((-1))
else:
print(ans) | import math
from collections import deque
from collections import defaultdict
#自作関数群
def readInt():
return int(eval(input()))
def readInts():
return list(map(int, input().split()))
n = readInt()
a = readInts()
ans = 1
d = defaultdict(int)
if 0 in a:
print((0))
exit()
for i in a:
d[i]+=1
for k in d:
ans*=k**d[k]
if ans>10**18:
print((-1))
exit()
else:
print(ans) | p02658 |
N = int(eval(input()))
A = [int(i) for i in input().split()]
count = 1
for i in range(N):
if A[i] == 0:
print((0))
exit()
count *= A[i]
if count > 10**18:
print((-1))
exit()
print(count) | N = int(eval(input()))
A = [int(i) for i in input().split()]
count = 1
if 0 in A:
print((0))
exit()
for i in A:
count *= i
if count > 10**18:
print((-1))
exit()
print(count) | p02658 |
def resolve():
_ = eval(input())
an = list(map(int, input().split()))
ans = 1
for a in an:
ans *= a
if ans > 10 ** 18:
ans = -1
print(ans)
if __name__ == '__main__':
resolve() | def resolve():
_ = eval(input())
an = sorted(map(int, input().split()), reverse=True)
ans = 1
if an[-1] == 0:
ans = 0
else:
for a in an:
ans *= a
if ans > 10 ** 18:
ans = -1
break
print(ans)
if __name__ == '__main__':
resolve() | p02658 |
N = int(eval(input()))
# = map(int, input().split())
A = list(map(int, input().split()))
# = [int(input()) for i in range(N)]
# = [list(map(int, input().split())) for i in range(N)]
answer = A[0]
for i in range(1, N):
answer *= A[i]
if answer > 10**18:
print((-1))
else:
print(answer)
| N = int(eval(input()))
# = map(int, input().split())
A = list(map(int, input().split()))
# = [int(input()) for i in range(N)]
# = [list(map(int, input().split())) for i in range(N)]
answer = A[0]
if A.count(0) > 0:
print((0))
exit()
for i in range(1, N):
answer = answer*A[i]
if answer > 10**18:
print((-1))
exit()
else:
print(answer)
| p02658 |
n = int(eval(input()))
a = list(map(int, input().split()))
i = 1
for x in a:
i *= x
if i > 1000000000000000000:
i = -1
print(i) | n = int(eval(input()))
a = list(map(int, input().split()))
i = 1
if 0 in a:
print((0))
exit()
for x in a:
i *= x
if i > 10 ** 18:
break
if i > 10 ** 18:
i = -1
print(i) | p02658 |
from functools import reduce
from operator import mul
N = int(eval(input()))
A = list(map(int, input().split()))
m = reduce(mul, A)
if m > 10 ** 18:
print('-1')
else:
print(m) | N = int(eval(input()))
A = list(map(int, input().split()))
mul = 1
A.sort()
for i in range(N):
mul *= A[i]
if mul == 0 or mul > 10 ** 18:
break
if mul > 10 ** 18:
print('-1')
else:
print(mul) | p02658 |
n=int(eval(input()))
l=list(map(int,input().split()))
p=1
for i in l:
p*=i
if(p>1000000000000000000):
print((-1))
else:
print(p)
1000000000000000000 | n=int(eval(input()))
l=list(map(int,input().split()))
p=1
l.sort()
for i in l:
p*=i
if(p==0):
print((0))
exit()
if(p>10**18):
print((-1))
exit()
print(p) | p02658 |
N = eval(input())
A = list(map(int, input().split()))
val = 1
for a in A:
val *= a
if val > 10 ** 18:
print((-1))
else:
print(val) | N = int(eval(input()))
A = list(map(int, input().split()))
if 0 in A:
print((0))
exit()
prod = 1
for i in range(len(A)):
prod *= A[i]
if prod > 10 ** 18:
print((-1))
exit()
print(prod) | 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 > 10 ** 18:
print("-1")
else:
print(ans) | import sys
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
if A[-1] == 0:
print((0))
sys.exit(0)
ans = A[0]
for i in range(1, N):
ans *= A[i]
if ans > 10**18:
print((-1))
sys.exit(0)
print(ans) | p02658 |
"""
~~ Author : Bhaskar
~~ Dated : 31~05~2020
"""
import sys
from bisect import *
from math import floor,sqrt,ceil,factorial as F,gcd,pi
from itertools import chain,combinations,permutations,accumulate
from collections import Counter,defaultdict,OrderedDict,deque
from array import array
INT_MAX = sys.maxsize
INT_MIN = -(sys.maxsize)-1
mod = 10**18
lcm = lambda a,b : (a*b)//gcd(a,b)
setbit = lambda x : bin(x)[2:].count("1")
def solve():
n = int(sys.stdin.readline())
a = list(map(int,sys.stdin.readline().split()))
ans = 1
flag = False
for i in a:
ans *= i
# print(ans)
if ans > mod:
flag = True
break
if 0 in a:
print((0))
else:
if not flag:
print(ans)
else:
print((-1))
if __name__ == "__main__":
solve()
| """
~~ Author : Bhaskar
~~ Dated : 13~06~2020
"""
import sys
from bisect import *
from math import floor, sqrt, ceil, factorial as F, gcd, pi
from itertools import chain, combinations, permutations, accumulate
from collections import Counter, defaultdict, OrderedDict, deque
INT_MAX = sys.maxsize
INT_MIN = -(sys.maxsize) - 1
mod = 1000000007
ch = "abcdefghijklmnopqrstuvwxyz"
lcm = lambda a, b: (a * b) // gcd(a, b)
setbit = lambda x: bin(x)[2:].count("1")
INT = lambda type: type(sys.stdin.readline()) if type in [int, float] else type(sys.stdin.readline()).replace("\n", "")
ARRAY = lambda type: list(map(type, sys.stdin.readline().split()))
NUMS = lambda type: list(map(type, sys.stdin.readline().split()))
def solve():
n = INT(int)
a = ARRAY(int)
if 0 in a:
print((0))
else:
p = 1
ok = False
for i in a:
p *= i
if p > 10**18:
ok = True
break
print((p if not ok else -1))
if __name__ == "__main__":
# try:
# sys.stdin = open("input.txt", "r")
# except:
# pass
solve()
| p02658 |
N = int(eval(input()))
A = list(input().split())
for i in range(N):
A[i] = int(A[i])
sum = 1
for i in range(N):
sum = sum * A[i]
if sum <= 10**18:
print(sum)
else:
print((-1))
| N = int(eval(input()))
A = list(input().split())
flag = 0
for i in range(N):
A[i] = int(A[i])
if A[i] == 0:
flag = -1
sum = 1
for i in range(N):
if sum <= 10**18:
sum = sum * A[i]
else:
break
if sum <= 10**18:
print(sum)
else:
if flag == -1:
print((0))
else:
print((-1)) | p02658 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
INF = 10 **18
N,*A = list(map(int, read().split()))
ans = 1
for i in A:
ans *= i
if ans <=INF:
print(ans)
else:
print((-1)) | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
INF = 10 **18
N,*A = list(map(int, read().split()))
if 0 in A:
print((0))
sys.exit()
ans = 1
for i in A:
ans *= i
if ans > INF:
print((-1))
sys.exit()
print(ans)
| p02658 |
N = int(eval(input()))
A_list = list(map(int, input().split()))
n = 1
for i in A_list:
if 0 in A_list:
print((0))
break
n = n * i
if n > 1000000000000000000:
print((-1))
break
else:
print(n) | N = int(eval(input()))
A_list = list(map(int, input().split()))
A_list.sort(reverse=True)
n = 1
for i in A_list:
if A_list[-1] == 0:
print((0))
break
n = n * i
if n > 1000000000000000000:
print((-1))
break
else:
print(n) | p02658 |
n=int(eval(input()))
a=list(map(int,input().split()))
result=1
if 0 in a:
print((0))
else:
for i in a:
result*=i
if i>10**18:
print((-1))
elif result>10**18:
print((-1))
else:
print(result)
| n=int(eval(input()))
a=list(map(int,input().split()))
result=1
if 0 in a:
print((0))
else:
for i in a:
result*=i
if result>10**18:
print((-1))
break
if result<=10**18:
print(result)
| p02658 |
n = int(eval(input()))
aa = list(map(int, input().split()))
if 0 in aa:
print("0")
else:
result = 1
for a in aa:
result *= a
if result > pow(10, 18):
result = -1
print(result)
| n = int(eval(input()))
aa = list(map(int, input().split()))
if 0 in aa:
print('0')
exit(0)
result = 1
for a in aa:
result *= a
if result > pow(10, 18):
print('-1')
exit(0)
print(result)
| p02658 |
# -*- coding: utf-8 -*-
N = int(eval(input()))
numlist = list(map(int, input().split()))
if 0 < numlist.count(0):
print('0')
quit()
total = 1
for i in numlist:
total *= i
if 10 ** 18 < total:
print('-1')
else:
print(total) | # -*- coding: utf-8 -*-
N = int(eval(input()))
numlist = list(map(int, input().split()))
if 0 < numlist.count(0):
print('0')
quit()
total = 1
for i in numlist:
total *= i
if 10 ** 18 < total:
print('-1')
quit()
print(total) | p02658 |
N = int(eval(input()))
list_A = list(map(int, input().split()))
if 0 in list_A:
print((0))
exit()
result = 1
for a in list_A:
result *= a
if result > 1e18:
print((-1))
else:
print(result) | N = int(eval(input()))
list_A = list(map(int, input().split()))
if 0 in list_A:
print((0))
exit()
result = 1
for a in list_A:
result *= a
if result > 1e18:
print((-1))
exit()
print(result) | p02658 |
if __name__ == '__main__':
INF = 10**18
n = int(eval(input()))
A = list(map(int,input().split()))
ans = 1
flg = False
for i in range(n):
if A[i] == 0:
ans = 0
break
ans = ans * A[i]
if ans > INF:
print((-1))
else:
print(ans)
| if __name__ == '__main__':
INF = 10**18
n = int(eval(input()))
A = list(map(int,input().split()))
if 0 in A:
print((0))
exit()
ans = 1
flg = False
for i in range(n):
ans = ans * A[i]
if ans > INF:
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 == 0:
print((0))
exit()
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 range(n):
ans *= a[i]
if ans > 10**18:
print((-1))
exit()
print(ans) | p02658 |
def main():
num_1 = eval(input())
lis = list(input().split())
s = 1
num_2 = int (num_1)
if 0 in lis:
return 0
for x in range(num_2):
s = s * int(lis[x])
if s > 10**18:
return -1
return s
print((main())) | def main():
num_1 = eval(input())
lis = list(map(int,input().split()))
s = 1
num_2 = int (num_1)
num = 10 ** 18
if 0 in lis:
print((0))
return
for x in range(num_2):
s = s * int(lis[x])
if s > num:
print((-1))
return
print(s)
return
main() | p02658 |
n=int(eval(input()))
l=list(map(int,input().split()))
a=l[0]
for i in range(1,n):
a*=l[i]
if a==0:
break
if a>10**18:
print((-1))
else:
print(a) | n=int(eval(input()))
l=list(map(int,input().split()))
a=l[0]
for i in range(1,n):
a*=l[i]
if a>10**18:
break
if a>10**18 and l.count(0)==0:
print((-1))
elif l.count(0)>0:
print((0))
else:
print(a) | p02658 |
from operator import mul
from functools import reduce
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()))
ans = 1
if 0 in a:
print((0))
exit()
for i in range(n):
ans = ans * a[i]
if ans>10**18:
print((-1))
exit()
print(ans) | p02658 |
N = int(eval(input()))
numbers = [int(n) for n in input().split()]
mlt = 1
for n in numbers:
mlt *= n
if mlt > 1000000000000000000:
mlt = -1
print(mlt)
| N = int(eval(input()))
numbers = [int(n) for n in input().split()]
mlt = 1
if 0 in numbers:
print((0))
else:
for n in numbers:
mlt *= n
if mlt > 1000000000000000000:
mlt = -1
break
print(mlt)
| p02658 |
n = int(input().strip())
a = list(map(int, input().split()))
ans = 1
for elem in a:
ans *= elem
if 10 ** 18 < ans:
print((-1))
else:
print(ans)
| n = int(input().strip())
a = list(map(int, input().split()))
ans = 1
if 0 in a:
print((0))
else:
for elem in a:
ans *= elem
if 10 ** 18 < ans:
print((-1))
exit()
print(ans)
| p02658 |
n = int(eval(input()))
re = 1
li = list(map(int, input().split()))
for i in range(n):
re = re * li[i]
if re > 1000000000000000000:
print((-1))
else:
print(re)
| n = int(eval(input()))
re = 1
li = list(map(int, input().split()))
for i in range(n):
if re > 1000000000000000000:
break
re = re * li[i]
if 0 in li:
print((0))
elif re > 1000000000000000000:
print((-1))
else:
print(re)
| p02658 |
n = int(eval(input()))
A = [*list(map(int,input().split()))]
# print(n,A)
ans = 1
for a in A:
ans *=a
if ans > 10**18: ans = -1
print(ans)
| n = int(eval(input()))
A = [*list(map(int,input().split()))]
A.sort()
# print(n,A)
ans = 1
for a in A:
if a == 0:
ans = 0
break
ans *= a
if ans > 10**18:
ans = -1
break
print(ans)
| p02658 |
n = int(eval(input()))
a = [int(i) for i in input().split()]
x = 1
for i in range(n):
#print(a[i])
x = x*a[i]
if x>1000000000000000000:
print((-1))
else:
print(x) | n = int(eval(input()))
a = [int(i) for i in input().split()]
x = 1
f = 0
a.sort()
for i in range(n):
#print(a[i])
x = x*a[i]
if x == 0:
print((0))
f = 1
break
elif x > 1000000000000000000:
print((-1))
f = 1
break
if f == 0:
print(x) | p02658 |
n = int(eval(input()))
ans = 1
nums = list([int(x) for x in input().split()])
for i in range(n):
ans *= nums[i]
if ans > 10**18:
ans = -1
print(ans) | n = int(eval(input()))
ans = 1
nums = list([int(x) for x in input().split()])
for i in range(n):
if nums[i] == 0:
ans = 0
break
for k in range(n):
ans *= nums[k]
if ans > 10**18:
ans = -1
break
print(ans) | p02658 |
n = int(eval(input()))
arr = []
p = 1
c = 0
a = list(map(int,input().strip().split()))[:n]
for i in range(n):
if a[i]==0:
c = 1
p *= a[i]
if c == 1:
print((0))
elif p > 1000000000000000000:
print((-1))
else:
print(p)
| n = int(eval(input()))
arr = []
p = 1
c = 0
l = 0
a = list(map(int,input().strip().split()))[:n]
for i in range(n):
if a[i]==0:
c = 1
if p > 1000000000000000000:
l = 1
else:
p *= a[i]
if c == 1:
print((0))
elif l == 1 or p > 1000000000000000000 :
print((-1))
else:
print(p)
| p02658 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 1
for e in a:
ans *= e
if ans > 10 ** 18:
print('-1')
exit()
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
ans = 1
for e in a:
ans *= e
if ans > 10 ** 18:
print('-1')
exit()
print(ans)
| p02658 |
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 1
for a in A:
ans *= a
if 0 in A:
ans = 0
break
elif ans > 10**18:
ans = -1
break
print(ans) | N = int(eval(input()))
A = list(map(int, input().split()))
if 0 in A:
ans = [0]
else:
ans = [1]*N
for i,a in enumerate(A):
if i==0:
ans[i] = a
else:
ans[i] = ans[i-1]*a
if ans[i] > 10**18:
ans[-1] = -1
break
print((ans[-1])) | p02658 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.