Pagini recente » Cod sursa (job #2206452) | Cod sursa (job #2291205) | Cod sursa (job #2138322) | Clasament hatz | Cod sursa (job #2253227)
#include <bits/stdc++.h>
using namespace std;
ifstream f("dezastru.in");
ofstream g("dezastru.out");
double D[26][26];
uint64_t C[26][26];
int main()
{
int N,K;
f>>N>>K;
vector<double> P(N+1);
for(int i=1;i<=N;f>>P[i++]);
for(int i=0;i<=N;i++) C[i][0]=1;
for(int i=0;i<=N;i++)
for(int j=1;j<=i;j++)
C[i][j]=C[i-1][j-1]+C[i-1][j];
for(int i=0;i<=N;i++) D[i][0]=1;
for(int i=1;i<=N;i++)
for(int j=1;j<=K;j++)
D[i][j]=D[i-1][j]+D[i-1][j-1]*P[i];
g<<1.*D[N][K]/C[N][K];
return 0;
}