Tim Korb's Home Page

User Tools

Site Tools

Trace: • contest_prelude_jolly_jumpers
contest_prelude_jolly_jumpers

Differences

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

Link to this comparison view

Next revision		Previous revision
contest_prelude_jolly_jumpers [2011/08/28 12:19] – created jtkorbcontest_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. 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 ===== ===== Input =====
Line 15: Line 15:
 ===== Sample Input ===== ===== Sample Input =====
  
-    4 1 4 2 3 +<code> 
-    5 1 4 2 -1 6 +4 1 4 2 3 
-    4 1 2 3 4 4 +5 1 4 2 -1 6 
-    6 3 -1 2 -2 1 0+5 1 2 3 4 4 
 +6 3 -1 2 -2 1 0 
 +</code>
  
 ===== Sample Output ===== ===== Sample Output =====
  
-    set +<code> 
-    not a set +set 
-    not a set +not a set 
-    set +not a set 
 +set 
 +</code>
contest_prelude_jolly_jumpers.1314559184.txt.gz · Last modified: 2011/08/28 12:19 by jtkorb