Submission #8392939


Source Code Expand

def gcd(a,b):
    while b:
        a,b=b,a%b
    return a


def gcd_list(A):
    num=A[0]
    for i in A:
        num=gcd(num,i)
    return num


n,k=map(int,input().split())
A=list(map(int,input().split()))
print("POSSIBLE" if k%gcd_list(A)==0 and k<=max(A) else "IMPOSSIBLE")

Submission Info

Submission Time
Task A - Getting Difference
User bonoron
Language Python (3.4.3)
Score 300
Code Size 292 Byte
Status AC
Exec Time 63 ms
Memory 14480 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 17 ms 3060 KB
sample_02.txt AC 17 ms 3060 KB
sample_03.txt AC 17 ms 3060 KB
sample_04.txt AC 17 ms 3060 KB
subtask_1_01.txt AC 17 ms 2940 KB
subtask_1_02.txt AC 17 ms 3060 KB
subtask_1_03.txt AC 63 ms 14480 KB
subtask_1_04.txt AC 59 ms 14100 KB
subtask_1_05.txt AC 39 ms 8948 KB
subtask_1_06.txt AC 24 ms 4564 KB
subtask_1_07.txt AC 43 ms 9628 KB
subtask_1_08.txt AC 59 ms 13116 KB
subtask_1_09.txt AC 36 ms 7524 KB
subtask_1_10.txt AC 49 ms 11328 KB
subtask_1_11.txt AC 56 ms 12424 KB