User Tools

Site Tools


prelude_to_self-describing_sequence

Differences

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

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision
Previous revision
Last revisionBoth sides next revision
prelude_to_self-describing_sequence [2011/09/20 06:24] jtkorbprelude_to_self-describing_sequence [2011/09/20 06:28] jtkorb
Line 7: Line 7:
   n                      10  11  12 13 14 15 16   n                      10  11  12 13 14 15 16
   f(n)  1                        6  6  6  7   f(n)  1                        6  6  6  7
-  fr[n] 1          12  16+  fr[n] 1          12  16   ...
  
 This array is a kind of run-length encoding of function ''f(n)''. This array is a kind of run-length encoding of function ''f(n)''.
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 Nfollowed by N*(N-1)/2 additional numbers.+Input consists of a sequence of integers, one per line.  The last entry is a 0which should not be processed.
  
 ===== Output ===== ===== Output =====
  
-Print a line of output for each line of input.  The first number on the line is N*(N-1)/2followed by the N*(N-1)/2 input numbers in sorted order, from lowest to highest.+For each non-zero input value''k'', print the value of ''n'' where ''f(n)'' equals ''k''.
  
 ===== Sample Input ===== ===== Sample Input =====
prelude_to_self-describing_sequence.txt · Last modified: 2011/09/20 06:34 by jtkorb