Pagini recente » Cod sursa (job #2401034) | Cod sursa (job #102767) | Cod sursa (job #4185) | Cod sursa (job #2971244) | Cod sursa (job #2765779)
#include <fstream>
#include <iomanip>
using namespace std;
int n, k;
double a[26];
void read() {
int i;
ifstream f("dezastru.in");
f >> n >> k;
for (i = 1; i <= n; i++)
f >> a[i];
f.close();
}
double rez, C, prod = 1;
short comb[26];
void back(int niv) {
for (int i = comb[niv - 1] + 1; i <= n - k + niv; i++) {
comb[niv] = i;
prod *= a[i];
if (niv < k)
back(niv + 1);
else rez += prod * C;
prod /= a[i];
}
}
void solve() {
int i;
C = 1;
for (i = 1; i <= k; i++)
C *= i;
for (i = n - k + 1; i <= n; i++)
C = C * 1.0 / i;
back(1);
}
void output() {
ofstream g("dezastru.out");
g << setprecision(7) << fixed << rez;
g.close();
}
int main() {
read();
solve();
output();
return 0;
}