POJ 2151 Check the difficulty of problems(DP)

Check the difficulty of problems

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 4403		Accepted: 1941

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

[cpp]  view plain  copy

 print ?

1. /*题意： 
2. ACM比赛中，共M道题，T个队，pij表示第i队解出第j题的概率 
3. 问 每队至少解出一题且冠军队至少解出N道题的概率。 
4.  
5. 分析： 
6. 对于需要求得概率比较容易想到： 
7. 假设p1为每个队至少解出一题的概率，这个容易算出。 
8. 假设p2为每个队至少解出一题但是不超过n-1题的概率 
9. 所以最终答案为：p1-p2 
10. 现在问题是如何求出p2? 
11. 假设dp[i][j]表示第i个队解出的题目<=j的概率 
12. 则dp[i][j]=解出1题+解出2题+...解出j题的概率 
13. 现在问题转化为如何求解出1，2，3...k题的概率 
14. 假设x[i][j][k]表示第i个队在前j题解出k题的概率 
15. 则: 
16. x[i][j][k]=x[i][j-1][k-1]*p[i][j]+x[i][j-1][k]*(1-p[i][j]); 
17. 所以x[i][M][k]表示的就是第i个队解出k题的概率  
18. */  
19. #include <iostream>  
20. #include <cstdio>  
21. #include <cstdlib>  
22. #include <cstring>  
23. #include <string>  
24. #include <queue>  
25. #include <algorithm>  
26. #include <map>  
27. #include <cmath>  
28. #include <iomanip>  
29. #define INF 99999999  
30. typedef long long LL;  
31. using namespace std;  
32.   
33. const int MAX=1000+10;  
34. const int N=30+10;  
35. int m,t,n,index;  
36. double x[2][N],dp,p[MAX][N];  
37.   
38. int main(){  
39.     while(cin>>m>>t>>n,m+t+n){  
40.         double p1=1,p2=1,temp=1;  
41.         for(int i=1;i<=t;++i){  
42.             temp=1;  
43.             for(int j=1;j<=m;++j){cin>>p[i][j];temp=temp*(1-p[i][j]);}  
44.             p1=p1*(1-temp);//1-temp表示至少解出一道题   
45.         }  
46.         for(int i=1;i<=t;++i){  
47.             index=0;  
48.             memset(x,0,sizeof x);//初始化前0个解出1~m为0   
49.             x[0][0]=1;//前0个解出0个为1   
50.             for(int j=1;j<=m;++j){  
51.                 index=index^1;  
52.                 for(int k=1;k<=m;++k){  
53.                     x[index][k]=p[i][j]*x[index^1][k-1]+(1-p[i][j])*x[index^1][k];  
54.                 }  
55.                 x[index][0]=x[index^1][0]*(1-p[i][j]);//表示前j道题做出0题的概率   
56.             }  
57.             dp=0;//dp表示第i队解出题目为1~n-1的概率   
58.             for(int j=1;j<=n-1;++j)dp+=x[index][j];  
59.             p2=p2*dp;//p2表示解出1~n-1题的概率   
60.         }  
61.         printf("%.3f\n",p1-p2);  
62.     }  
63.     return 0;  
64. }