[poj 2096]Collecting Bugs 概率DP

最新推荐文章于 2022-07-24 20:49:14 发布

真·skysys

最新推荐文章于 2022-07-24 20:49:14 发布

阅读量499

点赞数 1

CC 4.0 BY-SA版权

分类专栏：算法与数学文章标签： poj dp 概率

请明确标注出处

本文链接：https://blog.youkuaiyun.com/qq_33583069/article/details/51992975

算法与数学专栏收录该内容

469 篇文章 ¥29.90 ¥99.00

订阅专栏

超级会员免费看

Ivan热衷于收集软件bug，他为Macrosoft的一个程序分类并寻找不同子组件的bug。Microhard雇佣他证明该程序有缺陷，要求至少在每个子组件中找到一个bug且涵盖所有类别。Macrosoft想预估Ivan完成这项任务所需的平均天数，输入包含bug类别数n和子组件数s，输出结果精确到4位小数。

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

Collecting Bugs
Time Limit: 10000MS Memory Limit: 64000K
Total Submissions: 4767 Accepted: 2354
Case Time Limit: 2000MS Special Judge

Description
Ivan is fond of collecting. Unlike other people who collect post stamps, coins or other material stuff, he collects software bugs. When Ivan gets a new program, he classifies all possible bugs into n categories. Each day he discovers exactly one bug in the program and adds information about it and its category into a spreadsheet. When he finds bugs in all bug categories, he calls the program disgusting, publishes this spreadsheet on his home page, and forgets completely about the program.
Two companies, Macrosoft and Microhard are in tight competition. Microhard wants to decrease sales of one Macrosoft program.

了解本专栏