Pagini recente » Cod sursa (job #515173) | Cod sursa (job #2360275) | Borderou de evaluare (job #1474953) | Cod sursa (job #2502288) | Cod sursa (job #1988207)
#include<cstdio>
#include<algorithm>
using namespace std;
const int NMAX=30;
double v[NMAX],s;
int n,k,vv[NMAX];
long long comb;
inline void combinari(int ind, int nr, double prod){
if(ind>k){
s+=prod;
comb++;
return ;
}
for(int i=nr+1;i<=n;i++){
vv[ind]=i;
combinari(ind+1, i, prod*v[vv[ind]]);
}
}
int main(){
freopen("dezastru.in","r",stdin);
freopen("dezastru.out","w",stdout);
scanf("%d%d", &n, &k);
for(int i=1;i<=n;i++)
scanf("%lf", &v[i]);
combinari(1, 0, 1.0);
printf("%.6f", double(s/comb));
return 0;
}