contest_prelude_jolly_jumpers
Differences
This shows you the differences between two versions of the page.
Next revision | Previous revision | ||
contest_prelude_jolly_jumpers [2011/08/28 12:19] – created 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 15: | Line 15: | ||
===== Sample Input ===== | ===== Sample Input ===== | ||
- | | + | < |
- | 5 1 4 2 -1 6 | + | 4 1 4 2 3 |
- | | + | 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 | ||
+ | </ | ||
===== Sample Output ===== | ===== Sample Output ===== | ||
- | | + | < |
- | not a set | + | set |
- | not a set | + | not a set |
- | set | + | not a set |
+ | set | ||
+ | </ |
contest_prelude_jolly_jumpers.1314559184.txt.gz · Last modified: 2011/08/28 12:19 by jtkorb