Pagini recente » Cod sursa (job #2425618) | Cod sursa (job #2314425) | Cod sursa (job #1437650) | Cod sursa (job #2624528) | Cod sursa (job #1815405)
# include <iostream>
# include <fstream>
using namespace std;
# define MAX_N 25
long long c[1 + MAX_N][1 + MAX_N];
long double d[1 + MAX_N][1 + MAX_N];
double p[1 + MAX_N];
int main()
{
ifstream fin( "dezastru.in" );
ofstream fout( "dezastru.out" );
int n, k, i, j;
fin >> n >> k;
for ( i = 1; i <= n; i ++ )
fin >> p[i];
for ( i = 0; i <= n; i ++ )
c[i][0] = d[i][0] = 1;
for ( i = 1; i <= n; i ++ )
for ( j = 1; j <= k; j ++ ) {
d[i][j] = d[i - 1][j - 1] * p[i] + d[i - 1][j];
c[i][j] = c[i - 1][j] + c[i - 1][j - 1];
}
fout << d[n][k] / c[n][k];
fin.close();
fout.close();
return 0;
}