Submission #1870594

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000

int gcd(int x, int y) {
    if (x < y) return gcd(y, x);
    else if (y == 0) return x;
    else return gcd(y, x % y);
}

int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, K;
    cin >> N >> K;
    int A[N];
    int maxnum = 0;
    int minnum = INF;
    rep(i, N) {
        cin >> A[i];
        maxnum = max(maxnum, A[i]);
        minnum = min(minnum, A[i]);
    }
    if (N == 1) {
        if (A[0] == K) {
            cout << "POSSIBLE" << endl;
        } else {
            cout << "IMPOSSIBLE" << endl;
        }
        return 0;
    }

    int G = gcd(A[0], A[1]);
    for (int i = 2; i < N; i++) {
        G = gcd(G, A[i]);
    }
    if (K % G == 0 && minnum <= K && K <= maxnum) {
        cout << "POSSIBLE" << endl;
    } else {
        cout << "IMPOSSIBLE" << endl;
    }

    return 0;
}

Submission Info

Judge Result