Submission #4665727
Source Code Expand
from itertools import permutations from math import factorial N = int(input()) C = [] for i in range(N): C.append(int(input())) P = permutations(C,N) ans = 0 for p in P: tmp = [True] * N for i in range(N): for j in range(i+1,N): if p[j] % p[i] == 0: tmp[j] = not tmp[j] ans += sum(tmp) print(ans/factorial(N))
Submission Info
Submission Time | |
---|---|
Task | C - コイン |
User | tacoyama |
Language | Python (3.4.3) |
Score | 99 |
Code Size | 365 Byte |
Status | TLE |
Exec Time | 2104 ms |
Memory | 3064 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 | 3064 KB |
sample_02.txt | AC | 17 ms | 3060 KB |
sample_03.txt | AC | 18 ms | 3064 KB |
subtask1_01.txt | AC | 17 ms | 3064 KB |
subtask1_02.txt | AC | 21 ms | 3064 KB |
subtask1_03.txt | AC | 17 ms | 3064 KB |
subtask1_04.txt | AC | 370 ms | 3060 KB |
subtask1_05.txt | AC | 418 ms | 3064 KB |
subtask1_06.txt | AC | 57 ms | 3060 KB |
subtask1_07.txt | AC | 406 ms | 3060 KB |
subtask1_08.txt | AC | 22 ms | 3064 KB |
subtask1_09.txt | AC | 17 ms | 3060 KB |
subtask1_10.txt | AC | 385 ms | 3060 KB |
subtask1_11.txt | AC | 22 ms | 3064 KB |
subtask1_12.txt | AC | 360 ms | 3064 KB |
subtask1_13.txt | AC | 18 ms | 3064 KB |
subtask1_14.txt | AC | 66 ms | 3064 KB |
subtask1_15.txt | AC | 395 ms | 3064 KB |
subtask1_16.txt | AC | 341 ms | 3060 KB |
subtask1_17.txt | AC | 419 ms | 3060 KB |
subtask1_18.txt | AC | 440 ms | 3064 KB |
subtask1_19.txt | AC | 462 ms | 3064 KB |
subtask1_20.txt | AC | 392 ms | 3064 KB |
subtask2_01.txt | TLE | 2104 ms | 3064 KB |
subtask2_02.txt | TLE | 2103 ms | 3064 KB |
subtask2_03.txt | TLE | 2104 ms | 3060 KB |
subtask2_04.txt | TLE | 2104 ms | 3064 KB |
subtask2_05.txt | TLE | 2104 ms | 3064 KB |
subtask2_06.txt | TLE | 2104 ms | 3064 KB |
subtask2_07.txt | TLE | 2104 ms | 3064 KB |
subtask2_08.txt | TLE | 2104 ms | 3064 KB |
subtask2_09.txt | TLE | 2104 ms | 3064 KB |
subtask2_10.txt | TLE | 2104 ms | 3064 KB |
subtask2_11.txt | TLE | 2104 ms | 3060 KB |
subtask2_12.txt | TLE | 2104 ms | 3064 KB |
subtask2_13.txt | TLE | 2104 ms | 3060 KB |
subtask2_14.txt | TLE | 2104 ms | 3064 KB |
subtask2_15.txt | TLE | 2104 ms | 3060 KB |
subtask2_16.txt | TLE | 2104 ms | 3060 KB |
subtask2_17.txt | TLE | 2104 ms | 3064 KB |
subtask2_18.txt | TLE | 2104 ms | 3064 KB |
subtask2_19.txt | TLE | 2104 ms | 3064 KB |
subtask2_20.txt | TLE | 2103 ms | 3060 KB |