Submission #3734705

Source Code Expand

import math
N, K = [int(_) for _ in input().split()]
A = [int(_) for _ in input().split()]
g = A.pop()
for a in A:
    g = math.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 231 Byte
Status RE
Exec Time 45 ms
Memory 14252 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
RE × 4
RE × 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 RE 17 ms 3060 KB
sample_02.txt RE 18 ms 3060 KB
sample_03.txt RE 17 ms 2940 KB
sample_04.txt RE 17 ms 2940 KB
subtask_1_01.txt RE 17 ms 2940 KB
subtask_1_02.txt RE 17 ms 3060 KB
subtask_1_03.txt RE 45 ms 14252 KB
subtask_1_04.txt RE 45 ms 14104 KB
subtask_1_05.txt RE 32 ms 8948 KB
subtask_1_06.txt RE 21 ms 4564 KB
subtask_1_07.txt RE 35 ms 9628 KB
subtask_1_08.txt RE 44 ms 13756 KB
subtask_1_09.txt RE 28 ms 7392 KB
subtask_1_10.txt RE 37 ms 10948 KB
subtask_1_11.txt RE 40 ms 12668 KB