<span style="color:#cc0000;">题意:有t支队伍,m道题,冠军最少做n道题,问保证每队最少做一题,冠军最少做n题的概率</span>
<span style="color:#006600;">思路:高中知识还真是没剩下多少了,下面转载别人博客中的解释,很详细,基本上看着这个思路,将之代码化就能过,注意精度。</span>
<img alt="" src="http://hi.csdn.net/attachment/201107/31/0_1312102419gqF8.gif" />
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
double dp[1005][35][35],p[1005][35],s[1005][35];
int main()
{
int n, m, t;
int i, j, k;
double p1, p2;
while(~scanf("%d%d%d",&m,&t,&n)&&(n+m+t))
{
memset(dp,0,sizeof(dp));
memset(s,0,sizeof(s));
for(i = 1; i <= t; i++)
for(j = 1; j <= m; j++)
scanf("%lf",&p[i][j]);
for(i = 1; i <= t; i++)
{
dp[i][0][0] = 1.0;
for(j = 1; j <= m; j++)
dp[i][j][0] = dp[i][j-1][0]*(1-p[i][j]);
for(j = 1; j <= m; j++)
for(k = 1; k <= j; k++)
dp[i][j][k] = dp[i][j-1][k-1]*p[i][j]+dp[i][j-1][k]*(1-p[i][j]);
s[i][0] = dp[i][m][0];
for(k = 1; k <= m; k++)
s[i][k] = s[i][k-1] + dp[i][m][k];
}
p1 = p2 = 1.0;
for(i = 1; i <= t; i++)
{
p1*=(s[i][m] - s[i][0]);
p2*=(s[i][n-1] - s[i][0]);
}
printf("%.3f\n",p1-p2);
}
return 0;
}
s[i][k],代表第i个队, 至多做对 k道题的概率