Submission #8400473

---

Source Code Expand

#include <bits/stdc++.h>
#include <algorithm>
using namespace std;

long long gcd(long long a,long long b){
  if(b == 0) return a;
  return gcd(b,a%b);
}

long long lcm(long long a,long long b){
  long long g = gcd(a,b);
  return a/g*b;
}

int main(void){
	long long int  a,b,c[100010],d;
  cin >> a >>b;
  
  for(int i=0;i<a;i++)
    cin >> c[i];
  
  sort(c,c+a,greater<int>());
 int ans = c[0];
  
 for(int i=0;i<a;i++) ans = gcd(ans,c[i]);
  
  if(b%ans ==0 && b<=c[0]) cout << "POSSIBLE" << endl;
  else cout << "IMPOSSIBLE" << endl;
}

  
  
 

Submission Info

Judge Result