Pagini recente » Cod sursa (job #836106) | Cod sursa (job #1575100) | Cod sursa (job #118820) | Cod sursa (job #275859) | Cod sursa (job #2493399)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi ("dezastru.in");
ofstream fo ("dezastru.out");
int n,k,st[30],nrp;
double v[30],sum;
int valid(int niv)
{ int i;
for(i=1;i<niv;i++)
if(st[i]==st[niv])
return 0;
return 1;
}
void sol()
{double x=1;
for(int i=1;i<=k;i++)
x*=v[st[i]];
sum+=x;
}
void bkt(int niv)
{ int i;
for(i=1;i<=n;i++)
{
st[niv]=i;
if(valid(niv)==1)
{
if(niv==k)
{
sol();
//nrp++;
}
else bkt(niv+1);
}
}
}
void factorial(int n, int &f)
{ f=1;
if(n>1)
{ factorial(n-1,f);
f=f*n;
}
}
int main()
{
fi>>n>>k;
for(int i=1;i<=n;i++)
fi>>v[i];
bkt(1);
factorial(n,nrp);
///factorial(n-k,y);
fo<<double(sum/nrp);
fi.close();
fo.close();
return 0;
}