Pagini recente » Cod sursa (job #2621876) | Cod sursa (job #2683943) | Cod sursa (job #1884782) | Cod sursa (job #1133009) | Cod sursa (job #2165089)
#include <bits/stdc++.h>
using namespace std;
int v[101],uz[101],n,k,loc;
double p,x[101],s;
void Back(int top)
{ int i;
if(top>=n+1)
{p=1;
for(i=1;i<=k;i++)p=p*x[v[i]];
s=s+p;
loc++;}
else for(i=1;i<=n;i++)
if(uz[i]==0){uz[i]=1;
v[top]=i;
Back(top+1);
uz[i]=0;}
}
int main()
{
ifstream f("dezastru.in");
ofstream g("dezastru.out");
int i;
f>>n>>k;
for (i=1;i<=n;i++) f>>x[i];
Back(1);
s=s/loc;
g<<setprecision(6)<<s;}