Submission #8436137
Source Code Expand
import numpy as np import sys import math from functools import reduce import fractions def gcd(*numbers): return reduce(math.gcd, numbers) n,k = map(int,input().split()) a = list(map(int,input().split())) c = fractions.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 | 0 |
Code Size | 366 Byte |
Status | RE |
Exec Time | 180 ms |
Memory | 25012 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | RE | 153 ms | 13512 KB |
sample_02.txt | RE | 154 ms | 13512 KB |
sample_03.txt | RE | 153 ms | 13512 KB |
sample_04.txt | RE | 153 ms | 13512 KB |
subtask_1_01.txt | RE | 153 ms | 13476 KB |
subtask_1_02.txt | RE | 154 ms | 15560 KB |
subtask_1_03.txt | RE | 180 ms | 25012 KB |
subtask_1_04.txt | RE | 180 ms | 24088 KB |
subtask_1_05.txt | RE | 167 ms | 19268 KB |
subtask_1_06.txt | RE | 157 ms | 14660 KB |
subtask_1_07.txt | RE | 171 ms | 19772 KB |
subtask_1_08.txt | RE | 179 ms | 23764 KB |
subtask_1_09.txt | RE | 163 ms | 17860 KB |
subtask_1_10.txt | RE | 172 ms | 21476 KB |
subtask_1_11.txt | RE | 175 ms | 22612 KB |