HDU 4336——Card Collector——————【概率dp】
2015-09-05 10:26
323 查看
Card Collector
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3407 Accepted Submission(s): 1665
Special Judge
[align=left]Problem Description[/align]
In your childhood, do you crazy for collecting the beautiful cards in the snacks? They said that, for example, if you collect all the 108 people in the famous novel Water Margin, you will win an amazing award.
As a smart boy, you notice that to win the award, you must buy much more snacks than it seems to be. To convince your friends not to waste money any more, you should find the expected number of snacks one should buy to collect a full suit of cards.
[align=left]Input[/align]
The first line of each test case contains one integer N (1 <= N <= 20), indicating the number of different cards you need the collect. The second line contains N numbers p1, p2, ..., pN, (p1 + p2 + ... + pN <= 1), indicating the possibility of each card to appear in a bag of snacks.
Note there is at most one card in a bag of snacks. And it is possible that there is nothing in the bag.
[align=left]Output[/align]
Output one number for each test case, indicating the expected number of bags to buy to collect all the N different cards.
You will get accepted if the difference between your answer and the standard answer is no more that 10^-4.
[align=left]Sample Input[/align]
1
0.1
2
0.1 0.4
[align=left]Sample Output[/align]
10.000
10.500
[align=left]Source[/align]
2012 Multi-University Training Contest 4
题目大意:要收集方便面中的人物卡片,n是要收集n种卡片,下面给n种卡片的出现概率,问你收集全n种卡片的期望值。
解题思路:概率dp。
#include<bits/stdc++.h> using namespace std; const int maxn=1<<21; double dp[maxn]; double p[21]; int main(){ int n; while(scanf("%d",&n)!=EOF){ for(int i=0;i<n;i++) scanf("%lf",&p[i]); dp[(1<<n)-1]=0; for(int s=(1<<n)-2;s>=0;s--){ double sum=1.0,sump=0; for(int j=0;j<n;j++){ if(!((1<<j)&s)){ sum+=dp[s|(1<<j)]*p[j]; sump+=p[j]; } } dp[s]=sum/sump; } cout<<dp[0]<<"++++"<<endl; printf("%.5f\n",dp[0]); } return 0; }
相关文章推荐
- dojo小例子(35)带校验功能SimpleTextarea
- eclipse打包android项目apk
- 固件的解释
- Coursera机器学习课程笔记(4) Regularization
- 瀑布流-01-自定义布局实现绚丽的瀑布流
- ATPCS规则
- NDK开发之日志打印
- NDK开发之日志打印
- HDU 5241 Friends
- 模拟退火算法解决最近最远问题
- NDK开发之日志打印
- win7 蛋疼的时间格式转化
- NDK开发之日志打印
- 找一个地方记录我的技术成长之路
- Java线程池
- Java中如何由枚举常量的ordinal值获得枚举常量对象
- 杨辉三角(Pascal三角形)
- 欢迎使用CSDN-markdown编辑器
- swift 代码笔记
- android ListView 防止图片上拉跳动