[高精度+递推] uva 10328 Coin Toss

最新推荐文章于 2025-03-27 16:30:45 发布

Accagain

最新推荐文章于 2025-03-27 16:30:45 发布

阅读量4.5k

点赞数 1

分类专栏：动态规划

本文链接：https://blog.csdn.net/cc_again/article/details/24844911

版权

博客介绍了如何解决UVA在线判题系统中的10328题——Coin Toss。该问题涉及公平硬币抛掷n次，重复2^n次，求至少有k次连续正面的概率。解题策略采用高精度计算和递推方法，通过动态规划计算最多k张连续正面的排列组合数。给出了解题思路和代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目链接：

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1269

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 probability of each outcome is also equal. For simplicity we can consider that if the same thing is repeated 8 times we can expect to get each possible sequence once.

最低0.47元/天解锁文章