Pagini recente » Cod sursa (job #2606171) | Cod sursa (job #2533522) | Cod sursa (job #1066159) | Cod sursa (job #719188) | Cod sursa (job #2504713)
#include <iostream>
#include <fstream>
#include <iomanip>
#define nmax 26
using namespace std;
ifstream fin("dezastru.in");
ofstream fout("dezastru.out");
int n,k;
double vec[nmax];
double dp[nmax][nmax];
double long factorial(int val)
{
double long pr=1;
for(int i=1; i<=val; ++i)
pr*=i;
return pr;
}
int main()
{
fin>>n>>k;
for(int i=1; i<=n; i++)
fin>>vec[i];
for(int i=0; i<=n; i++)
dp[i][0]=1.0;
for(int i=1; i<=n; i++)
for(int j=1; j<=k; j++)
dp[i][j]=dp[i-1][j]+dp[i-1][j-1]*vec[i];
fout<<setprecision(10)<<dp[n][k]/(factorial(n)/(factorial(k)*factorial(n-k)));
return 0;
}