Submission #3734739


Source Code Expand

N, K = [int(_) for _ in input().split()]
A = [int(_) for _ in input().split()]


def gcd(x, y):
    if x < y:
        return gcd(y, x)
    elif y == 0:
        return x
    else:
        return gcd(y, x % y)


g = A.pop()
for a in A:
    g = gcd(g, a)
if K <= max(A) and K % g == 0:
    print('POSSIBLE')
else:
    print('IMPOSSIBLE')

Submission Info

Submission Time
Task A - Getting Difference
User yydoco
Language Python (3.4.3)
Score 0
Code Size 355 Byte
Status RE
Exec Time 98 ms
Memory 14252 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 4
AC × 17
RE × 2
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 18 ms 3060 KB
sample_02.txt AC 18 ms 3060 KB
sample_03.txt AC 18 ms 3060 KB
sample_04.txt AC 18 ms 2940 KB
subtask_1_01.txt RE 19 ms 3060 KB
subtask_1_02.txt RE 19 ms 2940 KB
subtask_1_03.txt AC 98 ms 14252 KB
subtask_1_04.txt AC 84 ms 13848 KB
subtask_1_05.txt AC 54 ms 8820 KB
subtask_1_06.txt AC 29 ms 4564 KB
subtask_1_07.txt AC 69 ms 9628 KB
subtask_1_08.txt AC 90 ms 13116 KB
subtask_1_09.txt AC 49 ms 7396 KB
subtask_1_10.txt AC 72 ms 10852 KB
subtask_1_11.txt AC 80 ms 12420 KB