// output of ./demo/comb/partition-desc-bb-demo.cc:
// Description:
//% Integer partitions as weakly descending list of parts,
//%   with bounds for size of parts and number of parts.
//% Lexicographic order.

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