//hdu4336
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
const int N=25;
double dp[1<<20],p[N];
//dp[s] = (1 - ∑( p[i] ))*dp[s]+ ∑( p[i]*dp[ s ^ (1<<i) ] ) +1;
//dp[s]=(∑( p[i]*dp[ s ^ (1<<i) ] ) +1)/∑( p[i] )
//s某位的1由0转化而来
int main()
{
int n;
while(scanf("%d",&n)==1){
for(int i=0;i<n;i++){
scanf("%lf",&p[i]);
}
dp[(1<<n)-1]=0;
for(int i=(1<<n)-2;i >= 0;i --){
double tmp=0,sum=0;
for(int j=0;j<n;j++)
if(!(i&(1<<j))){//s某位的1由0转化而来
tmp+=p[j]*dp[i^(1<<j)];
sum+=p[j];
}
dp[i]=(tmp+1)/sum;
}
printf("%lf\n",dp[0]);
}
return 0;
}
hdu4336Card Collector_概率dp
最新推荐文章于 2020-05-14 11:29:59 发布