// output of ./demo/comb/setpart-rgs-subset-lex-demo.cc:
// Description:
//% Restricted growth strings (RGS) for set partitions in subset-lex order.

arg 1: 5 == n  [Length of RGS]  default=5
arg 2: 0 == bw  [Whether to generate backward order]  default=0
   0:    [ . . . . . ]   1
   1:    [ . 1 . . . ]   1
   2:    [ . 1 1 . . ]   2
   3:    [ . 1 2 . . ]   2
   4:    [ . 1 2 1 . ]   3
   5:    [ . 1 2 2 . ]   3
   6:    [ . 1 2 3 . ]   3
   7:    [ . 1 2 3 1 ]   4
   8:    [ . 1 2 3 2 ]   4
   9:    [ . 1 2 3 3 ]   4
  10:    [ . 1 2 3 4 ]   4
  11:    [ . 1 2 2 1 ]   4
  12:    [ . 1 2 2 2 ]   4
  13:    [ . 1 2 2 3 ]   4
  14:    [ . 1 2 1 1 ]   4
  15:    [ . 1 2 1 2 ]   4
  16:    [ . 1 2 1 3 ]   4
  17:    [ . 1 2 . 1 ]   4
  18:    [ . 1 2 . 2 ]   4
  19:    [ . 1 2 . 3 ]   4
  20:    [ . 1 1 1 . ]   3
  21:    [ . 1 1 2 . ]   3
  22:    [ . 1 1 2 1 ]   4
  23:    [ . 1 1 2 2 ]   4
  24:    [ . 1 1 2 3 ]   4
  25:    [ . 1 1 1 1 ]   4
  26:    [ . 1 1 1 2 ]   4
  27:    [ . 1 1 . 1 ]   4
  28:    [ . 1 1 . 2 ]   4
  29:    [ . 1 . 1 . ]   3
  30:    [ . 1 . 2 . ]   3
  31:    [ . 1 . 2 1 ]   4
  32:    [ . 1 . 2 2 ]   4
  33:    [ . 1 . 2 3 ]   4
  34:    [ . 1 . 1 1 ]   4
  35:    [ . 1 . 1 2 ]   4
  36:    [ . 1 . . 1 ]   4
  37:    [ . 1 . . 2 ]   4
  38:    [ . . 1 . . ]   2
  39:    [ . . 1 1 . ]   3
  40:    [ . . 1 2 . ]   3
  41:    [ . . 1 2 1 ]   4
  42:    [ . . 1 2 2 ]   4
  43:    [ . . 1 2 3 ]   4
  44:    [ . . 1 1 1 ]   4
  45:    [ . . 1 1 2 ]   4
  46:    [ . . 1 . 1 ]   4
  47:    [ . . 1 . 2 ]   4
  48:    [ . . . 1 . ]   3
  49:    [ . . . 1 1 ]   4
  50:    [ . . . 1 2 ]   4
  51:    [ . . . . 1 ]   4
 ct=52
