Pagini recente » Cod sursa (job #432376) | Cod sursa (job #690637) | Cod sursa (job #1238542) | Cod sursa (job #2212851) | Cod sursa (job #1779958)
#include <bits/stdc++.h>
#define maxn 26
using namespace std;
int n,i,j,k;
double p[maxn];
double dp[maxn][maxn],comb[maxn][maxn];
int main()
{
ifstream f("dezastru.in");
ofstream g("dezastru.out");
f>>n>>k;
for(i=1;i<=n;i++)
f>>p[i];
for(i=0;i<=n;i++)
dp[i][0]=1;
for(i=1;i<=n;i++)
for(j=1;j<=i;j++)
dp[i][j]=dp[i-1][j]+dp[i-1][j-1]*p[i];
for(i=0;i<=n;i++)
comb[i][0]=1;
for(i=1;i<=n;i++)
for(j=1;j<=i;j++)
comb[i][j]=comb[i-1][j]+comb[i-1][j-1];
g<<fixed<<setprecision(6)<<dp[n][k]/comb[n][k];
return 0;
}