Submission #379113
Source Code Expand
import itertools N = int(input()) coins = [int(input()) for _ in range(N)] total = 0 for coin in itertools.permutations(coins): checklist = [True] * N for i in range(0, N): for j in range(i + 1, N): if coin[j] % coin[i] == 0: checklist[j] = not checklist[j] for i in range(N): if checklist[i]: total += 1 combi = 1 for i in range(1, N + 1): combi *= i print(total / combi)
Submission Info
Submission Time | |
---|---|
Task | C - コイン |
User | yumechi |
Language | Python (3.2.3) |
Score | 99 |
Code Size | 436 Byte |
Status | TLE |
Exec Time | 2040 ms |
Memory | 8608 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 | 216 ms | 8492 KB |
sample_02.txt | AC | 131 ms | 8476 KB |
sample_03.txt | AC | 127 ms | 8492 KB |
subtask1_01.txt | AC | 128 ms | 8492 KB |
subtask1_02.txt | AC | 140 ms | 8492 KB |
subtask1_03.txt | AC | 134 ms | 8488 KB |
subtask1_04.txt | AC | 949 ms | 8492 KB |
subtask1_05.txt | AC | 991 ms | 8492 KB |
subtask1_06.txt | AC | 232 ms | 8492 KB |
subtask1_07.txt | AC | 927 ms | 8396 KB |
subtask1_08.txt | AC | 150 ms | 8492 KB |
subtask1_09.txt | AC | 143 ms | 8492 KB |
subtask1_10.txt | AC | 975 ms | 8488 KB |
subtask1_11.txt | AC | 140 ms | 8492 KB |
subtask1_12.txt | AC | 925 ms | 8492 KB |
subtask1_13.txt | AC | 132 ms | 8476 KB |
subtask1_14.txt | AC | 247 ms | 8488 KB |
subtask1_15.txt | AC | 1067 ms | 8492 KB |
subtask1_16.txt | AC | 918 ms | 8472 KB |
subtask1_17.txt | AC | 1062 ms | 8492 KB |
subtask1_18.txt | AC | 1088 ms | 8484 KB |
subtask1_19.txt | AC | 1020 ms | 8492 KB |
subtask1_20.txt | AC | 1031 ms | 8492 KB |
subtask2_01.txt | TLE | 2035 ms | 8608 KB |
subtask2_02.txt | TLE | 2036 ms | 8512 KB |
subtask2_03.txt | TLE | 2039 ms | 8472 KB |
subtask2_04.txt | TLE | 2038 ms | 8608 KB |
subtask2_05.txt | TLE | 2039 ms | 8608 KB |
subtask2_06.txt | TLE | 2035 ms | 8496 KB |
subtask2_07.txt | TLE | 2036 ms | 8608 KB |
subtask2_08.txt | TLE | 2035 ms | 8608 KB |
subtask2_09.txt | TLE | 2036 ms | 8600 KB |
subtask2_10.txt | TLE | 2036 ms | 8604 KB |
subtask2_11.txt | TLE | 2035 ms | 8608 KB |
subtask2_12.txt | TLE | 2040 ms | 8520 KB |
subtask2_13.txt | TLE | 2037 ms | 8480 KB |
subtask2_14.txt | TLE | 2035 ms | 8608 KB |
subtask2_15.txt | TLE | 2036 ms | 8492 KB |
subtask2_16.txt | TLE | 2035 ms | 8604 KB |
subtask2_17.txt | TLE | 2036 ms | 8608 KB |
subtask2_18.txt | TLE | 2037 ms | 8608 KB |
subtask2_19.txt | TLE | 2036 ms | 8552 KB |
subtask2_20.txt | TLE | 2036 ms | 8608 KB |