Pagini recente » Cod sursa (job #2085031) | Istoria paginii runda/wellcodesimulare2martieclasa11-12/clasament | Cod sursa (job #1091164) | Cod sursa (job #2561892) | Cod sursa (job #663263)
Cod sursa(job #663263)
#include<iostream>
#include<fstream>
#include<algorithm>
#include<iomanip>
using namespace std;
float s,p;
float a[30];
unsigned long long int fact,k,n,x[26];
void lucru( void)
{
int i;
p=1;
for(i=1;i<=k;i++)
p=p*(a[x[i]]);
s=s+p;
fact++;
}
void comb(int poz)
{
int i;
for (i=x[poz-1]+1;i<=n;i++)
{
x[poz]=i;
if (poz==k)
lucru();
else
comb(poz+1);
}
}
int main(void)
{
int i;
fstream f("dezastru.in",ios::in),g("dezastru.out",ios::out);
f>>n>>k;
for (i=1;i<=n;i++)
{
f>>a[i];
//x[i]=i;
}
fact=0;
/*for (i=1;i<=n;i++)
fact*=i;
*/
x[0]=0;
comb(1);
//cout<<fact;
g<<fixed<<setprecision(6)<<double(s/fact);
}