Submission #303002
Source Code Expand
#!/usr/bin/env python # -*- coding: utf-8 -*- import itertools import math N = int(input()) C = [int(input()) for i in range(0,N)] count = 0 for t in itertools.permutations(C): coin = [0 for i in range(len(t))] for i in range(len(t)): for j in range(i,len(t)): coin[j] = coin[j]^1 if t[j]%t[i] == 0 else coin[j] count += sum([1 if coin[i] == 1 else 0 for i in range(len(t))]) print(count/(math.factorial(N)))
Submission Info
Submission Time | |
---|---|
Task | C - コイン |
User | emon |
Language | Python (3.2.3) |
Score | 99 |
Code Size | 467 Byte |
Status | TLE |
Exec Time | 2040 ms |
Memory | 6992 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 | 137 ms | 6896 KB |
sample_02.txt | AC | 118 ms | 6820 KB |
sample_03.txt | AC | 121 ms | 6916 KB |
subtask1_01.txt | AC | 117 ms | 6836 KB |
subtask1_02.txt | AC | 134 ms | 6904 KB |
subtask1_03.txt | AC | 118 ms | 6892 KB |
subtask1_04.txt | AC | 1343 ms | 6896 KB |
subtask1_05.txt | AC | 1331 ms | 6792 KB |
subtask1_06.txt | AC | 246 ms | 6796 KB |
subtask1_07.txt | AC | 1331 ms | 6800 KB |
subtask1_08.txt | AC | 136 ms | 6840 KB |
subtask1_09.txt | AC | 121 ms | 6796 KB |
subtask1_10.txt | AC | 1354 ms | 6892 KB |
subtask1_11.txt | AC | 133 ms | 6900 KB |
subtask1_12.txt | AC | 1323 ms | 6800 KB |
subtask1_13.txt | AC | 122 ms | 6796 KB |
subtask1_14.txt | AC | 250 ms | 6896 KB |
subtask1_15.txt | AC | 1342 ms | 6800 KB |
subtask1_16.txt | AC | 1321 ms | 6908 KB |
subtask1_17.txt | AC | 1333 ms | 6896 KB |
subtask1_18.txt | AC | 1358 ms | 6796 KB |
subtask1_19.txt | AC | 1355 ms | 6796 KB |
subtask1_20.txt | AC | 1353 ms | 6792 KB |
subtask2_01.txt | TLE | 2038 ms | 6912 KB |
subtask2_02.txt | TLE | 2038 ms | 6896 KB |
subtask2_03.txt | TLE | 2040 ms | 6896 KB |
subtask2_04.txt | TLE | 2039 ms | 6916 KB |
subtask2_05.txt | TLE | 2037 ms | 6916 KB |
subtask2_06.txt | TLE | 2038 ms | 6912 KB |
subtask2_07.txt | TLE | 2038 ms | 6912 KB |
subtask2_08.txt | TLE | 2037 ms | 6916 KB |
subtask2_09.txt | TLE | 2038 ms | 6992 KB |
subtask2_10.txt | TLE | 2038 ms | 6912 KB |
subtask2_11.txt | TLE | 2038 ms | 6916 KB |
subtask2_12.txt | TLE | 2038 ms | 6912 KB |
subtask2_13.txt | TLE | 2038 ms | 6916 KB |
subtask2_14.txt | TLE | 2038 ms | 6952 KB |
subtask2_15.txt | TLE | 2037 ms | 6912 KB |
subtask2_16.txt | TLE | 2039 ms | 6916 KB |
subtask2_17.txt | TLE | 2038 ms | 6916 KB |
subtask2_18.txt | TLE | 2038 ms | 6904 KB |
subtask2_19.txt | TLE | 2039 ms | 6912 KB |
subtask2_20.txt | TLE | 2039 ms | 6916 KB |