Submission #6429717

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;

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

int main()
{
    int n,k;
    cin>>n>>k;
    vector<ll> a(n);
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    ll gcdd=gcd(a[0],a[1]);
    for(int i=2;i<n;i++){
        gcdd=gcd(gcdd,a[i]);
    }
    sort(rall(a));
    if(k<=a[0]&&k%gcdd==0){
        cout<<"POSSIBLE"<<endl;
    }
    else{
        cout<<"IMPOSSIBLE"<<endl;
    }

}

Submission Info

Judge Result