Submission #8412199
Source Code Expand
import fractions n,k=map(int,input().split()) al=list(map(int,input().split())) m=max(al) f=al[0] for i in range(1,n): f=fractions.gcd(f,al[i]) print('POSSIBLE' if k<=m and k%f==0 else 'IMPOSSIBLE')
Submission Info
Submission Time | |
---|---|
Task | A - Getting Difference |
User | soitakahashi |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 209 Byte |
Status | AC |
Exec Time | 92 ms |
Memory | 16280 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 | 35 ms | 5048 KB |
sample_02.txt | AC | 35 ms | 5048 KB |
sample_03.txt | AC | 35 ms | 5048 KB |
sample_04.txt | AC | 35 ms | 5048 KB |
subtask_1_01.txt | AC | 35 ms | 5048 KB |
subtask_1_02.txt | AC | 34 ms | 5048 KB |
subtask_1_03.txt | AC | 92 ms | 16280 KB |
subtask_1_04.txt | AC | 88 ms | 15936 KB |
subtask_1_05.txt | AC | 65 ms | 10936 KB |
subtask_1_06.txt | AC | 43 ms | 6668 KB |
subtask_1_07.txt | AC | 70 ms | 11596 KB |
subtask_1_08.txt | AC | 89 ms | 15048 KB |
subtask_1_09.txt | AC | 58 ms | 9472 KB |
subtask_1_10.txt | AC | 75 ms | 13016 KB |
subtask_1_11.txt | AC | 82 ms | 14152 KB |