Submission #8557186

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<cstring>
#include<math.h>
#include<bitset>
#include<queue>
#include<set>
#include<iomanip>
// #include<bits/stdc++.h>
using namespace std;
#define ll long long

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

int main(){
  int N;
  cin >> N;
  int K;
  cin >> K;
  vector<int> A(N);
  for(int i=0; i<N; i++){
    cin >> A[i];
  }
  int gcd_sum = A[0];
  for(int i=1; i<N; i++){
    gcd_sum = gcd(gcd_sum,A[i]);
  }
  sort(A.begin(),A.end(),greater<int>());
  if(A[0] < K){
    cout << "IMPOSSIBLE" << endl;
    return 0;
  }
  if(K%gcd_sum != 0){
    cout << "IMPOSSIBLE" << endl;
  }else{
    cout << "POSSIBLE" << endl;
  }
  return 0;
}

Submission Info

Judge Result