diff --git "a/GoogleCodeJam/2016/Round 2/Red Tape Committee\r\n/solutions/solution_1.cpp" "b/GoogleCodeJam/2016/Round 2/Red Tape Committee\r\n/solutions/solution_1.cpp"
new file mode 100644
index 0000000..722d3c3
--- /dev/null
+++ "b/GoogleCodeJam/2016/Round 2/Red Tape Committee\r\n/solutions/solution_1.cpp"	
@@ -0,0 +1,74 @@
+#include <iostream>
+#include <algorithm>
+#include <cstdio>
+#include <cstring>
+
+using namespace std;
+
+int k, n;
+double p[200];
+double p2[200];
+double d[201][101];
+
+double dp()
+{
+    memset(d, 0, sizeof(d));
+    for (int i = 0; i <= k; i ++)
+    {
+        for (int j = 0; j <= k / 2; j ++)
+        {
+            if (i == 0)
+            {
+                d[i][j] = (j == 0);
+            }
+            else
+            {
+                d[i][j] = p2[i - 1] * d[i - 1][j - 1] +
+                     (1 - p2[i - 1])* d[i - 1][j];
+            }
+        }
+    }
+    return d[k][k / 2];
+}
+
+int main()
+{
+    int t, ct;
+
+    cin >> ct;
+    for (t = 1; t <= ct; t++)
+    {
+        cin >> n >> k;
+        for (int i = 0; i < n; i ++)
+        {
+            cin >> p[i];
+        }
+
+        sort(p, p + n);
+
+        double ans = 0;
+        for (int i = 0; i <= k; i ++)
+        {
+            for (int j = 0; j < k; j ++)
+            {
+                if (j < i)
+                {
+                    p2[j] = p[j];
+                }
+                else
+                {
+                    p2[j] = p[j + n - k];
+                }
+            }
+            double cur = dp();
+            if (cur > ans)
+            {
+                ans = cur;
+            }
+        }
+
+        printf("Case #%d: %.8lf\n", t, ans);
+    }
+
+    return 0;
+}