题意:
在acm比赛中,n题,t队。给出每个队做对每题的概率,问每队至少对一题,至少有一队做对至少m题的概率。
分析:
主要考察的是对于概率的数学思维与转换。
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
using namespace std;
const int N=1e3+5,M=35;
int n,t,m;
double p1,p2,ans;
double p[N][M],f[N][M][M],sum[N];
int main(){
while (true)
{
scanf("%d%d%d",&n,&t,&m);
if (!n && !t && !m) return 0;
for (register int i=0; i<=t; ++i)
for (register int j=0; j<=n; ++j)
for (register int k=0; k<=n; ++k) f[i][j][k]=0;
for (register int i=0; i<=t; ++i) sum[i]=0;
for (register int i=1; i<=t; ++i)
for (register int j=1; j<=n; ++j) scanf("%lf",&p[i][j]);
for (register int i=1; i<=t; ++i) f[i][0][0]=1;
for (register int i=1; i<=t; ++i)
for (register int j=1; j<=n; ++j)
for (register int k=0; k<=min(j,m-1); ++k)
{
f[i][j][k]+=f[i][j-1][k]*(1-p[i][j]);
if (k) f[i][j][k]+=f[i][j-1][k-1]*p[i][j];
}
p1=1;
for (register int i=1; i<=t; ++i) p1*=1-f[i][n][0];
for (register int i=1; i<=t; ++i)
for (register int j=1; j<=m-1; ++j) sum[i]+=f[i][n][j];
p2=1;
for (register int i=1; i<=t; ++i) p2*=sum[i];
ans=p1-p2;
printf("%.3f\n",ans);
}
return 0;
}