Submission #2708970

---

Source Code Expand

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

int maxn,a[100009],n,k,g;

int main(){
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		cin>>a[i];maxn=max(maxn,a[i]);
		if(i==1) g=a[i];
		else g=__gcd(g,a[i]);
	}
	if(k%g==0 && k<=maxn) cout<<"POSSIBLE"<<endl;
	else cout<<"IMPOSSIBLE"<<endl;
	return 0;
}

Submission Info

Judge Result