contest_prelude_jolly_jumpers
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
contest_prelude_jolly_jumpers [2011/08/28 15:22] – 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:// | First, start by reading the problem statement for [[http:// | ||
- | 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. | + | 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. |
===== Input ===== | ===== Input ===== | ||
Line 18: | Line 18: | ||
4 1 4 2 3 | 4 1 4 2 3 | ||
5 1 4 2 -1 6 | 5 1 4 2 -1 6 | ||
- | 4 1 2 3 4 4 | + | 5 1 2 3 4 4 |
6 3 -1 2 -2 1 0 | 6 3 -1 2 -2 1 0 | ||
</ | </ |
contest_prelude_jolly_jumpers.1314570123.txt.gz · Last modified: 2011/08/28 15:22 by jtkorb