HDOJ4336Card Collector【概率dp求期望+状态压缩】
来源:互联网 发布:淘宝店自动充值软件 编辑:程序博客网 时间:2024/06/06 17:25
Card Collector
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3382 Accepted Submission(s): 1650
Special Judge
Problem Description
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.
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.
Input
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.
Note there is at most one card in a bag of snacks. And it is possible that there is nothing in the bag.
Output
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.
You will get accepted if the difference between your answer and the standard answer is no more that 10^-4.
Sample Input
10.120.1 0.4
Sample Output
10.00010.500
题意:需要收集N张卡片给出集到每张卡片的概率求集出N张卡片的要取卡片次数的期望
#include<cstdio>#include<cstdlib>#include<cstring>using namespace std;double dp[1<<20];//dp[i]表示状态为i时的期望; double p[22];int main(){int n,i,j,k;while(scanf("%d",&n)!=EOF){double p1=0;for(i=0;i<n;++i){scanf("%lf",&p[i]);p1+=p[i];}p1=1-p1;memset(dp,0,sizeof(dp));for(i=(1<<n)-2;i>=0;--i){double p2=0,e=1;for(j=0;j<n;++j){//列举当前状态所有情况; if(i&1<<j){p2+=p[j];}else{e+=dp[i|(1<<j)]*p[j];}}dp[i]=e/(1-p1-p2);}printf("%.4lf\n",dp[0]);}return 0;}
0 0
- HDOJ4336Card Collector【概率dp求期望+状态压缩】
- HDU4336-Card Collector(概率DP求期望)
- hdu4336Card Collector 概率dp+状态压缩
- hdoj 4336 card collector(状态压缩dp求数学期望)
- 【HDU4336】Card Collector-状态压缩DP+期望DP
- hdu 4336 Card Collector 概率DP 求期望
- hdu-4336 Card Collector状态压缩|期望dp】
- hdu 4336 Card Collector 概率DP 状态压缩DP
- HDU 4336 Card Collector(状态压缩dp+概率dp)
- BZOJ_P1076 [SCOI2008]奖励关(概率期望DP+状态压缩DP)
- 概率dp 求期望
- HDU 4336 Card Collector 状态压缩+概率DP
- hdu 4336 Card Collector 概率dp+状态压缩
- HDU 4336 Card Collector 状态压缩 概率DP
- hdu 4336 Card Collector(状态压缩概率dp)
- HDU 4336Card Collector 概率dp 状态压缩
- HDU 4336 Card Collector(状态压缩+概率DP)
- Hdu 4336 Card Collector 概率DP+状态压缩
- 【请求加密】android ios java后台通用DES base64加密
- 清华梦的粉碎—写给清华大学的退学申请 /王垠
- android activity
- HPU 1713 参观城市【邻接表 队列 记录前驱点】
- 1710: 最后一个1
- HDOJ4336Card Collector【概率dp求期望+状态压缩】
- Digital Roots
- 程序员面试金典1.1:确定字符串的所有字符是否全都不同
- 如何更好地管理你的数据库——navicat
- addStretch的作用 .
- 面试中的C++常见问题
- ACdream 1213 Matrix Multiplication(矩阵乘法)
- [ERROR:] [插入失败] code is 9998;desc is 得到唯一对象不唯一exception is null
- Android Studio开发入门-引用jar及so文件