Pagini recente » Cod sursa (job #2066938) | Cod sursa (job #1774456) | Cod sursa (job #1690765) | Cod sursa (job #1770372) | Cod sursa (job #326966)
Cod sursa(job #326966)
#include <stdio.h>
#define N 30
long long fact[N],t;
int sol[N],n,r;
double rez,v[N];
void precalcul()
{
fact[0]=1;
int i;
for (i=1; i<=15; i++)
fact[i]=(long long)fact[i-1]*i;
}
void citire()
{
scanf("%d%d",&n,&r);
int i;
for (i=1; i<=n; i++)
scanf("%lf",&v[i]);
t=(long long)fact[r]*fact[n-r];
}
void back(int k)
{
double rez_part;
if (k==r+1)
{
rez_part=1;
for (int i=1; i<=k-1; i++)
rez_part*=v[sol[i]];
rez_part*=t;
rez+=rez_part;
return;
}
for (int i=sol[k-1]+1; i<=n; i++)
{
sol[k]=i;
back(k+1);
}
}
int main()
{
freopen("dezastru.in","r",stdin);
freopen("dezastru.out","w",stdout);
precalcul();
citire();
back(1);
rez/=fact[n];
printf("%.6lf",rez);
return 0;
}