Submission #5906518
Source Code Expand
import os import sys import numpy as np if os.getenv("LOCAL"): sys.stdin = open("_in.txt", "r") sys.setrecursionlimit(2147483647) INF = float("inf") N = int(sys.stdin.readline()) C = [int(sys.stdin.readline()) for _ in range(N)] # 裏の確率: 約数が d 個あったとき、それらが左に奇数個ある確率 # == d+1 個のコインを並べたとき、あるコインが左から偶数番目にある確率 # == floor((d+1)/2) / (d+1) C = np.array(C) ans = 0 for c in C: divisors = (c % C == 0).sum() - 1 # 1 - 裏の確率 ans += 1 - (divisors + 1) // 2 / (divisors + 1) print(ans)
Submission Info
Submission Time | |
---|---|
Task | C - コイン |
User | nohtaray |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 641 Byte |
Status | AC |
Exec Time | 153 ms |
Memory | 12440 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 99 / 99 | 1 / 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 | 150 ms | 12396 KB |
sample_02.txt | AC | 150 ms | 12396 KB |
sample_03.txt | AC | 150 ms | 12396 KB |
subtask1_01.txt | AC | 150 ms | 12396 KB |
subtask1_02.txt | AC | 150 ms | 12396 KB |
subtask1_03.txt | AC | 149 ms | 12396 KB |
subtask1_04.txt | AC | 150 ms | 12396 KB |
subtask1_05.txt | AC | 149 ms | 12396 KB |
subtask1_06.txt | AC | 151 ms | 12396 KB |
subtask1_07.txt | AC | 150 ms | 12396 KB |
subtask1_08.txt | AC | 150 ms | 12396 KB |
subtask1_09.txt | AC | 150 ms | 12440 KB |
subtask1_10.txt | AC | 149 ms | 12396 KB |
subtask1_11.txt | AC | 150 ms | 12396 KB |
subtask1_12.txt | AC | 150 ms | 12396 KB |
subtask1_13.txt | AC | 149 ms | 12396 KB |
subtask1_14.txt | AC | 150 ms | 12396 KB |
subtask1_15.txt | AC | 150 ms | 12396 KB |
subtask1_16.txt | AC | 150 ms | 12396 KB |
subtask1_17.txt | AC | 149 ms | 12400 KB |
subtask1_18.txt | AC | 150 ms | 12396 KB |
subtask1_19.txt | AC | 152 ms | 12396 KB |
subtask1_20.txt | AC | 150 ms | 12396 KB |
subtask2_01.txt | AC | 151 ms | 12400 KB |
subtask2_02.txt | AC | 149 ms | 12396 KB |
subtask2_03.txt | AC | 149 ms | 12396 KB |
subtask2_04.txt | AC | 149 ms | 12396 KB |
subtask2_05.txt | AC | 151 ms | 12396 KB |
subtask2_06.txt | AC | 151 ms | 12396 KB |
subtask2_07.txt | AC | 151 ms | 12396 KB |
subtask2_08.txt | AC | 151 ms | 12396 KB |
subtask2_09.txt | AC | 152 ms | 12396 KB |
subtask2_10.txt | AC | 152 ms | 12268 KB |
subtask2_11.txt | AC | 152 ms | 12396 KB |
subtask2_12.txt | AC | 152 ms | 12396 KB |
subtask2_13.txt | AC | 152 ms | 12396 KB |
subtask2_14.txt | AC | 151 ms | 12396 KB |
subtask2_15.txt | AC | 152 ms | 12396 KB |
subtask2_16.txt | AC | 152 ms | 12396 KB |
subtask2_17.txt | AC | 152 ms | 12396 KB |
subtask2_18.txt | AC | 150 ms | 12396 KB |
subtask2_19.txt | AC | 152 ms | 12396 KB |
subtask2_20.txt | AC | 153 ms | 12396 KB |