Submission #8436172
Source Code Expand
import numpy as np import sys import math from functools import reduce import fractions as fr def gcd(*numbers): return reduce(fr.gcd, numbers) n,k = map(int,input().split()) a = list(map(int,input().split())) c = int(gcd(*a)) for i in a: if i - k >= 0 and (i-k) % c == 0: print("POSSIBLE") sys.exit() print("IMPOSSIBLE")
Submission Info
Submission Time | |
---|---|
Task | A - Getting Difference |
User | bored_funuke |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 366 Byte |
Status | AC |
Exec Time | 204 ms |
Memory | 24240 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 | 154 ms | 13540 KB |
sample_02.txt | AC | 155 ms | 13540 KB |
sample_03.txt | AC | 154 ms | 13540 KB |
sample_04.txt | AC | 156 ms | 13540 KB |
subtask_1_01.txt | AC | 155 ms | 13540 KB |
subtask_1_02.txt | AC | 154 ms | 13540 KB |
subtask_1_03.txt | AC | 203 ms | 24240 KB |
subtask_1_04.txt | AC | 197 ms | 24024 KB |
subtask_1_05.txt | AC | 183 ms | 19264 KB |
subtask_1_06.txt | AC | 161 ms | 14688 KB |
subtask_1_07.txt | AC | 192 ms | 19800 KB |
subtask_1_08.txt | AC | 204 ms | 23664 KB |
subtask_1_09.txt | AC | 173 ms | 17856 KB |
subtask_1_10.txt | AC | 199 ms | 21504 KB |
subtask_1_11.txt | AC | 200 ms | 22640 KB |