Changeset 3837


Ignore:
Timestamp:
Jul 10, 2008, 10:52:29 PM (12 years ago)
Author:
orlov
Message:
  • Added task description.
File:
1 edited

Legend:

Unmodified
Added
Removed
  • applications/trunk/UGPSummerSchool2008/src/Sequence.rf

    r3832 r3837  
     1// Arrange three 1s, three 2s, ..., three 9s in sequence so that for all
     2// i in [1, 9] there are exactly i numbers between successive occurrences
     3// of i. An example of such a sequence is 1, 9, 1, 2, 1, 8, 2, 4, 6, 2,
     4// 7, 9, 4, 5, 8, 6, 3, 4, 7, 5, 3, 9, 6, 8, 3, 5, 7.
     5// (http://people.csail.mit.edu/namin/bits/reasoned-schemer/sequence-program.scm.html)
     6
    17$use StdIO;
    28
Note: See TracChangeset for help on using the changeset viewer.