Submission #654775

---

Source Code Expand

from fractions import gcd
from functools import reduce

MOD = 10 ** 9 + 7

def solve():
    legnum = int(input())
    legs = [int(input()) for _ in range(legnum)]
    minleg = min(legs)
    gcdval = reduce(gcd, [x - minleg for x in legs])
    print(pow(2, minleg + (gcdval + 1) // 2, MOD))

if __name__=="__main__":
    solve()

Submission Info

Judge Result