Submission #6384585

---

Source Code Expand

#include<bits/stdc++.h>
#include<iostream>
#define ll long long
#define back return
using namespace std;
ll n,m,i,j,k,lsbl,sum,sumend;
ll gcd(ll a,ll b)
{
    if(!b)
        back a;
    back gcd(b,a%b);
}
ll maxx(ll a,ll b)
{
    if(a>=b)
        back a;
    back b;
}
int main()
{
    cin>>n>>m>>k;
    ll lsbl1=k;
    for(i=2;i<=n;i++)
    {
        cin>>lsbl;
        k=gcd(k,lsbl);
        lsbl1=maxx(lsbl,lsbl1);
    }
    if(lsbl1>=m&&!(m%k))
    {
        cout<<"POSSIBLE"<<endl;
        back 0;
    }
    cout<<"IMPOSSIBLE"<<endl;
    back 0;
}

Submission Info

Judge Result