Pagini recente » Cod sursa (job #2137368) | Cod sursa (job #367419) | Cod sursa (job #486109) | Cod sursa (job #542741) | Cod sursa (job #1880080)
#include <bits/stdc++.h>
#define N 26
using namespace std;
double t[N], a[N][N];
int comb[N][N];
int main()
{
freopen("dezastru.in", "r", stdin);
freopen("dezastru.out", "w", stdout);
int i, n, k, j;
scanf("%d%d", &n, &k);
for(i=1;i<=n;i++) {
scanf("%lf", &t[i]);
}
a[1][1]=t[1];
a[1][0]=comb[1][0]=1;
comb[1][1]=1;
for(i=2;i<=n;i++){
comb[i][0] = a[i][0]=1;
for(j=1;j<=k;j++){
a[i][j]=a[i-1][j]+t[i]*a[i-1][j-1];
comb[i][j]=comb[i-1][j] + comb[i-1][j-1];
}
}
printf("%lf ", a[n][k]/comb[n][k]);
return 0;
}