Submission #3424648

---

Source Code Expand

import sys
stdin = sys.stdin

sys.setrecursionlimit(10**5) 
 
def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

k = ni()
a = list(li())

a = a[::-1]
bmin = [a[0]]
bmax = [a[0]]

for i in range(k-1):
    bmin.append(a[i+1] * (-(-bmin[i]//a[i+1])))
    bmax.append(a[i+1] * ((2*bmax[i]-1)//a[i+1]))
    
        
exist = True

# 判定
if a[0] != 2:
    exist = False
    
else:
    for i in range(k-1):
        if (bmin[i+1]//a[i]) * a[i] != bmin[i]:
            exist = False
            break
    
    for i in range(k-1):
        if (bmax[i+1]//a[i]) * a[i] != bmax[i]:
            exist = False
            break
        
if exist:
    print(bmin[-1], bmax[-1] + a[-1]-1)
else:
    print(-1)

Submission Info

Judge Result