Submission #3239121
Source Code Expand
def gcd(a, b): while b: a, b = b, a % b return a n,k = map(int,input().split()) a = list(map(int,input().split())) r = a[0] for i in range(n): r = gcd(r,a[i]) if max(a) < k: print('IMPOSSIBLE') elif max(a) == k: print('POSSIBLE') else: if (max(a) - k ) % r == 0: print('POSSIBLE') else: print('IMPOSSIBLE')
Submission Info
Submission Time | |
---|---|
Task | A - Getting Difference |
User | juppy |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 363 Byte |
Status | AC |
Exec Time | 78 ms |
Memory | 14252 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 | 3060 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 | 3064 KB |
subtask_1_03.txt | AC | 78 ms | 14252 KB |
subtask_1_04.txt | AC | 71 ms | 14108 KB |
subtask_1_05.txt | AC | 45 ms | 8824 KB |
subtask_1_06.txt | AC | 26 ms | 4560 KB |
subtask_1_07.txt | AC | 53 ms | 9632 KB |
subtask_1_08.txt | AC | 69 ms | 13256 KB |
subtask_1_09.txt | AC | 42 ms | 7392 KB |
subtask_1_10.txt | AC | 60 ms | 10852 KB |
subtask_1_11.txt | AC | 65 ms | 12420 KB |