Cod sursa(job #2246459)
| Utilizator | Data | 27 septembrie 2018 09:31:36 | |
|---|---|---|---|
| Problema | Dezastru | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#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;
}
