Pagini recente » Cod sursa (job #3149120) | Istoria paginii runda/oni2014_ziua1/clasament | Cod sursa (job #3212438) | Cod sursa (job #2585569) | Cod sursa (job #902037)
Cod sursa(job #902037)
#include<fstream>
using namespace std;
long double rezolvare(int x);
int main(int argc, char *argv[])
{
double sol[26], Sol[26][26];
int n, k;
ifstream _in("dezastru.in");
ofstream _out("dezastru.out");
_in >> n >> k;
for (int i = 1; i <= n; i++){
Sol[i][0]=1;
_in >> sol[i];
}
Sol[0][0] = 1;
for (int i = 1; i <= n; i++){
for (int j = 1; j <= k; j++){
Sol[i][j] = Sol[i-1][j] + Sol[i-1][j-1] * sol[i];
}
}
_out.precision(7);
long double combinari = (long double)rezolvare(n) / (rezolvare(n-k) * rezolvare(k));
_out << Sol[n][k] / combinari;
}
long double rezolvare(int x){
long double produs = 1;
for (int q = 1; q <= x; q++){
produs = produs * q;
}
return produs;
}