Submission #8407029

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;

typedef long long ll;

const int mod = 1000000007;
const int INF = 1001001001;

#define rep(i, n)  for(int i=0;i<(n);++i)
#define all(x) (x).begin(),(x).end()

int main() {
    int n, k;
    bool flag = false;
    cin >> n >> k;
    vector<int> a(n);
    rep(i, n) cin >> a[i];
    sort(all(a));

    int d = INF;
    rep(i, n-1) d = min(d, a[i+1] - a[i]);

    int modk = k % d;
    auto divide = upper_bound(all(a), k);
    auto kk = divide - a.begin();
    for(int i = kk; i < a.size(); i++){
        if(a[i] % d == modk) flag = true;
    }

    if (flag) cout << "POSSIBLE" << endl;
    else cout << "IMPOSSIBLE" << endl;
}

Submission Info

Judge Result