Pagini recente » Cod sursa (job #2025720) | Cod sursa (job #1035743) | Cod sursa (job #2591298) | Cod sursa (job #2182146) | Cod sursa (job #1831874)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("dezastru.in");
ofstream fout("dezastru.out");
unsigned long long i,n,k,st[26],f[26];
double v[26],p=1.0f,rez;
void back(int niv)
{
int i;
for(i=st[niv-1]+1;i<=n;i++)
{
st[niv]=i;
p*=v[i];
if(niv==k)
rez+=p;
else back(niv+1);
p/=v[i];
}
}
int main()
{
fin>>n>>k;
f[1]=1;
for(i=2;i<=n;i++)
f[i]=f[i-1]*i;
for(i=1;i<=n;i++)
fin>>v[i];
back(1);
fout<<rez/(f[n]/f[k]/f[n-k]);
return 0;
}