Submission #1445293


Source Code Expand

#include<bits/stdc++.h>
#define ll long long
#define vll vector<ll>
#define mll map<ll,ll>
#define sll set<ll>
#define fo(i,n) for(i=0;i<n;i++)
#define MOD 1000000007
using namespace std;

int main()
{
    ios::sync_with_stdio(false);

    ll n,i,j,k,t,a[100001];

    cin>>n>>k;

    fo(i,n)
        cin>>a[i];
    sort(a,a+n);

    if(k>a[n-1])
    {
        cout<<"IMPOSSIBLE";
        return 0;
    }

    ll g=a[n-1];
    fo(i,n)
        g=__gcd(g,a[i]);

    if(k%g==0)
        cout<<"POSSIBLE";
    else
        cout<<"IMPOSSIBLE";
    return 0;
}

Submission Info

Submission Time
Task A - Getting Difference
User ujjwal9895
Language C++14 (GCC 5.4.1)
Score 300
Code Size 592 Byte
Status AC
Exec Time 19 ms
Memory 1024 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 19 ms 1024 KB
subtask_1_04.txt AC 13 ms 1024 KB
subtask_1_05.txt AC 7 ms 640 KB
subtask_1_06.txt AC 4 ms 384 KB
subtask_1_07.txt AC 12 ms 768 KB
subtask_1_08.txt AC 16 ms 1024 KB
subtask_1_09.txt AC 8 ms 640 KB
subtask_1_10.txt AC 14 ms 768 KB
subtask_1_11.txt AC 14 ms 896 KB