Submission #8501590
Source Code Expand
import math import fractions from functools import reduce n,k=map(int,input().split()) a=list(map(int,input().split())) def gcd(*numbers): return reduce(fractions.gcd, numbers) def gcd_list(numbers): return reduce(fractions.gcd, numbers) b=gcd(*a) if max(a)-k>=0 and (max(a)-k)%b==0: print("POSSIBLE") else: print("IMPOSSIBLE")
Submission Info
Submission Time | |
---|---|
Task | A - Getting Difference |
User | Nekorinrin |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 356 Byte |
Status | AC |
Exec Time | 85 ms |
Memory | 16300 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 | 42 ms | 5236 KB |
sample_02.txt | AC | 35 ms | 5072 KB |
sample_03.txt | AC | 35 ms | 5072 KB |
sample_04.txt | AC | 37 ms | 5072 KB |
subtask_1_01.txt | AC | 35 ms | 5072 KB |
subtask_1_02.txt | AC | 35 ms | 5072 KB |
subtask_1_03.txt | AC | 85 ms | 16300 KB |
subtask_1_04.txt | AC | 80 ms | 15936 KB |
subtask_1_05.txt | AC | 58 ms | 10868 KB |
subtask_1_06.txt | AC | 42 ms | 6600 KB |
subtask_1_07.txt | AC | 65 ms | 11572 KB |
subtask_1_08.txt | AC | 79 ms | 15108 KB |
subtask_1_09.txt | AC | 55 ms | 9452 KB |
subtask_1_10.txt | AC | 72 ms | 12948 KB |
subtask_1_11.txt | AC | 75 ms | 14084 KB |