Submission #3234251


Source Code Expand

#include<algorithm>
#include<climits>
#include<cmath>
#include<iomanip>
#include<iostream>
#include<list>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<utility>
#include<vector>

using namespace std;

typedef long long lint;
typedef long double ldouble;
#define REP(i, x, n) for(int i = x ; i < n ; i++)
#define rep(i, n) REP(i, 0, n)
#define repr(i, n) for(int i = n - 1 ; i >= 0 ; i--)
#define SORT(c) sort((c).begin(), (c).end())
#define SORT_INV(c) sort((c).begin(), (c).end(), greater<int>())
#define IINF (int)(1e9+10)
#define LLINF (lint)(1e18+10)

int gcd(int x, int y){
    int r = x % y;
    while(r != 0){
        x = y;
        y = r;
        r = x % y;
    }
    return y;
}

bool solve(void){
    int n, k;
    cin >> n >> k;
    vector<int> a(n);
    int maxA = 0;
    rep(i, n){
        cin >> a[i];
        if(a[i] == k){
            return true;
        }
        maxA = max(maxA, a[i]);
    }
    if(maxA < k){
        return false;
    }
    int g = a[0];
    rep(i, n){
        g = gcd(g, a[i]);
    }
    return k % g == 0;
}

int main(){
    if(solve()){
        cout << "POSSIBLE" << endl;
    }else{
        cout << "IMPOSSIBLE" << endl;
    }
    return 0;
}

Submission Info

Submission Time
Task A - Getting Difference
User mhrb
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1290 Byte
Status AC
Exec Time 41 ms
Memory 640 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 4
AC × 19
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
sample_04.txt AC 1 ms 256 KB
subtask_1_01.txt AC 1 ms 256 KB
subtask_1_02.txt AC 1 ms 256 KB
subtask_1_03.txt AC 41 ms 640 KB
subtask_1_04.txt AC 1 ms 640 KB
subtask_1_05.txt AC 22 ms 384 KB
subtask_1_06.txt AC 7 ms 256 KB
subtask_1_07.txt AC 25 ms 512 KB
subtask_1_08.txt AC 35 ms 640 KB
subtask_1_09.txt AC 17 ms 384 KB
subtask_1_10.txt AC 30 ms 512 KB
subtask_1_11.txt AC 32 ms 512 KB