提出 #8540596

---

ソースコード 拡げる

#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)),x.end())
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int MOD = 1000000007;

int gcd(int a, int b) {
  if(a<b) swap(a,b);
  int c = -1;
  while(c != 0){
    c = a % b;
    a = b;
    b = c;
  }
  return a;
}
  
int main() {
  int N,K;
  cin >> N >> K;
  vi A(N);
  int mi = INF,ma = -INF;
  rep(i,N) {
    cin >> A[i];
    mi = min(mi,A[i]);
    ma = max(ma,A[i]);
  }
  rep(i,N) {
    if(A[i] == K) {
      cout << "POSSIBLE" << endl;
      return 0;
    }
  }
  int g = A[0];
  rep(i,N) {
    g = gcd(g,A[i]);
  }
  if(ma < K) {
    cout << "IMPOSSIBLE" << endl;
    return 0;
  }
  if(K%g != 0) {
    cout << "IMPOSSIBLE" << endl;
    return 0;
  }
  cout << "POSSIBLE" << endl;
  return 0;
}

提出情報

ジャッジ結果