Pagini recente » Cod sursa (job #1907850) | Cod sursa (job #2700164) | Cod sursa (job #2553835) | Cod sursa (job #579207) | Cod sursa (job #1450997)
/*
If you can't explain it simply, you don't understand it well enough.
*/
#include <cstdio>
using namespace std;
const int Nmax = 30;
int n, k , i , x;
double sum;
double p[Nmax];
void generare(int niv , int ind , double probability)
{
if (niv == k + 1)
{
sum += probability;
return;
}
for (int i = ind + 1; i <= n - k + niv + 1; ++i)
generare(niv + 1 , i , probability * p[i]);
}
int main()
{
freopen("dezastru.in","r",stdin);
freopen("dezastru.out","w",stdout);
scanf("%d %d", &n, &k);
for (i = 1; i <= n; ++i)
scanf("%lf", &p[i]);
generare(1 , 0 , 1);
for (i = k + 1; i <= n; ++i)
sum /= (1.0 * i);
printf("%.6lf", sum);
return 0;
}