Pagini recente » Cod sursa (job #3261138) | Cod sursa (job #1679441) | Cod sursa (job #2373009) | Cod sursa (job #1405937) | Cod sursa (job #1223030)
/*
dezastru infoarena
*/
#include<vector>
#include<string>
#include<string.h>
#include<algorithm>
#include<cstdio>
#include<fstream>
#include<iostream>
#include<ctime>
#include<set>
#include<map>
#include<cmath>
using namespace std;
#define LL long long
#define PII pair<int ,int>
#define PCI pair<char ,int>
#define VB vector <bool>
#define VI vector <int>
#define VC vector <char>
#define WI vector<VI>
#define WC vector<VC>
#define RS resize
#define X first
#define Y second
#define FORN(i,n) for(int i=0;i<n;++i)
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define FORD(i,a,b) for(int i=a;i>=b;--i)
#define REPEAT do
#define UNTIL(x) while((x))
#define IN_FILE "dezastru.in"
#define OUT_FILE "dezastru.out"
ifstream f(IN_FILE);
ofstream g(OUT_FILE);
//variables
int n, k,coun;
vector<float> x;
float sum;
//other functions
void generare(set<int> elem, int lenght, float suma)
{
if (lenght == 0)
{
sum += suma;
++coun;
return;
}
FORN(i, n)
{
if (elem.count(i) < 1)
{
set<int> elem2 = elem;
elem2.insert(i);
generare(elem2, lenght - 1, suma * x[i]);
}
}
}
void reading()
{
f >> n >> k;
x.RS(n);
FORN(i, n)
{
f >> x[i];
}
f.close();
}
void solving()
{
set<int> aux;
generare(aux,k,1);
g << sum/coun;
}
void write_data()
{
}
int main()
{
reading();
solving();
write_data();
}