Pagini recente » Cod sursa (job #1212069) | Cod sursa (job #1386921) | Cod sursa (job #1888089) | Cod sursa (job #1668759) | Cod sursa (job #2171828)
#include <stdio.h>
#define SIZE 25
static int n, k, c[SIZE+1];
static double p[SIZE], sum;
static void comb(int l)
{
int i;
double prod;
if (l == k) {
prod = 1.0;
for (i = 1; i <= l; i++) {
/*fprintf(stderr, "%d%c", c[i], " \n"[i == l]);*/
prod *= p[c[i] - 1];
}
for (i = 2; i <= n - k + 1; i++) {
prod *= i;
}
sum += prod;
} else {
for (i = c[l] + 1; i <= n; i++) {
c[l+1] = i;
comb(l + 1);
}
}
}
int main(void)
{
int i;
freopen("dezastru.in", "r", stdin);
freopen("dezastru.out", "w", stdout);
scanf("%d %d", &n, &k);
for (i = 0; i < n; i++) {
scanf("%lf", &p[i]);
}
comb(0);
for (i = 2; i <= n; i++) {
sum /= i;
}
printf("%lf", sum);
return 0;
}