Pagini recente » Cod sursa (job #1399502) | Cod sursa (job #2810955) | Cod sursa (job #998818) | Cod sursa (job #79288) | Cod sursa (job #883663)
Cod sursa(job #883663)
#include <fstream>
using namespace std;
long int i,j,n,k,sol[30];
long long int fact;
double a[30],s1,s;
long int ok(int x)
{
int i;
for (i=1;i<=x-1;i++)
if (sol[i]==sol[x]) return 0;
return 1;
}
void back(int x)
{
int i,j;
if (x>k) {
s1=1;
for (j=1;j<=k;j++)
s1=s1*a[sol[j]];
s=s+s1;
}
else
for (i=1;i<=n;i++) {
sol[x]=i;
if (ok(x)) back(x+1);
}
}
int main()
{
ifstream f("dezastru.in");
ofstream g("dezastru.out");
f>>n>>k;
for (i=1;i<=n;i++)
f>>a[i];
fact=1;
for (i=2;i<=n;i++)
fact=fact*i;
back(1);
g<<s/fact;
f.close();
g.close();
return 0;
}