POJ2151----Check the difficulty of problems（概率dp）

Check the difficulty of problems

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 5802		Accepted: 2527

Description

Organizing a programming contest is not an easy job. To avoid making the problems too difficult, the organizer usually expect the contest result satisfy the following two terms:
1. All of the teams solve at least one problem.
2. The champion (One of those teams that solve the most problems) solves at least a certain number of problems.

Now the organizer has studied out the contest problems, and through the result of preliminary contest, the organizer can estimate the probability that a certain team can successfully solve a certain problem.

Given the number of contest problems M, the number of teams T, and the number of problems N that the organizer expect the champion solve at least. We also assume that team i solves problem j with the probability Pij (1 <= i <= T, 1<= j <= M). Well, can you calculate the probability that all of the teams solve at least one problem, and at the same time the champion team solves at least N problems?

Input

The input consists of several test cases. The first line of each test case contains three integers M (0 < M <= 30), T (1 < T <= 1000) and N (0 < N <= M). Each of the following T lines contains M floating-point numbers in the range of [0,1]. In these T lines, the j-th number in the i-th line is just Pij. A test case of M = T = N = 0 indicates the end of input, and should not be processed.

Output

For each test case, please output the answer in a separate line. The result should be rounded to three digits after the decimal point.

Sample Input

2 2 2
0.9 0.9
1 0.9
0 0 0

Sample Output

0.972

Source

POJ Monthly,鲁小石

#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
using namespace std;
double rate[32][32],p[1010][32];
int main()
{
    int n,m,t;
    double p1,p2,tmp,dp;
    while(scanf("%d%d%d",&m,&t,&n),m+n+t)
    {
        p1=p2=1;
        for(int i=1; i<=t; i++)
        {
            tmp=1;
            for(int j=1; j<=m; j++)
            {
                scanf("%lf",&p[i][j]);
                tmp*=(1-p[i][j]);
            }
            p1*=(1-tmp);
        }
        for(int i=1; i<=t; i++)
        {
            memset(rate,0,sizeof(rate));
            rate[0][0]=1;
            for(int k=1; k<=m; k++)
            {
                rate[0][k]=rate[0][k-1]*(1-p[i][k]);
            }
            for(int j=1; j<=m; j++)  //前k道题做对j道的概率;
            {
                for(int k=1; k<=m; k++)
                {
                    rate[j][k]=p[i][k]*rate[j-1][k-1]+(1-p[i][k])*(rate[j][k-1]);
                    //printf("%d %d %d %.3f\n",i,j,k,rate[j][k]);
                }

            }
            dp=0;
            for(int j=1; j<=n-1; j++)
            {
                dp+=rate[j][m];
            }
            p2*=dp;
        }
        printf("%.3f\n",p1-p2);
    }
    return 0;
}