Submission #1693972

---

Source Code Expand

#include <iostream>
#include <vector>

int n, k, max;
std::vector<int> box;

int gcd(int a, int b) {
  int tmp;
  if(a < b) {
    tmp = a;
    a = b;
    b = tmp;
  }
  while(b != 0) {
    tmp = a;
    a = b;
    b = tmp % b;
  }
  return a;
}

// O(N) 1<=N<=10^5
bool configurable(int x) {
  if(max < x)
    return false;

  int g = box[0];
  for(int i = 1; i < n && g != 1; i++) {
    g = gcd(g, box[i]);
  }
  return x % g == 0;
}

int main() {
  std::cin >> n;
  std::cin >> k;
  box.resize(n);

  int x;
  max = -1;
  for(int i = 0; i < n; i++) {
    std::cin >> x;
    box[i] = x;
    if(max < x)
      max = x;
  }

  if(configurable(k)) {
    std::cout << "POSSIBLE\n";
  } else {
    std::cout << "IMPOSSIBLE\n";
  }
  return 0;
}

Submission Info

Judge Result