Check the difficulty of problems

/*Check the difficulty of problems
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*/
//题意：算出每个队至少解决一道题，同时冠军队至少解决N道题的概率
分析：
对于需要求得概率比较容易想到：
假设p1为每个队至少解出一题的概率，这个容易算出。
假设p2为每个队至少解出一题但是不超过n-1题的概率
所以最终答案为：p1-p2
现在问题是如何求出p2?
假设dp[i][j]表示第i个队解出的题目<=j的概率
则dp[i][j]=解出1题+解出2题+…解出j题的概率
现在问题转化为如何求解出1，2，3…k题的概率
假设x[i][j][k]表示第i个队在前j题解出k题的概率
则:
x[i][j][k]=x[i][j-1][k-1]p[i][j]+x[i][j-1][k](1-p[i][j]);
所以x[i][M][k]表示的就是第i个队解出k题的概率

#include<stdio.h>
#include<iostream>
#include<stdlib.h>
#include<string.h>
#include<queue>
#include<algorithm>
#include<map>
#include<math.h>
#include<iomanip>
#define INF 99999999;
typedef long long LL;
using namespace std;
const int MAX=1000+10;
const int N=30+10;
int m,t,n,index;
double x[2][N],dp,p[MAX][N];
int main()
{
    while(~scanf("%d%d%d",&m,&t,&n)&&m+t+n)
    {
        double p1=1,p2=1,temp=1;
        for(int i=1;i<=t;++i)
        {
            temp=1;
            for(int j=1;j<=m;j++)
            {
                scanf("%lf",&p[i][j]);
                temp=temp*(1-p[i][j]);//temp表示一道题也不能解决 
            } 
            p1=p1*(1-temp);//p1表示至少解决一道题 
        }
        for(int i=1;i<=t;i++)
        {
            index=0;
            memset(x,0,sizeof(x));
            x[0][0]=1;
            for(int j=1;j<=m;j++)
            {
                index=index^1;
                for(int k=1;k<=m;k++)
                {
                    x[index][k]=p[i][j]*x[index^1][k-1]+(1-p[i][j])*x[index^1][k];
                }
                x[index][0]=x[index^1][0]*(1-p[i][j]);//表示前j道题做出0题的概率 
            }
            dp=0;//dp表示第i队解出题目为1~n-1的概率 
            for(int j=1;j<=n-1;++j)
                dp+=x[index][j];//第i个队解出j个题目的概率 
            p2=p2*dp;
        }
        printf("%.3f\n",p1-p2);
    }
    return 0;
}