Pagini recente » Cod sursa (job #1155828) | Cod sursa (job #1928958) | Cod sursa (job #2042948) | Cod sursa (job #232816) | Cod sursa (job #317548)
Cod sursa(job #317548)
#include<stdio.h>
long comb(int n,int k)
{
long produs=1;
for(int i=1;i<=k;i++)
produs = produs * (n-i+1) / i;
return produs;
}
int main()
{int j,i,m,n;
double a[30][30],p[30],q=0,w;
freopen("dezastru.in","r",stdin);
freopen("dezastru.out","w",stdout);
scanf("%d%d",&n,&m);
for (i=1;i<=n;i++) scanf("%lf",&p[i]);
a[0][0]=1; a[1][0]=1;
for (i=1;i<=n;i++)
{a[i][0]=1;
for (j=1;j<=i;j++)
if (j<=m) a[i][j]=a[i-1][j]+a[i-1][j-1]*p[i];
else break;
}
printf("%.7lf",a[n][m]/ comb(n,m));
return 0;
}