Solved problem 443D from codeforces

Author: AliOsm

CodeForces/443D. Andrey and Problem.cpp

@@ -0,0 +1,34 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int const N = 101;
+int n;
+double a[N];
+
+int main() {
+  double mx = 0;
+  cin >> n;
+  for(int i = 0; i < n; ++i)
+    cin >> a[i];
+
+  sort(a, a + n);
+  reverse(a, a + n);
+
+  double res = 0;
+  for(int k = 0; k < n; ++k) {
+    double sol = 0;
+    for(int i = 0; i <= k; ++i) {
+      double cur = a[i];
+      for(int j = 0; j <= k; ++j)
+        if(i != j)
+          cur *= (1.0 - a[j]);
+      sol += cur;
+    }
+    res = max(res, sol);
+  }
+
+  cout << fixed << setprecision(10) << res << endl;
+
+  return 0;
+}

CodeForces/README.md

@@ -170,6 +170,7 @@
 - [441A. Valera and Antique Items](http://codeforces.com/problemset/problem/441/A)
 - [441C. Valera and Tubes](http://codeforces.com/contest/441/problem/C)
 - [443A. Anton and Letters](http://codeforces.com/problemset/problem/443/A)
+- [443D. Andrey and Problem](http://codeforces.com/contest/443/problem/D)
 - [448A. Rewards](http://codeforces.com/problemset/problem/448/A)
 - [448D. Multiplication Table](http://codeforces.com/contest/448/problem/D)
 - [449B. Jzzhu and Cities](http://codeforces.com/contest/449/problem/B)