ACM 概率DP hdu4336

概率DP

鉴于n的值比较小，状态压缩DP

参考容斥原理的做法

参考题解：

/*
 * Author: NICK WONG
 * Created Time:  2015/8/1 21:18:24
 * File Name: k.cpp
 */
//hdu4336
#include<iostream>
#include<sstream>
#include<fstream>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<cmath>
#include<ctime>
#include<iomanip>
using namespace std;
#define out(x) cout<<#x<<": "<<x<<endl
const double eps(1e-8);
const int maxn=10100;
const long long maxint=-1u>>1;
const long long maxlong=maxint*maxint;
typedef long long lint;
int n;
double p[maxn],ans,f[1<<20];

void init()
{
    for (int i=0; i<=n-1; i++)
        cin>>p[i];
}


void work()
{
    ans=0;
    memset(f,0,sizeof(f));
    for (int i=(1<<n)-2; i>=0; i--)
    {
        double tmp=0;
        f[i]=1;
        for (int j=0; j<=n-1; j++)
        {
            if ((i & (1<<j))== 0)
            {
                //out(233);
                f[i]+=f[i | (1<<j)]*p[j];
                tmp+=p[j];   
            }
        }
        f[i]/=tmp;
    }
    ans=f[0];
    printf("%.4f\n",ans);
}

int main()
{
    while(cin>>n)
    {
    init();
    work();
    }
    return 0;
}

K - Card Collector

Crawling in process... Crawling failed Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit Status Practice HDU 4336

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.

 

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.

 

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.

 

Sample Input

     
     

      
      1
0.1
2
0.1 0.4 
     
     

 

Sample Output

     
     

      
      10.000
10.500