Submission #3233144
Source Code Expand
import fractions n,m = map(int,input().split()) lis = list(map(int,input().split())) num = lis[0] for i in range(1,n): num = fractions.gcd(num,lis[i]) if m <= max(lis) and m % num == 0: print("POSSIBLE") else:print("IMPOSSIBLE")
Submission Info
Submission Time | |
---|---|
Task | A - Getting Difference |
User | tako0218 |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 240 Byte |
Status | AC |
Exec Time | 94 ms |
Memory | 16240 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 | 41 ms | 5472 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 | 35 ms | 5048 KB |
subtask_1_03.txt | AC | 94 ms | 16240 KB |
subtask_1_04.txt | AC | 90 ms | 15984 KB |
subtask_1_05.txt | AC | 64 ms | 10976 KB |
subtask_1_06.txt | AC | 43 ms | 6668 KB |
subtask_1_07.txt | AC | 70 ms | 11708 KB |
subtask_1_08.txt | AC | 89 ms | 15088 KB |
subtask_1_09.txt | AC | 59 ms | 9516 KB |
subtask_1_10.txt | AC | 77 ms | 13016 KB |
subtask_1_11.txt | AC | 83 ms | 14064 KB |