Pagini recente » Cod sursa (job #1045051) | Istoria paginii runda/1235123/clasament | Cod sursa (job #1428238) | Cod sursa (job #1626688) | Cod sursa (job #2666051)
#include <fstream>
using namespace std;
ifstream f("dezastru.in");
ofstream g("dezastru.out");
int n, x[30], p, ct;
double sol[30], s, prob[30];
void backt(int k)
{
for(int i = x[k - 1] + 1; i <= n; i++)
{
x[k] = i, prob[k] = prob[k - 1] * sol[i];
if(k >= p) s += prob[k], ct++;
else backt(k + 1);
}
}
int main()
{
f >> n >> p;
for(int i = 1; i <= n; i++)
f >> sol[i];
prob[0] = 1;
backt(1);
g << s / ct;
return 0;
}