Tim Korb's Home Page

User Tools

Site Tools

Trace:
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
prelude_to_self-describing_sequence [2011/09/20 06:25] – jtkorbprelude_to_self-describing_sequence [2011/09/20 06:34] (current) – 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 =====
  
-Print a line of output for each line of input.  The first number on the line is N*(N-1)/2, followed 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)'' changes to ''k''.
  
 ===== Sample Input ===== ===== Sample Input =====
  
 <code> <code>
-3 1269 1160 1663 +7 
-3 1 1 1 +0
-5 226 223 225 224 227 229 228 226 225 227 +
-5 216 210 204 212 220 214 222 208 216 210 +
-5 -1 0 -1 -2 1 0 -1 1 0 -1 +
-5 79950 79936 79942 79962 79954 79972 79960 79968 79924 79932+
 </code> </code>
  
Line 33: Line 29:
  
 <code> <code>
-3 1160 1269 1663 +16
-3 1 1 1 +
-10 223 224 225 225 226 226 227 227 228 229 +
-10 204 208 210 210 212 214 216 216 220 222 +
-10 -2 -1 -1 -1 -1 0 0 0 1 1 +
-10 79924 79932 79936 79942 79950 79954 79960 79962 79968 79972+
 </code> </code>
prelude_to_self-describing_sequence.1316525128.txt.gz · Last modified: 2011/09/20 06:25 by jtkorb