Submission #3248057

---

Source Code Expand

#include <iostream>
#include <set>
#include <vector>
#include <string>
#include <algorithm>
#include <iterator>
#include <map>
#include <utility>
#include <list>
#include <climits>
#include <bitset>
#include <numeric>

using namespace std;

#define rep(i, n) for(int i = 0; i < n; i++)
#define repi(i, n) for(auto i = (n).begin(); i != (n).end(); i++)
#define in_arr(type, a, n) copy_n(istream_iterator<type>(cin), n, (a).begin());
#define ll long long int

int gcd(int a, int b){
    int c;
    while(b != 0){
        c = a % b;
        a = b;
        b = c;
    }
    return a;
}

int main(){
    int n, k;
    cin >> n >> k;
    vector<int> a(n);
    in_arr(int, a, n);
    int b = accumulate(a.begin(), a.end(), a[0], [](int a, int b){ return gcd(a, b); });
    int m = accumulate(a.begin(), a.end(), 0, [](int a, int b){ return max(a, b); });
    if(m < k){
        cout << "IMPOSSIBLE" << endl;
    }else if(k % b == 0){
        cout << "POSSIBLE" << endl;
    }else{
        cout << "IMPOSSIBLE" << endl;
    }
    return 0;
}

Submission Info

Judge Result