Submission #2237202

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
#define FOR(i,a,b) for(int i =(a);i<(b);i++)
#define REP(i,n) for(int i=0;i<(n);i++)
#define REPm(i,n) for(int i=(n)-1;i>=0;i--)
#define REP1(i,n) for(int i=1;i<=(n);i++)
#define mp make_pair
typedef long long ll;
int gcd(int a,int b){
    if(b == 0) return a;
    else return gcd(b,a%b);
}
int main(){
    int N;
    int K;
    int g;
    int A;
    cin >> N >> K;
    cin >> g;
    int MAX = g;
    REP(i,N-1){
        cin >> A;
        if(MAX < A) MAX = A;
        g = gcd(A,g);
    }
    if(K <= MAX && K%g == 0) cout << "POSSIBLE" << endl;
    else cout << "IMPOSSIBLE" << endl;
    return 0;
}

Submission Info

Judge Result