Submission #6405738

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

ll gcd(ll a,ll b){
    return b ? gcd(b, a % b) : a;
}

int main() {
    ll n, k;
    cin >> n >> k;
    ll x,y,m;
    cin >> x;
    m = x;
    for(int i = 0; i < n - 1; i++) {
        cin >> y;
        m = max(m, y);
        x = gcd(x, y);
    }
    if(k%x==0 && m>=k){
        cout << "POSSIBLE" << endl;
    }else {
        cout << "IMPOSSIBLE" << endl;
    }
    return 0;
}

Submission Info

Judge Result