Pagini recente » Cod sursa (job #83240) | Cod sursa (job #1945385) | Cod sursa (job #1942199) | Cod sursa (job #1119895) | Cod sursa (job #2207747)
#include <iostream>
#include <fstream>
#include <queue>
using namespace std;
#define DIM 30
ifstream fin("dezastru.in");
ofstream fout("dezastru.out");
int N, K;
int x[DIM];
double p[DIM];
bool s[DIM];
double Sol = 0.0;
double aux = 1.0;
int Nr = 1;
void Read();
double Fact(int x);
void Comb(int k);
void Write(int k);
int main()
{
Read();
for (int i = N - K + 1; i <= N; ++i)
Nr *= i;
Comb(1);
fout << Sol;
fin.close();
fout.close();
return 0;
}
void Comb(int k)
{
if (k > K)
{
Sol += aux / (double)Nr;
return;
}
for (int i = 1; i <= N; ++i)
if (!s[i])
{
s[i] = true;
aux *= p[i];
Comb(k + 1);
aux /= p[i];
s[i] = false;
}
}
void Read()
{
fin >> N >> K;
for (int i = 1; i <= N; ++i)
fin >> p[i];
}