Pagini recente » Cod sursa (job #2137907) | Cod sursa (job #1739390) | Cod sursa (job #1783809) | Cod sursa (job #908201) | Cod sursa (job #1325400)
#include <iostream>
#include <fstream>
using namespace std;
short int permutari[26];
int n,k,total;
float d,dez[26];
void rez(int ajuns,int numar);
void continua(int ajuns,int numar)
{
register int i;
static short int verific[26];
bool inceput=0;
if (inceput=0)
{
inceput=1;
for (i=1;i<=25;i++)
{
verific[i]=0;
}
}
verific[permutari[numar-1]]=1;
for (i=ajuns+1;i<=n;i++)
{
if (verific[i]==0)
{
permutari[numar]=i;
rez(i,numar+1);
}
}
verific[permutari[numar-1]]=0;
}
void verificanumar()
{
int i;
float ac=1;
total++;
for (i=1;i<=k;i++)
{
ac*=dez[permutari[i]];
}
d+=ac;
}
void rez(int ajuns,int numar)
{
if (ajuns<n&&numar<=k&&n-ajuns>=k-numar)
{
continua(ajuns,numar);
}
else if (numar==k+1)
{
verificanumar();
}
}
int main()
{
ifstream in("dezastru.in");
ofstream out("dezastru.out");
int i,j;
in>>n;
in>>k;
for (i=1;i<=n;i++)
{
in>>dez[i];
}
rez(0,1);
d/=total;
out<<d;
out.flush();
out.close();
return 0;
}