Pagini recente » Cod sursa (job #1181658) | Cod sursa (job #24875) | Cod sursa (job #2514532) | Cod sursa (job #2125780) | Cod sursa (job #1692233)
#include <fstream>
#include <vector>
#include <list>
#include <iomanip>
using namespace std;
list<int> chosen;
double sum = 0;
int num = 0;
void back(int i, int n, int k, vector<double> v, double product)
{
if (chosen.size() == k)
{
sum += product;
num++;
}
else
{
for (int j = i; j < n - k + chosen.size() + 1; j++)
{
chosen.push_back(j);
product *= v[j];
back(j + 1, n, k, v, product);
chosen.pop_back();
product /= v[j];
}
}
}
int main()
{
ifstream in("dezastru.in");
ofstream out("dezastru.out");
int n, k;
double x;
vector<double> v;
in >> n >> k;
for (int i = 0; i < n; i++)
{
in >> x;
v.push_back(x);
}
back(0, n, k, v, 1.0);
out << setprecision(7) << sum / num;
return 0;
}