Pagini recente » Cod sursa (job #1529619) | Solutii preONI 2007, Runda 3 | Cod sursa (job #71257) | Cod sursa (job #2216158) | Cod sursa (job #2022876)
#include <iostream>
#include <fstream>
#include <iomanip>
#include <cstdio>
#define NMax 26
using namespace std;
ifstream f("dezastru.in");
ofstream g("dezastru.out");
int n, p, foo;
float atac[NMax], st[NMax];
float prob[NMax], sol;
bool fol[NMax];
void calc()
{
float ans = 1.000000;
for(int i = 1; i <= p; ++i)
ans *= st[i];
prob[++foo] = ans;
}
void back(int k)
{
for(int i = st[k - 1] + 1; i <= n; ++i)
{
if(!fol[i])
{
fol[i] = true;
st[k] = atac[i];
if(k == p) calc();
else back(k + 1);
fol[i] = false;
}
}
}
int main()
{
f >> n >> p;
for(int i = 1; i <= n; ++i)
f >> atac[i];
back(1);
for(int i = 1; i <= foo; ++i)
sol += prob[i];
g << setprecision(6) << sol/foo <<'\n' << fixed;
return 0;
}