Submission #3734749
Source Code Expand
N, K = [int(_) for _ in input().split()] A = [int(_) for _ in input().split()] def gcd(x, y): if x < y: return gcd(y, x) elif y == 0: return x else: return gcd(y, x % y) g = A[0] for a in A: g = 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 | 300 |
Code Size | 352 Byte |
Status | AC |
Exec Time | 98 ms |
Memory | 14224 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 | 18 ms | 2940 KB |
sample_02.txt | AC | 18 ms | 3060 KB |
sample_03.txt | AC | 18 ms | 3060 KB |
sample_04.txt | AC | 18 ms | 2940 KB |
subtask_1_01.txt | AC | 18 ms | 3060 KB |
subtask_1_02.txt | AC | 18 ms | 2940 KB |
subtask_1_03.txt | AC | 98 ms | 14224 KB |
subtask_1_04.txt | AC | 84 ms | 13848 KB |
subtask_1_05.txt | AC | 53 ms | 8824 KB |
subtask_1_06.txt | AC | 30 ms | 4564 KB |
subtask_1_07.txt | AC | 64 ms | 9632 KB |
subtask_1_08.txt | AC | 87 ms | 13256 KB |
subtask_1_09.txt | AC | 51 ms | 7396 KB |
subtask_1_10.txt | AC | 72 ms | 10852 KB |
subtask_1_11.txt | AC | 82 ms | 12420 KB |