prelude_to_self-describing_sequence
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | Next revisionBoth sides next revision | ||
| prelude_to_self-describing_sequence [2011/09/20 06:25] – jtkorb | prelude_to_self-describing_sequence [2011/09/20 06:26] – jtkorb | ||
|---|---|---|---|
| Line 13: | Line 13: | ||
| ===== Input ===== | ===== Input ===== | ||
| - | Like Pairsumonious Numbers, the input is a sequence of test cases, one per line. The first number on the line is N, followed by N*(N-1)/2 additional numbers. | + | Input consists of a sequence of integers, one per line. The last entry is a 0, which should not be processed. |
| ===== Output ===== | ===== Output ===== | ||
prelude_to_self-describing_sequence.txt · Last modified: 2011/09/20 06:34 by jtkorb