Codeforces Beta Round #50 C. First Digit Law(概率dp,好题)

最新推荐文章于 2020-12-02 21:46:58 发布

___fouzhe

最新推荐文章于 2020-12-02 21:46:58 发布

阅读量300

点赞数

分类专栏：动态规划

本文链接：https://blog.csdn.net/fouzhe/article/details/56008344

版权

博客探讨了概率理论中的Benford's Law，并通过Codeforces上的一个问题介绍了如何运用概率动态规划解决此类问题。文章详细解释了题目要求，即计算在给定区间内随机变量以1开头的概率，并给出了解题思路，特别是概率DP的运用。

摘要由CSDN通过智能技术生成

题目链接

C. First Digit Law

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

In the probability theory the following paradox called Benford's law is known: "In many lists of random numbers taken from real sources, numbers starting with digit 1 occur much more often than numbers starting with any other digit" (that's the simplest form of the law).

Having read about it on Codeforces, the Hedgehog got intrigued by the statement and wishes to thoroughly explore it. He finds the following similar problem interesting in particular: there are N random variables, the i-th of which can take any integer value from some segment [Li;Ri] (all numbers from this segment are equiprobable). It means that t