Submission #3736933

---

Source Code Expand

/* ---------- STL Libraries ---------- */
// IO library
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>

// algorithm library
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>

// container library
#include <array>
#include <bitset>
#include <deque>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>

/* ---------- Namespace ---------- */
using namespace std;

/* ---------- Type ---------- */
using ll = long long;
#define int ll
#define P pair<ll, ll>

/* ---------- Constants  */
const ll MOD = 1e9 + 7;
const int INF = 1LL << 55;
// const double PI = acos(-1);
// const double EPS = 1e-10;
// mt19937 mert(LL(time(0)));

/* v-v-v-v-v-v-v-v-v Main Part v-v-v-v-v-v-v-v-v */

// O(log max(a, b))
int gcd(int a, int b) {
    if (b == 0) return a;
    return gcd(b, a % b);
}

signed main() {
    int N, K;
    cin >> N >> K;

    int A[N];
    int amax = -1;
    for (int i = 0; i < N; i++) {
        cin >> A[i];
        amax = max(amax, A[i]);
    }

    if (N == 0) {
        if (N == K) {
            cout << "POSSIBLE" << endl;
            return 0;
        } else {
            cout << "IMPOSSIBLE" << endl;
            return 0;
        }
    }

    int ret = gcd(A[0], A[1]);
    for (int i = 2; i < N; i++) {
        ret = gcd(ret, A[i]);
    }

    if (K % ret == 0 && K <= amax) {
        cout << "POSSIBLE" << endl;
    } else {
        cout << "IMPOSSIBLE" << endl;
    }

    return 0;
}

Submission Info

Judge Result