Pagini recente » Cod sursa (job #1131777) | Cod sursa (job #1636653) | Cod sursa (job #1596632) | Cod sursa (job #1822638) | Cod sursa (job #164412)
Cod sursa(job #164412)
#include<cstdlib>
#include<string>
int n,k;
float a[26][26],p[26];
int i,j;
long c;
void preprocess(int n, int k){
//doing the DP
for(i=0;i<=n;i++)
a[i][0]=1;
a[1][1]=p[1];
for(i=2;i<=n;i++)
for(j=1;j<=i;j++)
a[i][j]=a[i-1][j]+a[i-1][j-1]*p[i];
//calculus of C(n,k)
c=1;
int auxb=(n-k>k)?n-k:k,auxs=(n-k>k)?k:n-k;
for(i=n,j=1;i>auxb||j<=auxs;i--,j++)
{
if(i>auxb) c*=i;
if(j<=auxs)c/=j;
}
}
int main(){
freopen("dezastru.in","r",stdin);
freopen("dezastru.out","w",stdout);
scanf("%d %d",&n,&k);
for(i=1;i<=n;i++)
scanf("%f",&p[i]);
preprocess(n,k);
printf("%.6f",a[n][k]/c);
return 0;
}