Submission #8493753

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define FORL(i,x) for(int i=head[x];i;i=nxt[i])
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define PB push_back
#define MP make_pair
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }


ll gcd(ll x, ll y)
{
    ll temp;
    while (y != 0) {
        temp = y;
        y = x % y;
        x = temp;
    }
    return (x);
}

ll lcm( ll m, ll n )
{
	// 引数に０がある場合は０を返す
	if ( ( 0 == m ) || ( 0 == n ) )
		return 0;
	
	return ((m / gcd(m, n)) * n); // lcm = m * n / gcd(m,n)
}//lcm


int main() {
  int n,k;
  cin >> n >> k;
  int a[n];
  FOR(i,0,n-1) cin >> a[i];

  int gcdnum;
  int maxnum = 1;

  FOR(i,0,n-1){
    if(i==0) gcdnum = a[i];
    gcdnum = gcd(gcdnum,a[i]);
    chmax(maxnum,a[i]);
  }

  if(k%gcdnum==0 && k<=maxnum) cout << "POSSIBLE" << endl;
  else cout << "IMPOSSIBLE" << endl;

}

Submission Info

Judge Result