input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import math
def factorize(m):
fct = []
b = 2
while b * b <= m:
cnt = 0
while m % b == 0:
m //= b
cnt += 1
if b > 0:
fct.append([b, cnt])
b += 1
if m > 1:
fct.append([m, 1])
return fct
def comb(n, r):
i... | import math
def factorize(m):
fct = []
b = 2
while b * b <= m:
cnt = 0
while m % b == 0:
m //= b
cnt += 1
if cnt > 0:
fct.append(cnt)
b += 1
if m > 1:
fct.append(1)
return fct
def comb(n, r):
if n < r o... | p03253 |
# encoding: utf-8
import math
N, M = list(map(int, input().split()))
def distribute(pos, full, tmp):
return memo[tmp][pos]
# define search range
p_max = M // 2 # M is prime if M has a factor p (> p_max)
ip_up = max((1, int(math.log2(M)))) # MDE
#### O(MlogM) below (if M has a very large prime factor)
... | # encoding: utf-8
import math
N, M = list(map(int, input().split()))
ips = []
M_tmp = M
for p in range(2, int(math.sqrt(M)) + 1):
if M_tmp % p > 0: continue
for i_p in range(1, 33):
if M_tmp % (p ** (i_p + 1)) > 0: break
ips.append(i_p)
M_tmp = M_tmp // (p ** i_p)
if M_tmp == 1:... | p03253 |
#!/usr/bin/env python
import collections
from operator import mul
from functools import reduce
N, M = list(map(int, input().split()))
def cmb(n, r):
r = min(r, n-r)
if r==0: return 1
over = reduce(mul, list(range(n, n-r, -1)))
under = reduce(mul, list(range(1, r+1)))
return over // under... | #!/usr/bin/env python
import collections
from operator import mul
from functools import reduce
N, M = list(map(int, input().split()))
def cmb(n, r):
r = min(r, n-r)
if r==0: return 1
over = reduce(mul, list(range(n, n-r, -1)))
under = reduce(mul, list(range(1, r+1)))
return over // under... | p03253 |
# coding:utf-8
INF = float('inf')
MOD = 10 ** 9 + 7
def inpl(): return list(map(int, input().split()))
# nの素因数分解を求めるアルゴリズム
def p_factorization(n):
tmp = []
i = 2
cnt = 0
while n > 1:
if n % i == 0:
cnt += 1
n //= i
else:
tmp.app... | # coding:utf-8
INF = float('inf')
MOD = 10 ** 9 + 7
def inpl(): return list(map(int, input().split()))
# aのp乗を求めるアルゴリズム
# MOD版
# O(logp)
def pow_mod(a, p):
if p == 0: return 1
if p % 2 == 0:
half_p = p // 2
half = pow_mod(a, half_p)
return half * half % MOD
e... | p03253 |
N,M = list(map(int,input().split()))
from collections import Counter
def factorize(n):
d = Counter()
m = 2
while m*m <= n:
while n%m == 0:
n //= m
d[m] += 1
m += 1
if n > 1:
d[n] += 1
return d
MOD = 10**9+7
MAX = 2*10**5
fac = [1... | N,M = list(map(int,input().split()))
MOD = 10**9+7
from collections import Counter
def factorize(n):
d = Counter()
m = 2
while m*m <= n:
while n%m == 0:
n //= m
d[m] += 1
m += 1
if n > 1:
d[n] += 1
return d
MAXN = N+99
fac = [1,1] + ... | p03253 |
N,M = list(map(int,input().split()))
MOD = 10**9+7
MAXN = N+200
fac = [1,1] + [0]*MAXN
finv = [1,1] + [0]*MAXN
inv = [0,1] + [0]*MAXN
for i in range(2,MAXN+2):
fac[i] = fac[i-1] * i % MOD
inv[i] = -inv[MOD%i] * (MOD // i) % MOD
finv[i] = finv[i-1] * inv[i] % MOD
def ncr(n,r):
if n < r: retu... | N,M = list(map(int,input().split()))
MOD = 10**9+7
MAXN = N+100
fac = [1,1] + [0]*MAXN
finv = [1,1] + [0]*MAXN
inv = [0,1] + [0]*MAXN
for i in range(2,MAXN+2):
fac[i] = fac[i-1] * i % MOD
inv[i] = -inv[MOD%i] * (MOD // i) % MOD
finv[i] = finv[i-1] * inv[i] % MOD
def comb(n,r):
if n < r: ret... | p03253 |
n,m=list(map(int, input().split()))
def combination(n,r):
r=min(r,n-r)
result=1
for i in range(n-r+1,n+1):
result*=i
for i in range(1,r+1):
result//=i
return result
def factorize(n):
i=2
result={}
while True:
if i**2>n:
break
... | n,m=list(map(int, input().split()))
def combination(n,r):
r=min(r,n-r)
result=1
for i in range(n-r+1,n+1):
result*=i
for i in range(1,r+1):
result//=i
return result
def factorize(n):
f=[]
p=2
cnt=0
while p**2<=n:
while n%p==0:
cn... | p03253 |
N, M = list(map(int, input().split()))
MOD = 10 ** 9 + 7
def prime_counter(n):
ret = []
for i in range(2, int(n / 2) + 2):
count = 0
while n % i == 0:
n /= i
count += 1
if 0 < count:
ret.append(count)
if n == 1:
br... | MOD = 10 ** 9 + 7
N, M = list(map(int, input().split()))
f = []
p = 2
while p * p <= M:
if M % p != 0:
p += 1
continue
c = 0
while M % p == 0:
c += 1
M //= p
f.append(c)
p += 1
if M != 1:
f.append(1)
ans = 1
for i in f:
c = 1
for j... | p03253 |
from math import *
def Prime_Factorization(M):
factor_count_list = []
root_M = int(sqrt(M))
while root_M > 1:
root_M = int(sqrt(M))
for i in range(2, root_M + 1):
e = 0
while M % i == 0:
e += 1
M = M // i
if... | from math import *
def Prime_Factorization(M):
factor_count_list = []
root_M = int(sqrt(M))
while root_M > 1:
root_M = int(sqrt(M))
for i in range(2, root_M + 1):
e = 0
while M % i == 0:
e += 1
M = M // i
if... | p03253 |
from math import factorial
def comb(n, r):
return factorial(n) // factorial(r) // factorial(n - r)
n, m= [int(i) for i in input().split(" ")]
c = []
i = 2
mt = m
while i * i <= mt:
ci = 0
while mt % i == 0:
mt = mt // i
ci += 1
if ci > 0:
c.append(ci)
i ... | from operator import mul
from functools import reduce
def comb(n,r):
r = min(n-r,r)
if r == 0: return 1
over = reduce(mul, list(range(n, n - r, -1)))
under = reduce(mul, list(range(1,r + 1)))
return over // under
n, m= [int(i) for i in input().split(" ")]
c = []
i = 2
mt = m
whil... | p03253 |
N,M = list(map(int,input().split()))
div =[]
for i in range(2,int(M**(1/2))+2):
cur = 0
while M%i==0:
M = M//i
cur += 1
if cur >=1:
div.append(cur)
if M>1: div.append(1)
div.sort()
mod = 10**9+7
frac = [1]*(N+50)
num = len(frac)
for i in range(len(frac)-1):
frac[i+... | N,M = list(map(int,input().split()))
div = []
for i in range(2,int(M**(1/2))+2):
cur = 0
while M%i==0:
M//=i
cur += 1
if cur >=1:
div.append(cur)
if M>1:div.append(1)
div.sort()
mod = 10**9+7
frac = [1]*(N+50)
num=len(frac)
for i in range(num-1):
frac[i+1] = frac[i... | p03253 |
mod = 10**9 + 7
def factorize(n):
# http://nihaoshijie.hatenadiary.jp/entry/2018/02/03/115759
fct = []
b, e = 2, 0
while b * b <= n:
while n % b == 0:
n = n // b
e = e + 1
if e > 0:
fct.append(e)
b, e = b + 1, 0
if n > 1:
... | from collections import Counter
mod = 10**9 + 7
n, m = list(map(int, input().split()))
def fact(m):
c = Counter()
s = 2
while s**2 <= m:
if m % s:
s += 1
continue
while m % s == 0:
c[s] += 1
m //= s
if m > 1:
c[m] +=... | p03253 |
N, M = [int(_) for _ in input().split()]
MOD = 10**9+7
def primes(n):
from math import sqrt
mn = int(sqrt(n)) + 2
p = [1] * mn
for x in range(2, mn):
if p[x]:
y = x * x
while y < mn:
p[y] = 0
y += x
return (i for i in ra... | N, M = [int(_) for _ in input().split()]
MOD = 10**9+7
def factorize(n):
from math import sqrt
m = int(sqrt(n)) + 1
p = [True] * m
result = {}
for x in range(2, m):
if p[x]:
p[x * 2::x] = [False] * ((m - 1) // x - 1)
i = 0
while 1:
... | p03253 |
import math
def prime_factorize(n):
ret = []
# 小さい素数から順に試し割りしていく
for i in range(2, int(math.sqrt(n))+1):
if n % i != 0:
continue
e = 0
while n % i == 0:
e += 1
n //= i
ret += [(i, e)]
if n != 1:
ret += [(n, 1)]
... | def prime_factor(n):
ret, p = {}, 2
while p*p <= n:
while n % p == 0:
ret[p] = ret.get(p, 0) + 1
n //= p
p += 1
if n != 1: ret[n] = 1
return ret
def mod_inverse(x, mod):
return pow(x, mod-2, mod)
def mod_comb(n, k, mod):
numer, denom = ... | p03253 |
import math
N, M = list(map(int, input().split()))
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... | def main():
N, M = list(map(int, input().split()))
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... | p03253 |
n, m = list(map(int, input().split()))
mod = 1000000007
d = 1
divisor = []
while d * d <= m:
if m % d == 0:
divisor.append(d)
if d != m // d:
divisor.append(m // d)
d += 1
divisor = sorted(divisor)
l = len(divisor)
matrix = [[0] * l for _ in range(l)]
for i in range(l):
... | n, m = list(map(int, input().split()))
mod = 1000000007
def cmb(n, k):
ret = 1
for i in range(k):
ret *= n - i
ret //= i + 1
return ret % mod
primes = [2]
for p in range(3, 1000):
if all(p % q for q in primes):
primes.append(p)
ret = 1
for p in primes:
q ... | p03253 |
import sys
sys.setrecursionlimit(100000)
n, m = list(map(int, input().split()))
MOD = 10 ** 9 + 7
if m == 1:
print('1')
exit()
factor = []
temp = 0
x = 2
while m > 1:
if m % x == 0:
m //= x
temp += 1
elif temp > 0:
factor.append(temp)
temp = 0
... | n, m = list(map(int, input().split()))
MOD = 10 ** 9 + 7
if m == 1:
print('1')
exit()
factor = []
temp = 0
x = 2
while m > 1:
if m % x == 0:
m //= x
temp += 1
elif temp > 0:
factor.append(temp)
temp = 0
x += 1
else:
x += 1
facto... | p03253 |
import math
def nCr(n,r):
return math.factorial(n) // (math.factorial(r) * math.factorial(n-r))
N,M = list(map(int,input().split()))
l = [2]
now = 3
while now ** 2 <= M:
flag = True
for i in l:
if now % i == 0:
flag = False
break
if flag:
l.... | import sys
mod = 1000000007
def mul(a, b):
return ((a % mod) * (b % mod)) % mod
def power(x, y):
if y == 0 : return 1
elif y == 1 : return x % mod
elif y % 2 == 0 : return power(x, y//2)**2 % mod
else : return power(x, y//2)**2 * x % mod
def div(a, b):
return... | p03253 |
import math
import collections
Max = 210000
Mod = 1000000007
fac = [0] * Max
finv = [0] * Max
inv = [0] * Max
def COMinit():
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2, Max):
fac[i] = fac[i-1] * i % Mod
inv[i] = Mod - inv[Mod%i] * (Mod//i) % Mod... | import math
import collections
Mod = 1000000007
fac = [1, 1]
finv = [1, 1]
inv = [0, 1]
def COMinit():
for i in range(2, N+111):
fac.append(fac[-1]*i%Mod)
inv.append((-inv[Mod%i] * (Mod//i)) % Mod)
finv.append(finv[-1] * inv[-1] % Mod)
def COM(n, k):
if n < 0 or k <... | p03253 |
import math
from collections import Counter
n, m =list(map(int, input().split()))
mod = 10**9+7
prime_count = Counter()
for i in range(2, math.ceil(math.sqrt(m))+1):
while m % i == 0:
m /= i
prime_count[i] += 1
if m > 1:
prime_count[int(m)] += 1
def ncr(n, r, p):
num = ... | import math
from collections import Counter
n, m = list(map(int, input().split()))
prime_count = Counter()
for i in range(2, math.ceil(math.sqrt(m))+1):
while m % i == 0:
m /= i
prime_count[i] += 1
if m > 1:
prime_count[int(m)] += 1
def ncr(n, r, p):
num = den = 1
for... | p03253 |
import math
from collections import Counter
n, m = list(map(int, input().split()))
prime_count = Counter()
for i in range(2, math.ceil(math.sqrt(m))+1):
while m % i == 0:
m /= i
prime_count[i] += 1
if m > 1:
prime_count[int(m)] += 1
def ncr(n, r, p):
num = den = 1
for... | import math
from collections import Counter
n, m = list(map(int, input().split()))
prime_count = Counter()
for i in range(2, math.ceil(math.sqrt(m))+1):
while m % i == 0:
m /= i
prime_count[i] += 1
if m > 1:
prime_count[int(m)] += 1
def ncr(n, r, p):
num = den = 1
for i i... | p03253 |
n,m=list(map(int,input().split()))
i=2
s=[]
while 1<m:
j=0
while m % (i**(j+1))==0:
j+=1
if j:
m//=i**j
s+=[j]
i+=1
a=1
for v in s:
c = 1
for i in range(v):
c = c * (n+i) // (1+i)
a = a * c % (10**9+7)
print(a)
| n,m=list(map(int,input().split()))
i=2
s=[]
while i*i<=m:
j=0
while m % i == 0:
m//=i
j+=1
if j:
s+=[j]
i+=1
a=1
if m > 1:
s+=[1]
for v in s:
c = 1
for i in range(v):
c = c * (n+i) // (1+i)
a = a * c % (10**9+7)
print(a)
| p03253 |
import math
N,M = list(map(int,input().split(" ")))
MOD = 10 ** 9 + 7
def factorize(n):
fct = [] # prime factor
b, e = 2, 0 # base, exponent
while b * b <= n:
while n % b == 0:
n = n // b
e = e + 1
if e > 0:
fct.append((b, e))
b, e = ... | import math
N,M = list(map(int,input().split(" ")))
MOD = 10 ** 9 + 7
def factorize(n):
fct = [] # prime factor
b, e = 2, 0 # base, exponent
while b * b <= n:
while n % b == 0:
n = n // b
e = e + 1
if e > 0:
fct.append((b, e))
b, e = ... | p03253 |
n,m=list(map(int,input().split()))
import math
sosuu=[]
m0=m
i=2
while i**2<=m:
if m0%i==0:
sosuu.append(0)
while m0%i==0:
m0=m0//i
sosuu[-1]=sosuu[-1]+1
i=i+1
if m0>1:
sosuu.append(1)
def c(n,r):
return math.factorial(n)//(math.factorial(r)*math.factorial(n-... | n,M=list(map(int,input().split()))
from math import factorial
i=2
c_list=[]
m=M
while not m==1:
count=0
while m%i==0:
m=m//i
count=count+1
if not count==0:
c_list.append(count)
i=i+1
if M==1:
print((1))
else:
INF=10**9+7
Sum=1
for i in c_list:
... | p03253 |
n,M=list(map(int,input().split()))
from math import factorial
i=2
c_list=[]
m=M
while i**2<=M:
count=0
while m%i==0:
m=m//i
count=count+1
if not count==0:
c_list.append(count)
i=i+1
if not m==1:
c_list.append(1)
if M==1:
print((1))
else:
INF=10**9+7
... | n,M=list(map(int,input().split()))
i=2
c_list=[]
m=M
while i**2<=M:
count=0
while m%i==0:
m=m//i
count=count+1
if not count==0:
c_list.append(count)
i=i+1
if not m==1:
c_list.append(1)
def comb(x,y):
a=1
for i in range(x-y+1,x+1):
a=a*i
b... | p03253 |
iN,iM = [int(x) for x in input().split()]
iD = 10**9 +7 #法
def fPrimeCounter(iM):
i = 2
iS = int(iM ** 0.5) + 1
aRet = []
while i < iS or iM != 1:
iCounter = 0
while iM % i == 0:
iM = iM // i
iCounter += 1
if 0 < iCounter : aRet.append(iCounte... |
iN,iM = [int(x) for x in input().split()]
iD = 10**9 +7 #法
def fPrimeCounter(iM):
iS = int(iM ** 0.5) + 1
aRet = []
for i in range(2,iS + 1):
iCounter = 0
while iM % i == 0:
iM = iM / i
iCounter += 1
if 0 < iCounter : aRet.append(iCounter)
... | p03253 |
from math import factorial
iN,iM = [int(x) for x in input().split()]
iD = 10**9 +7 #法
def fPrimeCounter(iM):
iS = int(iM ** 0.5) + 1
aRet = []
for i in range(2,iS + 1):
iCounter = 0
while iM % i == 0:
iM = iM / i
iCounter += 1
if 0 < iCounter : ... |
iN,iM = [int(x) for x in input().split()]
iD = 10**9 +7 #法
def fPrimeCounter(iM):
iS = int(iM ** 0.5) + 1
aRet = []
for i in range(2,iS + 1):
iCounter = 0
while iM % i == 0:
iM /= i
iCounter += 1
if 0 < iCounter : aRet.append(iCounter)
i... | p03253 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n, m = list(map(int, input().split()))
MOD = 10 ** 9 + 7
factorial = [0] * (10 ** 6 + 1)
inverse = [0] * (10 ** 6 + 1)
factorial[0] = inverse[0] = 1
for i in range(1, 10 ** 6 + 1):
factorial[i] = (factorial[i-1] * i) % MOD
invers... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n, m = list(map(int, input().split()))
MOD = 10 ** 9 + 7
prime_factors = []
i = 2
while i ** 2 <= m:
ext = 0
while m % i == 0:
ext += 1
m //= i
if ext:
prime_factors.append((i, ext))
i += 1
if... | p03253 |
import math
def combination(n,k):
return (math.factorial(n)//math.factorial(k))//math.factorial(n-k)
R = 10**9 + 7
(N, M) = list(map(int,input().split()))
decomposition = []
i = 2
while i * i <= M:
if M % i == 0:
decomposition.append(0)
while M % i ==0:
decompositi... | import math
R = 10**9 + 7
def combination(n,k):
if 2*k > n:
k = n - k
r = 1
for i in range(n-k+1,n+1):
r = (r*i)
r = (r//math.factorial(k))
return r
(N, M) = list(map(int,input().split()))
decomposition = []
i = 2
while i * i <= M:
if M % i == 0:
... | p03253 |
inpl = lambda: list(map(int,input().split()))
MOD = 10**9 + 7
N, M = inpl()
def factorize(n):
prime_list = []
factorize_list = []
i = 2
while i*i <= n:
for p in prime_list:
if i % p == 0:
break
else:
prime_list.append(i)
k = 0
while n % i == 0:
n... | inpl = lambda: list(map(int,input().split()))
MOD = 10**9 + 7
N, M = inpl()
def factorize(n):
factorize_list = []
i = 2
while i*i <= n:
k = 0
while n % i == 0:
n //= i
k += 1
if k > 0:
factorize_list.append(k)
i += 1
if n > 1:
factorize_list.append(1)
r... | p03253 |
import math
def isprime(n):
if(n<2):
return False
for i in range(2,int(n**0.5)+1):
if(n%i==0):
return False
return True
def primelist(n):
return [i for i in range(n) if isprime(i)]
def factor(n):
f = {}
for p in primelist(int(n**0.5)+1):
whi... | import math
def factorize(n):
ret={}
i = 2
while n >= i**2:
cnt = 0
while n % i == 0:
n //= i
cnt += 1
if cnt != 0:
ret[i] = cnt
i += 1
if n != 1:
ret[n] = 1
return ret
def combination(n,r):
ret = 1
... | p03253 |
# 2 6=>4 (1,6)*2,(2,3)*2
# 3 12=>18 (1,1,12)*3,(1,2,6)*6,(1,3,4)*6,(2,2,3)*3
import math
def comb(a,b): # aCb
return math.factorial(a)//math.factorial(a-b)//math.factorial(b)
n,m=list(map(int,input().split()))
divisor={}
tmp=m
# for i in range(2,m+1):
i=2
while i*i<=m:
while tmp%i==0:
tmp/... | # うまく効率化できなかった
# 2 6=>4 (1,6)*2,(2,3)*2
# 3 12=>18 (1,1,12)*3,(1,2,6)*6,(1,3,4)*6,(2,2,3)*3
# import math
# def comb(a,b):
# return math.factorial(a)//math.factorial(a-b)//math.factorial(b)
def comb(a,b): # aCb
b=min(b,a-b)
result=1
for i in range(a,a-b,-1):
result*=i
for i in ran... | p03253 |
def com(n,m):
if(n-m < m):
m=n-m
result=1
mylist=[i for i in range(1,m+1)]
j=1
for i in range(1,m+1):
result*=(n+1-i)
if(j<m):
while(result%mylist[j]==0):
result//=mylist[j]
j+=1
if(j>=m):
... | def com(n,m):
if(n-m < m):
m=n-m
result=1
mylist=[i for i in range(1,m+1)]
j=1
for i in range(1,m+1):
result*=(n+1-i)
if(j<m):
while(result%mylist[j]==0):
result//=mylist[j]
j+=1
if(j>=m):
... | p03253 |
from itertools import groupby
from math import factorial
def prime_factors(n):
i = 2
factors = []
while i * i <= n:
if n % i:
i += 1
else:
n //= i
factors.append(i)
if n > 1:
factors.append(n)
return factors
def comb(n... | import operator as op
from itertools import groupby
from functools import reduce
NN = 10 ** 9 + 7
def prime_factors(n):
i = 2
while i * i <= n:
if n % i:
i += 1
else:
n //= i
yield i
if n > 1:
yield n
def ncr(n, r):
r =... | p03253 |
import math
def prime_factor(n):
ass = []
for i in range(2,int(n**0.5)+1):
while n % i==0:
ass.append(i)
n = n//i
if n != 1:
ass.append(n)
return ass
N,M = list(map(int,input().split()))
L = prime_factor(M)
L.append(0)
K = []
cur = L[0]
cnt = 0
for... | import math
def prime_factor(n):
ass = []
for i in range(2,int(n**0.5)+1):
while n % i==0:
ass.append(i)
n = n//i
if n != 1:
ass.append(n)
return ass
N,M = list(map(int,input().split()))
L = prime_factor(M)
L.append(0)
K = []
cur = L[0]
cnt = 0
for... | p03253 |
"""
---アルゴリズム概要---
a1 ~ anの各スロットに、Mの各素因数をいくつ置くか、という問題。
まずは、Mを素因数分解し、それから重複組み合わせの容量で、各素因数ごとに配分パターンを算出。
それらの配分パターンを素因数間でかけ合わせると、答えとなる。
Mの素因数分解は、試し割り法という最もシンプルな方法で行う。
"""
from collections import Counter
import math
N,M = list(map(int,input().split()))
factors = []
while True:
if M % 2 == 0:
M //... | """
---アルゴリズム概要---
Mを構成する素因数を、a1~aNの各スロットにいくつ置くのか、を考える問題。
まずは試し割りによってMを素因数分解。
重複組合せの公式で各素因数の配置パターンを算出し累乗していく。
試し割りは、O(√M)の計算量で処理できる。
√Mを超える素因数は、多くても一つしか存在しないため、√Mを超える値で試し割りをする必要はない。
もし√Mまでの値で試し割りを終えた段階で、Mを素因数分解しきれていなければ、残った商こそが√Mを超える唯一の素因数である。
簡単に証明
もし√Mを超える素因数が２つ存在しているとしよう。
それらは、(√M + α)と(√M + β)というふうに表す... | p03253 |
import math
N, M = list(map(int, input().split(' ')))
MOD = int(1e9 + 7)
primes = []
if M % 2 == 0:
primes.append(2)
def is_prime(n):
for i in range(len(primes)):
if n % primes[i] == 0:
return False
return True
for i in range(3, int(1e5)):
if is_prime(i):
primes.append(i)
seeds = [... | N, M = list(map(int, input().split(' ')))
MOD = int(1e9 + 7)
primes = []
if M % 2 == 0:
primes.append(2)
seeds = []
p = 2
while M > 1:
while M % p == 0:
seeds.append(p)
M = M // p
if p*p > M:
if M != 1:
seeds.append(M)
M = 0
p += 1
def comb(n, k):
ans = 1
for i in ... | p03253 |
from itertools import groupby
N, M = list(map(int, input().split()))
mod = 10 ** 9 + 7
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
... | from itertools import groupby
from operator import mul
from functools import reduce
N, M = list(map(int, input().split()))
mod = 10 ** 9 + 7
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
... | p03253 |
def d_factorization(N, M):
def prime_factorization_dict(n):
if n == 1:
return {2: 0} # 1は素数の0乗の積とみなす
i = 2
table = {}
while i**2 <= n:
table[i] = 0
while n % i == 0:
table[i] += 1
n //= i
if t... | def d_factorization(MOD=10**9 + 7):
N, M = [int(i) for i in input().split()]
def prime_factorization_dict(n):
if n == 1:
return {2: 0} # 1は素数の0乗の積とみなす
i, table = 2, {}
while i**2 <= n:
table[i] = 0
while n % i == 0:
table[i]... | p03253 |
def d_factorization(MOD=10**9 + 7):
N, M = [int(i) for i in input().split()]
def prime_factorization_dict(n):
if n == 1:
return {2: 0} # 1は素数の0乗の積とみなす
i, table = 2, {}
while i**2 <= n:
table[i] = 0
while n % i == 0:
table[i]... | def d_factorization(MOD=10**9 + 7):
N, M = [int(i) for i in input().split()]
def prime_factorization_dict(n):
if n == 1:
return {2: 0} # 1は素数の0乗の積とみなす
i, table = 2, {}
while i**2 <= n:
table[i] = 0
while n % i == 0:
table[i]... | p03253 |
import collections
import math
n,m=list(map(int,input().split()))
flag=0
P=[]
p=m
while flag==0:
cur=p
for i in range(2,int(p**0.5)+1):
if p%i==0:
P.append(i)
p//=i
break
if p==cur:
P.append(p)
flag=1
c=collections.Counter(P)
Primes=set(P)
def f(i):
return math.f... | import sys
input=lambda: sys.stdin.readline().rstrip()
mod=10**9+7
n,m=list(map(int,input().split()))
n_max=2*(10**5+1)
F,FI=[0]*(n_max+1),[0]*(n_max+1)
F[0],FI[0]=1,1
for i in range(n_max):
F[i+1]=(F[i]*(i+1))%mod
FI[n_max-1]=pow(F[n_max-1],mod-2,mod)
for i in reversed(list(range(n_max-1))):
FI[i]=(FI[i... | p03253 |
import math
def factoring(n,dict_count = {}):
sup = math.floor(pow(n,1/2))
n_new = n
for i in range(2,sup + 1):
if n % i == 0:
n_new = n // i
if i in dict_count:
dict_count[i] += 1
else:
dict_count[i] = 1
brea... | # 素因数分解 ソート済みリスト (素因数,指数)
import math
def factoring(n,dict_count = {}):
sup = math.floor(pow(n,1/2))
n_new = n
for i in range(2,sup + 1):
if n % i == 0:
n_new = n // i
if i in dict_count:
dict_count[i] += 1
else:
dict_cou... | p03253 |
from collections import defaultdict
n,m=list(map(int,input().split()))
mod=10**9+7
kaidan=[1]*(2*10**5+1)
gyaku=[1]*(2*10**5+1)
for i in range(1, 2*10**5):
kaidan[i]=i*kaidan[i-1] % mod
gyaku[i]=pow(kaidan[i],mod-2,mod)
def comb(a,b):
if a>0 and b>0 and a-b>0:
return (kaidan[a] * gyaku[b... | from collections import defaultdict
n,m=list(map(int,input().split()))
mod=10**9+7
kaidan=[1]*(2*10**5+1)
gyaku=[1]*(2*10**5+1)
for i in range(1, 2*10**5):
kaidan[i]=i*kaidan[i-1] % mod
gyaku[i]=pow(kaidan[i],mod-2,mod)
def comb(a,b):
if a>0 and b>0 and a-b>0:
return (kaidan[a] * gyaku[b... | p03253 |
import sys
sys.setrecursionlimit(10**9)
def mi(): return list(map(int,input().split()))
def ii(): return int(eval(input()))
def isp(): return input().split()
def deb(text): print(("-------\n{}\n-------".format(text)))
INF=10**20
class Counting():
def __init__(self,maxim,mod):
maxim += 1
... | import sys
sys.setrecursionlimit(10**9)
def mi(): return list(map(int,input().split()))
def ii(): return int(eval(input()))
def isp(): return input().split()
def deb(text): print(("-------\n{}\n-------".format(text)))
INF=10**20
class Counting():
def __init__(self,maxim,mod):
maxim += 1
... | p03253 |
import sys
N = int(eval(input()))
N = list(map(int,input().split()))
C= 1
if N==0:
print((0))
sys.exit()
for i in N:
C = C*i
if C > (10 ** 18):
C=-1
print(C) | def mul2():
n = int(eval(input()))
a = list(map(int, input().split()))
if 0 in a:
return 0
ans = 1
for i in a:
ans *= i
if ans > 1000000000000000000:
return -1
return ans
print((mul2())) | p02658 |
# ABC169 B Multiplication 2
from collections import deque
n = int(eval(input()))
a_list = deque([int(x) for x in input().split()])
ans = 1
for i in range(n):
ans *= a_list.popleft()
if ans > 10**18:
print("-1")
else:
print(ans) | # ABC169 B Multiplication 2
from collections import deque
n = int(eval(input()))
a_list = [int(x) for x in input().split()]
if min(a_list) == 0:
print("0")
else:
a_dq = deque(a_list)
ans = 1
for i in range(n):
ans *= a_dq.popleft()
if ans > 10**18:
break
... | p02658 |
import sys
sys.setrecursionlimit(10000000)
input=sys.stdin.readline
n = int(eval(input()))
l = list(map(int,input().split()))
a=10**18
ans=1
for i in l:
ans*=i
if ans > a:print((-1));exit()
print(ans) | import sys
sys.setrecursionlimit(10000000)
input=sys.stdin.readline
n = int(eval(input()))
l = list(map(int,input().split()))
if 0 in l:print((0));exit()
a=10**18
ans=1
for i in l:
ans*=i
if ans > a:print((-1));exit()
print(ans) | p02658 |
N = int(eval(input()))
A=[int(i) for i in input().split()]
answer=1
for i in range(N):
answer = answer*A[i]
if answer>10**18:
print((-1))
else:
print(answer) | N = int(eval(input()))
A=[int(i) for i in input().split()]
answer=1
if 0 in A:
print((0))
else:
for i in range(N):
answer = answer*A[i]
if answer>10**18:
print((-1))
break
else:
print(answer) | p02658 |
N = int(eval(input()))
A = list(map(int, input().split()))
x = 1
for i in A:
x *= i
if x > 10**18:
print((-1))
else:
print(x) | N = int(eval(input()))
A = list(map(int, input().split()))
x = 1
if 0 in A:
print((0))
else:
for i in A:
x *= i
if x > 10**18:
break
if x > 10**18:
print((-1))
else:
print(x) | p02658 |
import sys
n = int(eval(input()))
a = list(map(int,input().split()))
c = 1
for i in range(n):
c *= a[i]
if (c > (10**18)):
print("-1")
sys.exit()
else:
print(c)
| import sys
n = int(eval(input()))
a = list(map(int,input().split()))
c = 1
for i in range(n):
if(a[i] == 0):
print("0")
sys.exit()
else:
for i in range(n):
c *= a[i]
if (c > (10**18)):
print("-1")
sys.exit()
print(c)
| p02658 |
n = int(input().strip())
arr = list(map(int, input().strip().split()))
ans = 1
for num in arr:
ans *= num
if ans > 10**18:
print((-1))
else:
print(ans)
|
n = int(input().strip())
arr = list(map(int, input().strip().split()))
arr.sort()
ans = 1
for num in arr:
ans *= num
if ans > 10**18:
print((-1))
exit(0)
print(ans)
| p02658 |
from sys import stdin
input = stdin.readline
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 1
for ta in a:
ans *= ta
if (ans > 10 ** 18):
print((-1))
else:
print(ans)
| from sys import stdin
input = stdin.readline
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 1
flag = True
for ta in a:
ans *= ta
if (ans > 10 ** 18):
flag = False
ans = 1
if (flag or ans == 0):
print(ans)
else:
print((-1))
| p02658 |
from functools import reduce
n=int(eval(input()))
anums=list(map(int,input().split()))
res=reduce(lambda x,y:x*y,anums,1)
print((res if res<=10**18 else -1))
| def main():
n=int(eval(input()))
anums=list(map(int,input().split()))
res=1
if 0 in anums:
return 0
for anum in anums:
res*=anum
if res>10**18:
return -1
return res
print((main())) | p02658 |
n = int(eval(input()))
multi = list(map(int,input().split()))
result = 1
for i in multi:
result = result * i
if (result > 10**18):
print((-1))
else:
print(result) | n = int(eval(input()))
multi = list(map(int,input().split()))
result = 1
if 0 in multi:
result = 0
print((0))
exit()
for i in range(n):
result = result * multi[i]
if (result > 10**18):
result = -1
break
print(result) | p02658 |
N = int(eval(input()))
A = list(map(int, input().split()))
P = 1
for i in range(N):
P = P * A[i]
if P <= 1e18:
print(P)
else:
print((-1)) | N = int(eval(input()))
A = list(map(int, input().split()))
newA = sorted(A)
P = 1
flag = 0
for i in range(N):
P = P * newA[i]
if P == 0:
print(P)
flag = 1
break
elif P > 1e18:
print((-1))
flag = 1
break
if flag == 0:
print(P) | p02658 |
from functools import reduce
n = int(eval(input()))
a = list(map(int, input().split()))
ans = reduce(lambda x,y:x*y,a)
print((ans if ans <= 10**18 else '-1')) | n = int(eval(input()))
a = list(map(int, input().split()))
b = [i for i in a if i != 1]
ans = 1
if len(b) < 100:
for i in range(len(b)):
ans *= b[i]
else:
ans = 10**18+1
if 0 in b:
ans = 0
print((ans if ans <= 10**18 else '-1')) | p02658 |
N = int(eval(input()))
A = list(map(int,input().split()))
ans = 1
for i in A:
ans *= i
if ans <= 1000000000000000000:
print(ans)
else:
print('-1') | 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 |
import collections
N=int(eval(input()))
A=list(map(int, input().split()))
A_dict=collections.Counter(A)
ANS=1
for key, value in list(A_dict.items()):
ANS=ANS*(key**value)
if ANS>10**18:
print("-1")
else:
print(ANS)
| import collections
import sys
N=int(eval(input()))
A=list(map(int, input().split()))
A_dict=collections.Counter(A)
ANS=1
if 0 in list(A_dict.keys()):
print("0")
sys.exit()
for key, value in list(A_dict.items()):
ANS=ANS*(key**value)
if ANS>10**18:
print((-1))
sys.exi... | p02658 |
n = int(eval(input()))
values =list(map(int, input().split()))
a=1
for i in range(n):
a=a*values[i]
if a<= 10**18:
print(a)
else:
print((-1)) | n = int(eval(input()))
values =list(map(int, input().split()))
a=1
t = 10**18
for i in range(n):
if values[i] == 0:
a = 0
break
if a > t:
continue
else:
a=a*values[i]
if a <= t:
print(a)
else:
print((-1)) | p02658 |
# -*- coding: utf-8 -*-
n = int(eval(input()))
nums = list(map(int, input().split()))
ans = 1
for i in range(n):
ans *= nums[i]
if ans > 10 ** 18:
print((-1))
exit()
print(ans)
| # -*- coding: utf-8 -*-
n = int(eval(input()))
nums = sorted(list(map(int, input().split())))
ans = 1
for i in range(n):
ans *= nums[i]
if ans == 0:
print((0))
exit()
if ans > 10 ** 18:
print((-1))
exit()
print(ans)
| p02658 |
N = int(eval(input()))
a = [int(i) for i in input().split(" ")]
res=1
xx=10**18
for i in a:
res*=i
if res>xx:
print((-1))
else:
print(res) | N = int(eval(input()))
a = [int(i) for i in input().split(" ")]
res=1
xx=10**18
f=0
a.sort()
for i in a:
res*=i
if res>xx:
f=1
print((-1))
break
if f==0:
print(res) | p02658 |
N = int(eval(input()))
A = list(map(int, input().split()))
SUM = 1
flag = 0
for a in A:
SUM = SUM*a
if SUM > 10**18:
print((-1))
else:
print(SUM) | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
ans = 1
for x in A:
ans *= x
if ans > 10 ** 18:
ans = -1
break
print(ans)
| p02658 |
n = int(eval(input()))
data = [int(x) for x in input().split()]
answer = 1
for x in data:
answer *= x
if answer <= 1e+18:
print(answer)
else:
print((-1)) | n = int(eval(input()))
data = [int(x) for x in input().split()]
if 0 in data:
print((0))
exit(
)
answer = 1
for x in data:
answer *= x
if answer > 1e+18:
answer = -1
break
print(answer) | p02658 |
N = int(eval(input()))
A_ls = list(map(int, input().split()))
mul = 1
for i in A_ls:
mul *= i
if mul > 10**18:
print((-1))
else:
print(mul) | n = int(eval(input()))
a = list(map(int,input().split()))
a.sort()
ans = 1
if a[0] == 0:
print((0))
else:
for i in range(len(a)):
ans *= a[i]
if ans > 10**18:
print("-1")
exit()
elif i == len(a)-1:
print(ans) | p02658 |
N = int(eval(input()))
A = list(map(int, input().split()))
result = 1
for i in A:
result *= i
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
num = 1
max_num = 10**18
for i in A:
num *= i
if num > max_num:
print((-1))
return
print(num)
main() | p02658 |
eval(input());ans,limit=1,10**18
for i in map(int,input().split()):
ans*=i
print(([ans,-1][ans>limit])) | eval(input());ans,a=1,[*list(map(int,input().split()))]
if 0 in a:
print((0))
else:
for i in a:
ans*=i
if ans>10**18:
print((-1));break
else:
print(ans) | p02658 |
def main():
N = int(eval(input()))
A_list = [A for A in input().split()]
A_list = list(map(int, A_list))
#print(A_list)
A_list.sort()
#print(A_list)
ans = 1
for a in A_list :
ans = ans * a
if ans == 0 :
break
if ans > 10 ** 18 :
ans = ... | def main():
N = int(eval(input()))
A_list = [A for A in input().split()]
A_list = list(map(int, A_list))
#print(A_list)
A_list.sort()
#print(A_list)
ans = 1
for a in A_list :
ans = ans * a
if ans == 0 :
break
elif ans > 10 ** 18 :
... | p02658 |
N = eval(input())
A = list(map(int, input().split()))
answer = 1
for Ai in A:
answer *= Ai
if answer > 10 ** 18:
answer = -1
print(answer)
| N = eval(input())
A = list(map(int, input().split()))
haz_zero = 0 in A
if haz_zero:
print((0))
exit()
answer = 1
for Ai in A:
answer *= Ai
if answer > 10 ** 18:
answer = -1
break
print(answer)
| p02658 |
n = int(eval(input()));
a = list(map(int, input().split()));
ok = True;
ans = 1;
for val in a:
ans *= val;
if(ans > 1e18):
ok = False;
if(ok):
print(ans);
else:
print((-1));
| n = int(eval(input()));
a = list(map(int, input().split()));
ok = True;
ans = 1;
a.sort();
for val in a:
ans *= val;
if(ans > 1e18):
ok = False;
break;
elif(ans == 0):
break;
if(ok):
print(ans);
else:
print((-1));
| p02658 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 1
flag_0 = False
for a_i in a:
if a_i == 0:
flag_0 = True
break
ans *= a_i
if ans > 10**18:
ans = -1
if flag_0 == True:
print((0))
elif ans <0:
print((-1))
else:
... | n = int(eval(input()))
a = list(map(int, input().split()))
ans = 1
flag_0 = False
if 0 in a:
print((0))
else:
for a_i in a:
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 = 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 = ans * A[i]
if ans > 10**18:
print((-1))
break
else:
print(ans)
| p02658 |
from sys import exit
ii = lambda : int(eval(input()))
mi = lambda : list(map(int,input().split()))
li = lambda : list(map(int,input().split()))
n= ii()
a= li()
ans=1
for i in range(n):
ans *= a[i]
if ans > 10**18:
ans = -1
print(ans) | from sys import exit
import math
ii = lambda : int(eval(input()))
mi = lambda : list(map(int,input().split()))
li = lambda : list(map(int,input().split()))
n= ii()
a= li()
ans=1
a.sort()
a.reverse()
if a[-1] == 0:
print((0))
exit()
for i in range(n):
ans *= a[i]
if ans > 10**18:
... | p02658 |
import sys
from operator import mul
from functools import reduce
t = 10**18
n=int(eval(input()))
li = list(map(int,input().split()))
if li.count(0) >= 1:
print((0))
sys.exit()
ans = reduce(mul,li)
if ans > t:
print((-1))
else:
print(ans) | import sys
t = 10**18
n=int(eval(input()))
li = list(map(int,input().split()))
if li.count(0) >= 1:
print((0))
sys.exit()
ans = 1
for i in range(n):
ans = ans*li[i]
if ans > t:
print((-1))
sys.exit()
print(ans) | p02658 |
N=int(eval(input()))
A=[]
A=list(map(int,input().split()))
L=10**18
S=1
for i in range(N):
S=S*A[i]
if S<=L:
print(S)
else:
print("-1")
| N=int(eval(input()))
A=[]
A=list(map(int,input().split()))
A.sort(reverse=True)
L=10**18
S=1
if A[N-1]==0:
print("0")
else:
for i in range(N):
S=S*A[i]
if S>L:
print("-1")
break
if S<=L:
print(S)
| 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(ans)
else:
print((-1)) | n=int(eval(input()))
a=list(map(int,input().split()))
a.sort()
ans=1
for i in range(n):
ans*=a[i]
if ans==0 or ans>10**18:
break
if ans<=10**18:
print(ans)
else:
print((-1)) | p02658 |
N = int(eval(input()))
Nums = input().split()
A = 1
break_flag = 0
for i in range(N):
A*=int(Nums[i])
if A > 10**18:
A = -1
break_flag = 1
if A == 0:
break_flag = 2
if break_flag == 1:
print((-1))
else:
print(A) | N = int(eval(input()))
Nums = input().split()
AA = set(Nums)
if '0' in AA:
print((0))
else:
A = 1
for i in range(N):
A*=int(Nums[i])
if A > 10**18:
A = -1
break
print(A) | p02658 |
eval(input())
r = 1
for x in input().split():
r = max(-1, r * int(x))
if r > 1e18:
r = -1
print(r)
| eval(input())
r = 1
for x in map(int, input().split()):
if x == 0:
r = 0
break
if r > 0:
r *= x
if r > 1e18:
r = -1
print(r) | p02658 |
N = int(eval(input()))
A = list(map(int,input().split()))
ans = 1
if 0 in A:
ans = 0
N = 0
for i in range(N):
ans *= A[i]
if ans > 10**18:
ans = -1
break
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 *= A[i]
if ans > 10**18:
print((-1))
exit()
print(ans)
| p02658 |
N = int(eval(input()))
li = [int(s) for s in input().split()]
import functools
import operator
result = functools.reduce(operator.mul, li)
if result > 10**18:
print((-1))
else:
print(result) | import sys
N = int(eval(input()))
Line = [int(s) for s in input().split()]
Line.sort()
ans = 1
for i in Line:
ans = ans*i
if ans > 10**18:
print("-1")
exit()
elif ans == 0:
print("0")
exit()
print(ans) | p02658 |
def multiplication():
# 入力
N = int(eval(input()))
A = list(map(int, input().split()))
# 計算処理
multi = 1
for i in range(N):
multi = multi * A[i]
# 10^18比較
if multi > 10 ** 18:
return -1
else:
return multi
result = multiplication()
print(result) | def multiplication():
# 入力
N = int(eval(input()))
A = list(map(int, input().split()))
# かける数に0があるか確認
if 0 in A:
return 0
# 計算処理
multi = 1
for i in range(N):
multi = multi * A[i]
# 10^18比較
if multi > 10 ** 18:
return -1
return ... | p02658 |
import sys
# sys.setrecursionlimit(10**10)
N = int(sys.stdin.readline().rstrip())
# S = sys.stdin.readline().rstrip()
# N, K = map(int, sys.stdin.readline().rstrip().split())
A = list(map(int, sys.stdin.readline().rstrip().split()))
ans = 1
for a in A:
ans *= a
if ans > 10 **18:
print((-1))
else:
... | import sys
# sys.setrecursionlimit(10**10)
N = int(sys.stdin.readline().rstrip())
# S = sys.stdin.readline().rstrip()
# N, K = map(int, sys.stdin.readline().rstrip().split())
A = list(map(int, sys.stdin.readline().rstrip().split()))
if 0 in A:
print((0))
exit()
ans = 1
for a in A:
ans *= a
... | p02658 |
n = int(eval(input()))
l = list(map(int, input().split()))
ans = 1
for i in range(n):
ans *= l[i]
if ans <= 10**18:
print(ans)
else:
print((-1)) | n = int(eval(input()))
l = list(map(int, input().split()))
l.sort()
if l[0] == 0:
print((0))
exit()
ans = 1
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()))
sum = 1
for i in a:
if i == 0:
sum = 0
break
sum = sum * i
if sum > 10**18:
print((-1))
else:
print(sum)
| n = int(eval(input()))
a = list(map(int,input().split()))
sum = 1
if 0 in a:
sum = 0
else:
for i in a:
sum = sum * i
if sum > 10**18:
sum = -1
break
print(sum)
| p02658 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n, *a = list(map(int, read().split()))
val=1
for x in a:
val*=x
print((val if val<=10**18 else '-1')) |
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)
return
main ()
| p02658 |
n = eval(input())
n = int(n)
a = input().split()
b = 1
for i in a:
b *= int(i)
if (b > 1000000000000000000):
print ("-1")
else:
print (b)
| n = eval(input())
n = int(n)
a = input().split()
b = 1
if '0' in a:
print ("0")
else:
for i in a:
b *= int(i)
if (b > 1000000000000000000):
print ("-1")
break
if (b <= 1000000000000000000):
print (b)
| p02658 |
_ = eval(input())
inp = list(map(int, input().split()))
of = False
re = 1
for a in inp:
re *= a
if (re - 1) // (10**18) > 0:
re = -1
print(re)
| _ = eval(input())
inp = list(map(int, input().split()))
re = 1
for a in inp:
re = re * a
if re > (10**18):
of = True
re = -1
break
for a in inp:
if a == 0:
re = 0
print(re)
| p02658 |
p=1
l=eval(input())
num=input().split()
for n in num:
p*=int(n)
mx=pow(10,18)
if(p>mx):
print("-1")
else:
print(p) | p=1
mx=1000000000000000000
n=int(eval(input()))
num=input().split()
z=num.count('0')
if(z!=0):
print('0')
else:
for i in num:
p*=int(i)
if(p>mx):
p=-1
break
print(p) | p02658 |
eval(input())
a=1
for i in input().split():
a*=int(i)
print(([a,-1][a>1000000000000000000])) | eval(input())
a=1
d=1000000000000000000
for i in input().split():
a=min(a*int(i), d+1)
print(([a,-1][a>d])) | p02658 |
eval(input())
a=1
d=1000000000000000000
for i in input().split():
a=min(a*int(i),d+1)
print(([a,-1][a>d])) | eval(input())
a=1
d=eval('1'+'0'*18)
for i in input().split():
a=min(a*int(i),d+1)
print(([a,-1][a>d])) | p02658 |
eval(input());a=1;d=eval('1'+'0'*18)
for i in input().split():a=min(a*int(i),d+1)
print(([a,-1][a>d])) | a=1;d=eval('1'+'0'*18)
for i in open(0).read().split()[1:]:a=min(a*int(i),d+1)
print(([a,-1][a>d])) | p02658 |
eval(input());a=1
for i in input().split():a*=int(i);a=[-1,a][0<=a<=eval('1'+'0'*18)]
print(a) | eval(input());a=1
for i in input().split():a*=int(i);a=[-1,a][0<=a<=10**18]
print(a) | p02658 |
eval(input());a=1
for i in input().split():a*=int(i);a=[-1,a][0<=a<=10**18]
print(a) | a=1
for i in[*open(0)][1].split():a*=int(i);a=[-1,a][0<=a<=10**18]
print(a) | p02658 |
a=1;d=10**18
for i in[*open(0)][1].split():a=min(a*int(i),d+1)
print(([a,-1][a>d])) | a=1
for i in[*open(0)][1].split():a*=int(i);a=[-1,a][-2<a-1<1e18]
print(a) | p02658 |
_,b=open(0);a=1
for i in b.split():a*=int(i);a=[-1,a][-1<a<=1e18]
print(a) | a=1
for i in[*open(0)][1].split():a=[-1,a:=a*int(i)][-1<a<=1e18]
print(a) | p02658 |
n=int(eval(input()))
a=list(map(int,input().split()))
ans=1
for i in a:
ans*=i
if a.count(0)==0 and ans>10**18:
print((-1))
exit()
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
ans=1
a=sorted(a)
for i in a:
ans*=i
if i==0:
print((0))
exit()
elif ans>10**18:
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()))
b=1
for i in range(n):
if a[i]==0:
b=0
for i in range(n):
b=b*a[i]
if b>10**18:
b=-1
break
print(b) | p02658 |
import sys
#import time
import copy
#from collections import deque, Counter, defaultdict
#from fractions import gcd
#import bisect
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
inf = 10**20
ri = lambda : int(eval(input()))
rs = lambda : input().strip()
rl = lambda : list(map(int, input().split()))
... | import sys
#import time
import copy
#from collections import deque, Counter, defaultdict
#from fractions import gcd
#import bisect
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
inf = 10**20
ri = lambda : int(eval(input()))
rs = lambda : input().strip()
rl = lambda : list(map(int, input().split()))
... | 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(ans)
else:
print((-1)) | n= int(eval(input()))
a=list(map(int,input().split()))
a.sort()
ans=1
for i in a:
ans=ans*i
if ans>(10**18):
print((-1))
break
elif ans==0:
print(ans)
break
if ans<=(10**18)and ans!=0:
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 > 1e18:
ans = -1
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 > 1e18:
ans = -1
break
print(ans) | p02658 |
import functools
import operator
N = int(eval(input()))
A = list(map(int, input().split()))
answer = functools.reduce(operator.mul, A)
if answer > 1000000000000000000:
print('-1')
else:
print(answer) | N = int(eval(input()))
A = list(map(int, input().split()))
if A.count(0) >= 1:
print((0))
exit()
answer = 1
for _ in A:
answer *= _
if answer > 1000000000000000000:
print('-1')
exit()
print(answer)
| p02658 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.