Submission #5888993

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <queue>
#include <list>
#include <cmath>
#include <stack>

using namespace std;
typedef long long ll;
using Pll = pair<ll,ll>;

ll euclidean_gcd(ll a, ll b) {
  if(a < b) return euclidean_gcd(b, a);
  ll r;
  while ((r=a%b)) {
    a = b;
    b = r;
  }
  return b;
}

int main() {
    ll N,K;
    cin >> N >> K;
    vector<ll> A(N);
    
    for(int i=0;i<N;i++) cin >> A[i];
    sort(A.begin(),A.end());
    ll gc=A[0];
    for(int i=1;i<N;i++){
        gc=euclidean_gcd(gc,A[i]);
    }
    ll st=lower_bound(A.begin(),A.end(),K)-A.begin();
    bool jg=false;
    for(int i=st;i<N;i++){
        if(K%gc==A[i]%gc){
            jg=true;
            break;
        }
    }
    cout << (jg?"POSSIBLE":"IMPOSSIBLE") << endl;




    return 0;
}

Submission Info

Judge Result