Pagini recente » Cod sursa (job #2916195) | Cod sursa (job #547511) | Cod sursa (job #2085291) | Cod sursa (job #3240405) | Cod sursa (job #2504790)
#include <iostream>
#include <fstream>
#include <iomanip>
using namespace std;
const int maxN=26;
int n,k;
double v[maxN];
double dp[maxN][maxN];
double comb[maxN][maxN];
int main(){
ifstream f("dezastru.in");
ofstream g("dezastru.out");
f>>n>>k;
for(int i=1;i<=n;i++){
f>>v[i];
}
for(int i=0;i<=n;i++){
dp[i][0]=1;
comb[i][0]=1;
}
for(int i=1;i<=n;i++){
for(int j=1;j<=i;j++){
comb[i][j]=comb[i-1][j]+comb[i-1][j-1];
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=k;j++){
dp[i][j]=dp[i-1][j-1]*v[i]+dp[i-1][j];
}
}
g<<fixed<<setprecision(6)<<dp[n][k]/comb[n][k];
return 0;
}