Submission #6004224
Source Code Expand
import itertools n = int(input()) c = [] for _ in range(n): c.append(int(input())) count = 0 p = list(itertools.permutations(c)) for t in p: l = [True] * n for i in range(n): for j in range(i + 1, n): if t[j] % t[i] == 0: l[j] = not l[j] count = count + l.count(True) print(count / len(p))
Submission Info
Submission Time | |
---|---|
Task | C - コイン |
User | kohl |
Language | Python (3.4.3) |
Score | 99 |
Code Size | 359 Byte |
Status | TLE |
Exec Time | 2209 ms |
Memory | 1673508 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 99 / 99 | 0 / 1 | ||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
Subtask1 | subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt |
Subtask2 | subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 17 ms | 3060 KB |
sample_02.txt | AC | 18 ms | 3060 KB |
sample_03.txt | AC | 18 ms | 3064 KB |
subtask1_01.txt | AC | 17 ms | 3064 KB |
subtask1_02.txt | AC | 22 ms | 3064 KB |
subtask1_03.txt | AC | 17 ms | 3060 KB |
subtask1_04.txt | AC | 394 ms | 8052 KB |
subtask1_05.txt | AC | 411 ms | 8052 KB |
subtask1_06.txt | AC | 64 ms | 3572 KB |
subtask1_07.txt | AC | 347 ms | 8052 KB |
subtask1_08.txt | AC | 22 ms | 3060 KB |
subtask1_09.txt | AC | 17 ms | 3064 KB |
subtask1_10.txt | AC | 377 ms | 8052 KB |
subtask1_11.txt | AC | 21 ms | 3064 KB |
subtask1_12.txt | AC | 345 ms | 8052 KB |
subtask1_13.txt | AC | 18 ms | 3064 KB |
subtask1_14.txt | AC | 68 ms | 3572 KB |
subtask1_15.txt | AC | 422 ms | 8052 KB |
subtask1_16.txt | AC | 349 ms | 8052 KB |
subtask1_17.txt | AC | 416 ms | 8052 KB |
subtask1_18.txt | AC | 433 ms | 8052 KB |
subtask1_19.txt | AC | 423 ms | 8052 KB |
subtask1_20.txt | AC | 395 ms | 8052 KB |
subtask2_01.txt | TLE | 2135 ms | 499792 KB |
subtask2_02.txt | TLE | 2203 ms | 1592352 KB |
subtask2_03.txt | TLE | 2206 ms | 1673508 KB |
subtask2_04.txt | TLE | 2200 ms | 1570948 KB |
subtask2_05.txt | TLE | 2202 ms | 1616372 KB |
subtask2_06.txt | TLE | 2202 ms | 1603060 KB |
subtask2_07.txt | TLE | 2201 ms | 1593332 KB |
subtask2_08.txt | TLE | 2201 ms | 1591924 KB |
subtask2_09.txt | TLE | 2204 ms | 1617012 KB |
subtask2_10.txt | TLE | 2201 ms | 1594996 KB |
subtask2_11.txt | TLE | 2202 ms | 1610996 KB |
subtask2_12.txt | TLE | 2202 ms | 1613940 KB |
subtask2_13.txt | TLE | 2200 ms | 1582836 KB |
subtask2_14.txt | TLE | 2203 ms | 1619572 KB |
subtask2_15.txt | TLE | 2202 ms | 1610612 KB |
subtask2_16.txt | TLE | 2203 ms | 1619572 KB |
subtask2_17.txt | TLE | 2209 ms | 1600244 KB |
subtask2_18.txt | TLE | 2199 ms | 1573364 KB |
subtask2_19.txt | TLE | 2202 ms | 1615220 KB |
subtask2_20.txt | TLE | 2202 ms | 1604468 KB |