Pagini recente » Cod sursa (job #591399) | Cod sursa (job #2331905) | Cod sursa (job #997160) | Borderou de evaluare (job #3215061) | Cod sursa (job #807522)
Cod sursa(job #807522)
#include <cstdio>
#include <cstdlib>
using namespace std;
#define NMAX 32
int v[NMAX];
float P[NMAX];
int N, K;
double s = 0;
int n = 0;
inline void back(int k, float p, int last)
{
if(k > K)
{
s += p;
++n;
return;
}
for(int i = last + 1; i <= N - (K - k); ++i)
{
back(k + 1, p * P[i], i);
}
}
int main(){
freopen( "dezastru.in", "rt", stdin );
freopen("dezastru.out", "wt", stdout );
scanf("%d %d", &N, &K);
for(int i = 1; i <= N; ++i)
scanf("%f", &P[i]);
back(1, 1, 0);
printf("%.6f", s/n);
return 0;
}