Submission #8416617

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;


int gcd(int a, int b) {
	return (b == 0 ? a : gcd(b, a % b));
}


int main() {
	int n, k; cin >> n >> k;
	vector<int>A(n); for (auto&& x : A)cin >> x;
	if (n == 1) { cout << (A[0] == k ? "POSSIBLE" : "IMPOSSIBLE") << endl; return 0; }
	sort(A.begin(), A.end());

	int G = gcd(A[0], A[1]);
	for (int i = 2; i < A.size(); i++) {
		G = gcd(G, A[i]);
	}
	if (k % G == 0 && k <= A[A.size() - 1]) { cout << "POSSIBLE" << endl; }
	else cout << "IMPOSSIBLE" << endl;

	return 0;
}

Submission Info

Judge Result