Submission #6395538

---

Source Code Expand

typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}
// https://qiita.com/EqualL2/items/6e3de4d1d09e2e5f3611
ll euclidean_gcd(ll a, ll b)
{
    return b != 0 ? euclidean_gcd(b, a % b) : a;
} 

int main(){
    ll n,k;
    ll a[100010];
    std::cin >> n>>k;
    
    for (int i = 0; i < n; i++) {
        std::cin >> a[i];
        if(a[i] == k){
            std::cout << "POSSIBLE" << std::endl;
            return 0;
        }
    }
    ll gcd = a[0];
    for (int i = 0; i < n; i++) {
        gcd = euclidean_gcd(gcd,a[i]);
    }
    sort(a,a+n);
    ll in = distance(a,lower_bound(a,a+n,k));
    if( in == n ){
        std::cout << "IMPOSSIBLE" << std::endl;
        return 0;
    }
    for (int i = 0; i < n; i++) {
        if(a[i]>k){
            if( (a[i]-k - a[0]) >= 0 && (a[i]-k - a[0])%gcd == 0 ){
                std::cout << "POSSIBLE" << std::endl;
                return 0;
            }
        }
    }
    std::cout << "IMPOSSIBLE" << std::endl;
}

Submission Info

Judge Result