Submission #1445305

---

Source Code Expand

# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
constexpr int MOD = 1000000007;
constexpr int INF = 2000000000;
using namespace std;

int eu(int a, int b) {
	if (a < b)swap(a, b);
	if (b == 0)return a;
	eu(a - b, b);
}

int main() {
	int n, k;
	cin >> n >> k;
	int maxl = 0, gcd = 1;
	int a;
	for (int i = 0; i < n; i++) {
		cin >> a;
		if (i == 0)gcd = a;
		maxl = max(maxl, a);
		gcd = eu(gcd, a);
	}
	if (k <= maxl&&k%gcd == 0)cout << "POSSIBLE" << endl;
	else cout << "IMPOSSIBLE" << endl;
}

Submission Info

Judge Result