Pagini recente » Istoria paginii runda/simulareoji2015cl10 | Istoria paginii runda/david_oji/clasament | Istoria paginii runda/ala1235/clasament | Istoria paginii runda/winners3/clasament | Cod sursa (job #491640)
Cod sursa(job #491640)
#include <stdio.h>
int n,k,a[26],c;
double p[26],pos=1,s;
inline void back(int x)
{
if (x==k+1)
{
s+=pos;
++c;
return;
}
int i;
for (i=a[x-1]+1;i<=n-k+x;++i)
{
pos*=p[i];a[x]=i;
back(x+1);
pos/=p[i];
}
}
int main()
{
int i;
freopen("dezastru.in","r",stdin);
freopen("dezastru.out","w",stdout);
scanf("%d%d",&n,&k);
for (i=1;i<=n;++i) scanf("%lf",&p[i]);
back(1);
s/=c;
printf("%.6lf",s);
return 0;
}