Cod sursa(job #2462491)
| Utilizator | Data | 27 septembrie 2019 14:32:51 | |
|---|---|---|---|
| Problema | Dezastru | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("dezastru.in");
ofstream fout("dezastru.out");
int n,k,i,j;
double v[26],fact[26],dp[26][26];
int main()
{
fin>>n>>k;
for(i=1; i<=n; i++)
fin>>v[i];
fact[0]=1;
for(i=1; i<=n; i++)
fact[i]=fact[i-1]*i;
dp[0][0]=1;
for(i=1; i<=n; i++)
{
dp[i][0]=1;
for(j=1; j<=i; j++)
dp[i][j]=dp[i-1][j]+dp[i-1][j-1]*v[i];
}
fout<<dp[n][k]*fact[k]*fact[n-k]/fact[n];
return 0;
}
