Pagini recente » Istoria paginii utilizator/karpatokorzoje | Cod sursa (job #1259997) | Cod sursa (job #1602549) | Cod sursa (job #231840) | Cod sursa (job #831731)
Cod sursa(job #831731)
#include <cstdio>
#include <cstring>
int n, k;
double res = 0.0;
double sol[25];
double v[25];
bool viz[25];
void generate(int len, int last)
{
if (len == k) {
double perm = 1.0;
for (int i = 0; i < k; ++i)
perm *= sol[i];
res += perm;
} else {
for (int i = last; i < n; ++i) {
if (viz[i])
continue;
viz[i] = true;
sol[len] = v[i];
generate(len + 1, i);
viz[i] = false;
}
}
}
int main()
{
freopen("dezastru.in", "r", stdin);
freopen("dezastru.out", "w", stdout);
scanf("%d %d", &n, &k);
for (int i = 0; i < n; ++i)
scanf("%lf", &v[i]);
double a[26][26];
memset(a, 0, sizeof(a));
a[1][1] = 1;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= k; ++j) {
if (i == 1 && j == 1)
continue;
a[i][j] = a[i - 1][j] + a[i - 1][j - 1] * v[i];
}
int comb[26][26];
comb[0][0] = 1;
for (int i = 1; i <= n; ++i) {
comb[i][0] = 1;
for (int j = 1; j <= k; ++j)
comb[i][j] = comb[i - 1][j] + comb[i - 1][j - 1];
}
printf("%lf\n", a[n][k] / comb[n][k]);
return 0;
}