Differences

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

--- contest_prelude_jolly_jumpers [2011/08/30 12:18] – jtkorb
+++ contest_prelude_jolly_jumpers [2011/08/30 13:44] (current) – clarification on what complete set means jtkorb
@@ Line 3: / Line 3: @@
 First, start by reading the problem statement for [[http://www.programming-challenges.com/pg.php?page=downloadproblem&probid=110201&format=html|Jolly Jumpers]].  The input format is the same and you will be computing a similar function.
-For each line of input, you will determine if that line contains the complete set of integers from the smallest value to the largest value with no duplicates.  Note that the integers on the line are unsorted.
+For each line of input, you will determine if that line contains the complete set of integers from the smallest value to the largest value with no duplicates.  (That is, each integer from lowest to highest must appear exactly once in the input.)  Note that the integers on the line are unsorted.
 ===== Input =====