Pagini recente » Cod sursa (job #2058327) | Cod sursa (job #738689) | Cod sursa (job #2653863) | Cod sursa (job #1723763) | Cod sursa (job #1457698)
#include <cstdio>
#include <iostream>
#include <vector>
#include <set>
#include <cmath>
#include <climits>
#include <list>
#include <iomanip>
using namespace std;
int main() {
freopen("dezastru.in", "r", stdin);
// freopen("dezastru.out", "w", stdout);
ios_base::sync_with_stdio(false);
cin.tie(0);
long double p[30], dp[30][30];
int n, k;
cin >> n >> k;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= k; j++) {
dp[i][j] = 0;
}
}
for (int i = 1; i <= n; i++) {
cin >> p[i];
dp[i][1] = dp[i - 1][1] + p[i];
}
for (int i = 2; i <= n; i++) {
for (int j = 2; j <= k; j++) {
dp[i][j] = dp[i - 1][j] + dp[i - 1][j - 1] * p[i];
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k; j++) {
cout << dp[i][j] << " ";
}
cout << "\n";
}
long double c = 1.0;
if (2 * k >= n) {
for (int i = k + 1; i <= n; i++) {
c *= i;
}
for (int i = 1; i <= n - k; i++) {
c /= i;
}
} else {
for (int i = n - k + 1; i <= n; i++) {
c *= i;
}
for (int i = 1; i <= k; i++) {
c /= i;
}
}
cout << fixed << setprecision(6) << dp[n][k] / c;
return 0;
}