Pagini recente » Cod sursa (job #2512391) | Cod sursa (job #319018) | Cod sursa (job #2330214) | Cod sursa (job #811077) | Cod sursa (job #1744498)
#include <iostream>
#include <fstream>
#include <iomanip>
using namespace std;
ifstream fin("dezastru.in");
ofstream fout("dezastru.out");
//fac combinari
int t,n,v[26];
long long ns=0;
long double sum=0,a[26];
long long pfact=1;
int solutie(int k)
{
if(k==t)
return 1;
return 0;
}
void Bk(int b,int k,float p)
{
for(int i=b+1;i<=n-t+k;i++)
{
if(solutie(k))
{
sum=sum+pfact*p*a[i];
ns++;
}
else
Bk(i,k+1,p*a[i]);
}
}
int main()
{
fin>>n>>t;
for(int i=1;i<=n;i++)
fin>>a[i];
for(int i=1;i<=t;i++)
pfact*=i;
Bk(0,1,1);
pfact=pfact*ns;
fout<<(float)sum/pfact;
return 0;
}