Pagini recente » Cod sursa (job #1324033) | Cod sursa (job #636987) | Cod sursa (job #2389665) | Cod sursa (job #1907314) | Cod sursa (job #1403672)
#include <fstream>
#include <cstring>
#include <iomanip>
using namespace std;
ifstream in("dezastru.in");
ofstream out("dezastru.out");
const int NMAX = 25;
long long Ans = 0, fact[NMAX+2];
double Sum = 0;
double v[NMAX+2], p[NMAX+2];
int N,K;
double Prod = 1;
void init() {
fact[0] = fact[1] = 1;
for( int i = 2; i <= N; ++i ) fact[i] = fact[i-1]*i;
}
void BKT( int pas ) {
if( pas == K+1 ) {
++Ans;
Sum += Prod;
}
else {
double Cprod = Prod;
for( int i = p[pas-1] + 1; i <= N - ( K-pas ); ++i ) {
Prod *= v[i];
p[ pas ] = i;
BKT( pas + 1 );
Prod = Cprod;
}
}
}
int main() {
in >> N >> K;
init();
for( int i = 1; i <= N; ++i ) in >> v[i];
BKT(1);
out << setprecision(6) << fixed << Sum/Ans << '\n';
return 0;
}