Submission #2240671

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const LL MOD = 1000000007LL;
int gcd(int a, int b) {
	return b ? gcd(b, a%b) : a;
}
int A[100000];
int main() {
	int N, K;
	cin >> N >> K;
	for (int i = 0; i < N; i++) cin >> A[i];
	int M = A[0] , g = A[0];
	for (int i = 1; i < N; i++) M = max(M, A[i]), g = gcd(g, A[i]);
	if (K <= M && K%g == 0) {
		cout << "POSSIBLE" << endl;
	}
	else {
		cout << "IMPOSSIBLE" << endl;
	}
}

Submission Info

Judge Result