Submission #6398032

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;

int main()
{
    int n, k;
    cin >> n >> k;
    vector<int> a(n);
    int magika = 0;
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
        if (a[i] == k)
        {
            magika++;
        }
    }
    sort(all(a));
    for (int i = 0; i < n; i++)
    {
        if (a[i] - a[0] == k || a[i] - a[1] == k || a[i] - a[2] == k)
        {
            magika++;
        }
    }
    if (magika > 0)
    {
        cout << "POSSIBLE" << endl;
    }
    else
    {
        ll count = 0;
        for (int i = 0; i < n; i++)
        {
            if (a[i] % a[0] == 0)
            {
                count++;
            }
        }
        if (k > a[n - 1] || count == n && k % a[0] != 0)
        {
            cout << "IMPOSSIBLE" << endl;
        }
        else
        {
            cout << "POSSIBLE" << endl;
        }
    }
}

Submission Info

Judge Result