Submission #1447032

---

Source Code Expand

#include <iostream>
#include <algorithm>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;

ll N, K, A[100000];

ll gcd(ll a, ll b) {
  if(b == 0) return a;
  return gcd(b, a % b);
}

ll judge() {
  ll d = A[0];
  REP(i, 1, N) d = gcd(d, A[i]);
  return d;
}

int main(void) {
  cin >> N >> K;
  REP(i, 0, N) cin >> A[i];

  sort(A, A + N);

  ll d = judge();
  cout << (A[N - 1] >= K && K % d == 0 ? "POSSIBLE" : "IMPOSSIBLE") << endl;
}

Submission Info

Judge Result