Pagini recente » Cod sursa (job #1021784) | Cod sursa (job #2241854) | Cod sursa (job #368046) | Atasamentele paginii Clasament oni_11_12_7 | Cod sursa (job #2038571)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("dezastru.in");
ofstream fout ("dezastru.out");
int main () {
long long p, P;
double dz, s, v[30], mat[30][30], sum;
int tot, n, k, i, j;
fin >> n >> k;
for (i = 1; i <= n; i++)
fin >> v[i];
mat[0][0] = 1;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
{
if (i == j) mat[i][j] = mat[i-1][j-1] * v[i];
else if (j == 1) mat[i][j] = mat[i-1][j] + v[i];
else mat[i][j] = mat[i-1][j] + v[i] * mat[i-1][j-1];
}
p = 1;
for (i = k+1; i <= n; i++)
p *= i;
P = 1;
for (i = 1; i <= n-k; i++)
P *= i;
p /= P;
fout << mat[n][k] / p << endl;
return 0;
}