Submission #2234945

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <limits>
#include <map>
#define REP(i,n) for(long (i)=0;(i)<(n);(i)++)
#define REPI(i,a,b) for(long (i)=(a);(i)<(b);(i)++)
#define INF numeric_limits<double>::infinity()
constexpr long MOD = 1e9 + 7;
using namespace std;
using P = pair<long, long>;
using VI = vector<long>;

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

long lcm(long a, long b) {
    return a / gcd(a, b) * b;
}

int main() {
    long n, k;
    cin >> n >> k;
    long a, b, c;
    cin >> a;
    c = a;
    REP(i,n-1) {
        cin >> b;
        a = gcd(a, b);
        c = max(c, b);
    }
    if (k % a == 0 && k <= c) {
        cout << "POESSIBLE" << endl;
    } else {
        cout << "IMPOSSIBLE" << endl;
    }
}

Submission Info

Judge Result