User Tools

Site Tools


contest_2011-09-13

Differences

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

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
contest_2011-09-13 [2011/09/11 08:47]
jtkorb
contest_2011-09-13 [2011/09/20 14:34] (current)
jtkorb old revision restored
Line 13: Line 13:
   * B: [[http://​uva.onlinejudge.org/​index.php?​option=com_onlinejudge&​Itemid=8&​category=32&​page=show_problem&​problem=1132|Longest Nap]]   * B: [[http://​uva.onlinejudge.org/​index.php?​option=com_onlinejudge&​Itemid=8&​category=32&​page=show_problem&​problem=1132|Longest Nap]]
   * C: [[http://​uva.onlinejudge.org/​index.php?​option=com_onlinejudge&​Itemid=8&​category=32&​page=show_problem&​problem=967|Shoemaker'​s Problem]]   * 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 ​+  * 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:** **Hints:**
Line 23: Line 24:
   * C: See B.   * C: See B.
   * D: Once you see the trick, the solution is easy with big integers (are they required?).   * 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).
contest_2011-09-13.1315756060.txt.gz · Last modified: 2011/09/11 08:47 by jtkorb