Cod sursa(job #490271)

Utilizator claudiumihailClaudiu Mihail claudiumihail Data 5 octombrie 2010 19:40:40
Problema Dezastru Scor 20
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.33 kb
#include<fstream>
#include<iostream>
#include<iomanip>
using namespace std;

#define MAXN 26
typedef unsigned long long uint64;

//unsigned long long fact=1;
double probs[MAXN];

double total;

inline int maximum(const int a, const int b)
{
	return a>b?a:b;
}

inline int minimum(const int a, const int b)
{
	return a<b?a:b;
}


void comb(int *const v, const int n, const int k, const int cur)
{
	if(cur==k)
	{
		double prod=1;
		for(int i=1; i<=k; ++i)
		{
			//cout<<v[i]<<" ";
			prod*=probs[v[i]];
		}
		//cout<<"\n";
		total+=prod;
	}
	else
	{
		for(int i=v[cur]; i<n; ++i)
		{
			v[cur+1]=i+1;
			comb(v,n,k,cur+1);
		}
	}
}

int main()
{
	int n,k,v[MAXN];
	//double mat[MAXN][MAXN];
	fstream fin("dezastru.in", fstream::in);
	fstream fout("dezastru.out", fstream::out);
	
	fin>>n>>k;
	double Cnk=1,prod=1;
	for(int i=maximum(n-k,k)+1; i<=n; ++i)
		Cnk*=i;
	for(int i=1; i<=minimum(n-k,k); ++i)
		prod*=i;
	Cnk/=prod;
	//cout<<Cnk<<endl;
	
	
	for(int i=1; i<=n; ++i)
	{
		fin>>probs[i];
		//cout<<probs[i]<<" ";
	}
	//cout<<endl;
	
	/*for(int i=1;i<=25; ++i)
		fact*=i;
	cout<<fact<<endl;*/
	
	for(int i=1; i<=k; ++i)
	{
		v[1]=i;
		comb(v,n,k,1);
	}
	
	
	
	fout<<setiosflags(fstream::fixed)<<setprecision(6)<<total/Cnk<<endl;
	fin.close();
	fout.close();
	return 0;
}