Submission #5998303
Source Code Expand
import math N=int(input()) C=[int(input()) for _ in range(N)] num_of_divisor=[] expected_value = N count_list = [0]*(N+1) def count(a,N,list1): if a == 1: prob = 0.5 count_list[a]=prob elif count_list[a]!=0: prob = count_list[a] else: prob = 0 odd = 0 for j in range(1,a+1): if j%2==1: odd+=10000 denom = math.factorial(N-a-1)*(a+1) pattern = float(odd/denom) pattern /= 10000 prob += pattern count_list[a]=prob return prob for i in range(N): n=0 for j in range(N): if C[i]%C[j]==0: n+=1 num_of_divisor.append(n-1) for i in range(N): if num_of_divisor[i]!=0: p=num_of_divisor[i] k = count(p,N,count_list) expected_value -= k print(expected_value)
Submission Info
Submission Time | |
---|---|
Task | C - コイン |
User | mochita |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 883 Byte |
Status | WA |
Exec Time | 20 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 3064 KB |
sample_03.txt | AC | 17 ms | 3064 KB |
subtask1_01.txt | AC | 17 ms | 3064 KB |
subtask1_02.txt | WA | 17 ms | 3064 KB |
subtask1_03.txt | AC | 17 ms | 3064 KB |
subtask1_04.txt | WA | 17 ms | 3064 KB |
subtask1_05.txt | WA | 17 ms | 3064 KB |
subtask1_06.txt | WA | 17 ms | 3064 KB |
subtask1_07.txt | AC | 17 ms | 3064 KB |
subtask1_08.txt | WA | 17 ms | 3064 KB |
subtask1_09.txt | AC | 17 ms | 3064 KB |
subtask1_10.txt | WA | 17 ms | 3064 KB |
subtask1_11.txt | WA | 17 ms | 3064 KB |
subtask1_12.txt | AC | 17 ms | 3064 KB |
subtask1_13.txt | WA | 17 ms | 3064 KB |
subtask1_14.txt | AC | 17 ms | 3064 KB |
subtask1_15.txt | WA | 17 ms | 3064 KB |
subtask1_16.txt | AC | 17 ms | 3064 KB |
subtask1_17.txt | WA | 17 ms | 3064 KB |
subtask1_18.txt | WA | 17 ms | 3064 KB |
subtask1_19.txt | WA | 17 ms | 3064 KB |
subtask1_20.txt | WA | 17 ms | 3064 KB |
subtask2_01.txt | WA | 17 ms | 3064 KB |
subtask2_02.txt | AC | 17 ms | 3064 KB |
subtask2_03.txt | WA | 17 ms | 3064 KB |
subtask2_04.txt | WA | 18 ms | 3064 KB |
subtask2_05.txt | WA | 19 ms | 3064 KB |
subtask2_06.txt | AC | 18 ms | 3064 KB |
subtask2_07.txt | AC | 18 ms | 3064 KB |
subtask2_08.txt | WA | 20 ms | 3064 KB |
subtask2_09.txt | WA | 20 ms | 3064 KB |
subtask2_10.txt | WA | 19 ms | 3064 KB |
subtask2_11.txt | WA | 20 ms | 3064 KB |
subtask2_12.txt | WA | 19 ms | 3064 KB |
subtask2_13.txt | WA | 18 ms | 3064 KB |
subtask2_14.txt | WA | 20 ms | 3064 KB |
subtask2_15.txt | WA | 19 ms | 3064 KB |
subtask2_16.txt | AC | 19 ms | 3064 KB |
subtask2_17.txt | WA | 20 ms | 3064 KB |
subtask2_18.txt | AC | 18 ms | 3064 KB |
subtask2_19.txt | AC | 19 ms | 3064 KB |
subtask2_20.txt | WA | 20 ms | 3064 KB |