Pagini recente » Cod sursa (job #2605633) | Cod sursa (job #570113) | Cod sursa (job #538604) | Cod sursa (job #1165099) | Cod sursa (job #2922516)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("dezastru.in");
ofstream fout ("dezastru.out");
const int NM = 27;
int n, m, x[NM];
double ans, cnt, p, a[NM], q = 1;
void solve (){
long double r = 1;
for (int i = 1; i <= m; i++){
r *= a[x[i]];
}
ans += r;
}
void back (int k){
for (int i = x[k - 1] + 1; i <= n; i++){
if (k <= m){
x[k] = i;
if (k == m){
solve();
cnt += 1;
}
else{
back(k + 1);
}
}
}
}
int main(){
ios_base::sync_with_stdio(false);
fin.tie(0);
fout.tie(0);
fin >> n >> m;
for (int i = 1; i <= n; i++){
fin >> a[i];
}
back(1);
fout << fixed << setprecision(10) << ans / cnt << '\n';
}