DP I
Given a number of coins and the probability of each of them being heads, the problem of finding the probability that the number of heads is greater than the number of tails.
The number of coins that are face up when looking at the coins from the top is the domain of definition, and the value is the probability of the coin being face up.
Python TLE PyPy AC
code:python
def solve(N, probs):
for i in range(N):
for j in range(N):
for j in range(N + 1):
m = n
---
This page is auto-translated from /nishio/DP I. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I'm very happy to spread my thought to non-Japanese readers.