【UVa】10328 - Coin Toss（递推 & 对立事件 & java）

最新推荐文章于 2023-07-19 12:56:34 发布

wyg1997

最新推荐文章于 2023-07-19 12:56:34 发布

阅读量1.3k

点赞数

分类专栏： java 递推

本文链接：https://blog.csdn.net/wyg1997/article/details/52214919

版权

这篇博客探讨了在公平硬币翻转中，如何计算在n次翻转中至少出现k个连续H的序列数量。通过递推公式和对立事件，作者提供了解决问题的方法，并给出了具体的递推方程。文章包含样例输入和输出，以及使用BigDecimal实现的Java代码。

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

点击打开题目

Toss is an important part of any event. When everything becomes equal toss is the ultimate decider.
Normally a fair coin is used for Toss. A coin has two sides head(H) and tail(T). Superstition may work
in case of choosing head or tail. If anyone becomes winner choosing head he always wants to choose
head. Nobody believes that his winning chance is 50-50. However in this problem we will deal with a
fair coin and n times tossing of such a coin. The result of such a tossing can be represented by a string.
Such as if 3 times tossing is used then there are possible 8 outcomes.
HHH HHT HTH HTT THH THT TTH TTT

As the coin is fair we can consider that the probabil