Submission #5909061

Source Code Expand

N, K = map(int, input().split())
*A, = map(int, input().split())
A = sorted(A)
diff = min([A[i+1] - A[i] for i in range(N-1)])
for a in [a for a in A if a >= K]:
    if (a - K) % diff == 0:
        print('POSSIBLE')
        break
else:
    print('IMPOSSIBLE')

Submission Info

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

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 4
AC × 11
RE × 8
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 2940 KB
sample_02.txt AC 17 ms 2940 KB
sample_03.txt AC 17 ms 3060 KB
sample_04.txt AC 17 ms 3060 KB
subtask_1_01.txt RE 17 ms 3064 KB
subtask_1_02.txt RE 17 ms 3060 KB
subtask_1_03.txt RE 102 ms 14252 KB
subtask_1_04.txt RE 61 ms 13852 KB
subtask_1_05.txt AC 40 ms 8824 KB
subtask_1_06.txt RE 28 ms 4564 KB
subtask_1_07.txt RE 65 ms 9632 KB
subtask_1_08.txt AC 100 ms 13756 KB
subtask_1_09.txt RE 49 ms 7392 KB
subtask_1_10.txt RE 79 ms 10856 KB
subtask_1_11.txt AC 89 ms 12028 KB