Differences

This shows you the differences between two versions of the page.

--- contest_2011-09-13 [2011/09/11 09:11] – jtkorb
+++ contest_2011-09-13 [2011/09/20 14:34] (current) – old revision restored jtkorb
@@ Line 14: / Line 14: @@
   * C: [[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=32&page=show_problem&problem=967|Shoemaker's Problem]]
   * D: [[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=34&page=show_problem&problem=1154|How Many Pieces of Land?]]
+  * E: [[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=34&page=show_problem&problem=990|Self-describing Sequence]]
-If you've already solved one or more of these problems, try (1) solving again without referring to your old solution, and/or (2) using a different language (Java or C++).  If you want to work on an additional problem from this chapter, let [[jtk@purdue.edu|me]] know.
+//Remember:// If you've already solved one or more of these problems, try (1) solving again without referring to your old solution, and/or (2) using a different language (Java or C++).  If you want to work on an additional problem from the book, let [[jtk@purdue.edu|me]] know.
 **Hints:**
@@ Line 23: / Line 24: @@
   * C: See B.
   * D: Once you see the trick, the solution is easy with big integers (are they required?).
+  * E: Pre-compute a run-length encoded array to represent f, then do a binary search to find f(n).