Submission #6437921

Source Code Expand

from fractions import gcd

N, K = map(int, input().split())
A = list(map(int, input().split()))

g = A[0]
for a in A[1:]:
    g = gcd(a, g)

if max(A) >= K and K % g == 0:
    print('POSSIBLE')
else:
    print('IMPOSSIBLE')

Submission Info

Submission Time
Task A - Getting Difference
User wat_shun
Language Python (3.4.3)
Score 300
Code Size 237 Byte
Status AC
Exec Time 84 ms
Memory 16240 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 35 ms 5048 KB
sample_02.txt AC 35 ms 5048 KB
sample_03.txt AC 35 ms 5048 KB
sample_04.txt AC 35 ms 5048 KB
subtask_1_01.txt AC 35 ms 5048 KB
subtask_1_02.txt AC 35 ms 5048 KB
subtask_1_03.txt AC 84 ms 16240 KB
subtask_1_04.txt AC 83 ms 15988 KB
subtask_1_05.txt AC 62 ms 10936 KB
subtask_1_06.txt AC 42 ms 6588 KB
subtask_1_07.txt AC 64 ms 11580 KB
subtask_1_08.txt AC 79 ms 15048 KB
subtask_1_09.txt AC 55 ms 9432 KB
subtask_1_10.txt AC 69 ms 13056 KB
subtask_1_11.txt AC 74 ms 14152 KB