commit 276cf9136cd972b08a7937b34a9fc7abf44bce51
parent a17b33e4f7efc2dbba5e0d83a392c1130b146752
Author: Ryan Wolf <rwolf@borderstylo.com>
Date: Sun, 17 Oct 2010 15:07:28 -0700
added problem and data for level 3 of greplin
Diffstat:
2 files changed, 25 insertions(+), 0 deletions(-)
diff --git a/greplin/README.md b/greplin/README.md
@@ -38,3 +38,26 @@ Step 2. The password for level 3 is the sum of prime divisors of X + 1.
For the second portion of this task, note that for the number 12 we consider the
sum of the prime divisors to be 2 + 3 = 5. We do not include 2 twice even
though it divides 12 twice.
+
+Level 3
+
+----------------------------------------
+
+Congratulations. You have reached the final level.
+
+For the final task, you must find all subsets of an array
+where the largest number is the sum of the remaining numbers.
+For example, for an input of:
+
+(1, 2, 3, 4, 6)
+
+the subsets would be
+
+1 + 2 = 3
+1 + 3 = 4
+2 + 4 = 6
+1 + 2 + 3 = 6
+
+Here is the list of numbers you should run your code on.
+The password is the number of subsets. In the above case the
+answer would be 4.
diff --git a/greplin/level3.csv b/greplin/level3.csv
@@ -0,0 +1 @@
+3, 4, 9, 14, 15, 19, 28, 37, 47, 50, 54, 56, 59, 61, 70, 73, 78, 81, 92, 95, 97, 99
+\ No newline at end of file
