Submission #2227498


Source Code Expand

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const ll mod = 1e9+7;

int N, K;
int A[100010];
int main(){
    cin>>N>>K;
    int mx=0;
    REP(i,0,N){
        cin>>A[i];
        mx=max(mx,A[i]);
    }
    int g=A[0];
    REP(i,1,N){
        g = __gcd(g,A[i]);
    }
    if(K%g==0&&K<=mx){
        p("POSSIBLE");
    }else{
        p("IMPOSSIBLE");
    }
    return 0;
}

Submission Info

Submission Time
Task A - Getting Difference
User uwfdai
Language C++14 (GCC 5.4.1)
Score 300
Code Size 823 Byte
Status AC
Exec Time 55 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 55 ms 640 KB
subtask_1_04.txt AC 53 ms 640 KB
subtask_1_05.txt AC 29 ms 512 KB
subtask_1_06.txt AC 9 ms 256 KB
subtask_1_07.txt AC 33 ms 512 KB
subtask_1_08.txt AC 47 ms 640 KB
subtask_1_09.txt AC 22 ms 384 KB
subtask_1_10.txt AC 38 ms 512 KB
subtask_1_11.txt AC 43 ms 512 KB