Submission #5914710
Source Code Expand
N,K = map(int,input().split()) *A, = sorted(set(map(int,input().split()))) if A[-1]<K:print("IMPOSSIBLE");exit() if len(A)==1: if A[0]==K:print("POSSIBLE") else:print("IMPOSSIBLE") exit() d = min(A[i+1]-a for i,a in enumerate(A[:-1])) K%=d for a in A: if a%d==K:print("POSSIBLE");break else: print("IMPOSSIBLE")
Submission Info
Submission Time | |
---|---|
Task | A - Getting Difference |
User | ttm8761 |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 343 Byte |
Status | AC |
Exec Time | 111 ms |
Memory | 19728 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
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 | 3064 KB |
sample_02.txt | AC | 17 ms | 2940 KB |
sample_03.txt | AC | 17 ms | 3064 KB |
sample_04.txt | AC | 17 ms | 3064 KB |
subtask_1_01.txt | AC | 17 ms | 3064 KB |
subtask_1_02.txt | AC | 17 ms | 3060 KB |
subtask_1_03.txt | AC | 111 ms | 19728 KB |
subtask_1_04.txt | AC | 42 ms | 10968 KB |
subtask_1_05.txt | AC | 30 ms | 7284 KB |
subtask_1_06.txt | AC | 28 ms | 5032 KB |
subtask_1_07.txt | AC | 74 ms | 11808 KB |
subtask_1_08.txt | AC | 58 ms | 13336 KB |
subtask_1_09.txt | AC | 49 ms | 9188 KB |
subtask_1_10.txt | AC | 76 ms | 12948 KB |
subtask_1_11.txt | AC | 60 ms | 13052 KB |