// output of ./demo/comb/partition-asc-subset-lex-csh-demo.cc:
// Description:
//% Partitions of n into positive parts, cyclically shifted subset-lex order.
//% Loopless algorithm.

arg 1: 11 == n  [partitions of n]  default=11
arg 2: 0 == aa  [Whether to render as ASCII art]  default=0
   0:  [ 9]  [ 1 1 1 1 1 1 1 2 2 ]
   1:  [ 8]  [ 1 1 1 1 1 1 2 3 ]
   2:  [ 7]  [ 1 1 1 1 1 2 4 ]
   3:  [ 8]  [ 1 1 1 1 1 2 2 2 ]
   4:  [ 7]  [ 1 1 1 1 1 3 3 ]
   5:  [ 6]  [ 1 1 1 1 2 5 ]
   6:  [ 7]  [ 1 1 1 1 2 2 3 ]
   7:  [ 6]  [ 1 1 1 1 3 4 ]
   8:  [ 5]  [ 1 1 1 2 6 ]
   9:  [ 6]  [ 1 1 1 2 2 4 ]
  10:  [ 7]  [ 1 1 1 2 2 2 2 ]
  11:  [ 6]  [ 1 1 1 2 3 3 ]
  12:  [ 5]  [ 1 1 1 3 5 ]
  13:  [ 5]  [ 1 1 1 4 4 ]
  14:  [ 4]  [ 1 1 2 7 ]
  15:  [ 5]  [ 1 1 2 2 5 ]
  16:  [ 6]  [ 1 1 2 2 2 3 ]
  17:  [ 5]  [ 1 1 2 3 4 ]
  18:  [ 4]  [ 1 1 3 6 ]
  19:  [ 5]  [ 1 1 3 3 3 ]
  20:  [ 4]  [ 1 1 4 5 ]
  21:  [ 3]  [ 1 2 8 ]
  22:  [ 4]  [ 1 2 2 6 ]
  23:  [ 5]  [ 1 2 2 2 4 ]
  24:  [ 6]  [ 1 2 2 2 2 2 ]
  25:  [ 5]  [ 1 2 2 3 3 ]
  26:  [ 4]  [ 1 2 3 5 ]
  27:  [ 4]  [ 1 2 4 4 ]
  28:  [ 3]  [ 1 3 7 ]
  29:  [ 4]  [ 1 3 3 4 ]
  30:  [ 3]  [ 1 4 6 ]
  31:  [ 3]  [ 1 5 5 ]
  32:  [ 2]  [ 2 9 ]
  33:  [ 3]  [ 2 2 7 ]
  34:  [ 4]  [ 2 2 2 5 ]
  35:  [ 5]  [ 2 2 2 2 3 ]
  36:  [ 4]  [ 2 2 3 4 ]
  37:  [ 3]  [ 2 3 6 ]
  38:  [ 4]  [ 2 3 3 3 ]
  39:  [ 3]  [ 2 4 5 ]
  40:  [ 2]  [ 3 8 ]
  41:  [ 3]  [ 3 3 5 ]
  42:  [ 3]  [ 3 4 4 ]
  43:  [ 2]  [ 4 7 ]
  44:  [ 2]  [ 5 6 ]
  45:  [ 1]  [ 11 ]
  46:  [ 2]  [ 1 10 ]
  47:  [ 3]  [ 1 1 9 ]
  48:  [ 4]  [ 1 1 1 8 ]
  49:  [ 5]  [ 1 1 1 1 7 ]
  50:  [ 6]  [ 1 1 1 1 1 6 ]
  51:  [ 7]  [ 1 1 1 1 1 1 5 ]
  52:  [ 8]  [ 1 1 1 1 1 1 1 4 ]
  53:  [ 9]  [ 1 1 1 1 1 1 1 1 3 ]
  54:  [10]  [ 1 1 1 1 1 1 1 1 1 2 ]
  55:  [11]  [ 1 1 1 1 1 1 1 1 1 1 1 ]
 ct=56
