Pagini recente » Cod sursa (job #2231491) | Cod sursa (job #2835302) | Cod sursa (job #1513487) | Cod sursa (job #969045) | Cod sursa (job #802091)
Cod sursa(job #802091)
#include<fstream>
using namespace std;
ifstream f("dezastru.in");
ofstream g("dezastru.out");
double a[26],A[26][26];
int n,k,i,j;
long double solve(int x)
{
int q;
long double produs=1;
for(q=1;q<=x;q++)
{
produs=produs*q;
}
return produs;
}
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
{
A[i][0]=1;
f>>a[i];
}
A[0][0]=1;
for(i=1;i<=n;i++)
{
for(j=1;j<=k;j++)
{
A[i][j]=A[i-1][j]+A[i-1][j-1]*a[i];
}
}
g.precision(7);
long double combinari=(long double)solve(n)/(solve(n-k)*solve(k));
g<<A[n][k]/combinari;
}