Pagini recente » Cod sursa (job #1357113) | Cod sursa (job #3228842) | Cod sursa (job #348480) | Cod sursa (job #1315016) | Cod sursa (job #2246459)
#include <algorithm>
#include <fstream>
int main() {
std::ifstream fin("dezastru.in");
std::ofstream fout("dezastru.out");
int n, k;
fin >> n >> k;
double p[2 + n];
for (int i = 1; i <= n; i++)
fin >> p[i];
double sum = 0;
for (int q = 1; q <= n; q++) {
double prod = 1;
for (int i = 1; i <= k; i++)
prod *= i * p[i];
double w = p[1];
for (int i = 1; i < n; i++)
p[i] = p[i + 1];
p[n] = w;
sum += prod;
}
for (int i = 1; i <= n; i++)
sum /= i;
fout << sum;
return 0;
}