Submission #8561207

---

Source Code Expand

from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

n,k = inpl()
a = inpl()
if k in a:
    print('POSSIBLE')
    quit()
if k > max(a):
    print('IMPOSSIBLE')
    quit()
if 1 in a:
    print('POSSIBLE')
    quit()
a.sort()
tmp = a[1] - a[0]
for i in range(1,n-1):
    tmp = fractions.gcd(a[i+1]-a[i], tmp)
    if tmp == 1:
        break
tmp = fractions.gcd(tmp,a[0])
if tmp == 1 or k%tmp == 0: 
    print('POSSIBLE')
else:
    print('IMPOSSIBLE')

Submission Info

Judge Result