Pagini recente » Cod sursa (job #1601689) | Cod sursa (job #2924729) | Cod sursa (job #658010) | Cod sursa (job #2074917) | Cod sursa (job #81068)
Cod sursa(job #81068)
#include <cstdio>
int x[32];
int N, K;
double a[32];
double dp[32][32];
void read()
{
freopen("dezastru.in","r",stdin);
scanf("%d %d\n", &N, &K);
int i;
for(i=1;i<=N;++i) scanf("%lf ", a+i);
}
double comb[32][32];
void solve()
{
int i, j;
for(i=0;i<=N;++i) dp[i][0]=1;
dp[1][1]=a[1];
for(i=1;i<=N;++i)
for(j=1;j<=i;++j)
if(i==1 && j==1)continue;
else dp[i][j]=dp[i-1][j]+dp[i-1][j-1]*a[i];
/*
for(i=0;i<=N;++i)
{
for(j=0;j<=i;++j)printf("%lf ", dp[i][j]);
printf("\n");
}
*/
double sol=dp[N][K];
for(i=1;i<=N;++i) comb[0][i]=1;
for(i=1;i<=N;++i)
{
comb[i][0]=1.0;
for(j=1;j<=i;++j)
comb[i][j]=comb[i-1][j]+comb[i-1][j-1];
}
/*
for(i=0;i<=N;++i)
{
for(j=0;j<=i;++j)printf("%f ", comb[i][j]);
printf("\n");
}
*/
printf("%.7lf\n", dp[N][K]/(double)comb[N][K]);
}
int main()
{
freopen("dezastru.out","w",stdout);
read();
solve();
return 0;
}