Pagini recente » Cod sursa (job #126376) | Cod sursa (job #3340809) | Cod sursa (job #2879717) | Cod sursa (job #1862235) | Cod sursa (job #3303300)
#include <bits/stdc++.h>
using namespace std;
const int Max = 25;
ifstream f("dezastru.in");
ofstream g("dezastru.out");
int N, M, K;
double ans;
double v[Max];
int s[Max];
int fac(int k)
{
int a = 1;
while(k!=1)
{
a *= k;
k--;
}
return a;
}
bool val(int n)
{
for(int i = 1; i < n; ++i)
if(s[i] == s[n])
return 0;
return 1;
}
void backer(int n)
{
for(int i = 1; i <= N; ++i)
{
s[n] = i;
if(val(n))
{
if(n == K)
{
double a = 1;
for(int i = 1; i <= K; ++i)
{
a *= v[s[i]];
}
cout << a << '\n';
ans += a/ fac(N);
}
else
backer(n+1);
}
}
}
int main()
{
f >> N >> K;
for(int i = 1; i <= N; ++i)
{
f >> v[i];
}
backer(1);
g << setprecision(6) << fixed << ans;
}