Submission #6395537
Source Code Expand
N, K = map(int, input().split()) A = list(map(int, input().split())) import itertools flag = True while(flag): count = 0 A_2 = list(itertools.combinations(A,2)) for comb in A_2: diff = abs(comb[0] - comb[1]) if diff not in A: A.append(diff) else: count += 1 else: if (count == len(A_2)): flag = False if K in A: print('POSSIBLE') else: print('IMPOSSIBLE')
Submission Info
Submission Time | |
---|---|
Task | A - Getting Difference |
User | xanxus1204 |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 470 Byte |
Status | TLE |
Exec Time | 2248 ms |
Memory | 2008312 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 | AC | 17 ms | 3060 KB |
sample_02.txt | AC | 17 ms | 3060 KB |
sample_03.txt | AC | 17 ms | 3060 KB |
sample_04.txt | AC | 17 ms | 3064 KB |
subtask_1_01.txt | AC | 17 ms | 3060 KB |
subtask_1_02.txt | AC | 17 ms | 3060 KB |
subtask_1_03.txt | TLE | 2228 ms | 1931180 KB |
subtask_1_04.txt | TLE | 2248 ms | 1993072 KB |
subtask_1_05.txt | TLE | 2237 ms | 2008312 KB |
subtask_1_06.txt | TLE | 2234 ms | 1981012 KB |
subtask_1_07.txt | TLE | 2235 ms | 1996060 KB |
subtask_1_08.txt | TLE | 2233 ms | 1995976 KB |
subtask_1_09.txt | TLE | 2233 ms | 1994984 KB |
subtask_1_10.txt | TLE | 2236 ms | 1989476 KB |
subtask_1_11.txt | TLE | 2234 ms | 1984508 KB |