// output of ./demo/comb/composition-nz-subset-lex-rec-demo.cc: // Description: //% Compositions of n into positive parts, subset-lex order. //% Recursive algorithm. arg 1: 7 == n [compositions of n] default=7 0: ...... [ 7 ] 1: 1..... [ 1 6 ] 2: 11.... [ 1 1 5 ] 3: 111... [ 1 1 1 4 ] 4: 1111.. [ 1 1 1 1 3 ] 5: 11111. [ 1 1 1 1 1 2 ] 6: 111111 [ 1 1 1 1 1 1 1 ] 7: 1111.1 [ 1 1 1 1 2 1 ] 8: 111.1. [ 1 1 1 2 2 ] 9: 111.11 [ 1 1 1 2 1 1 ] 10: 111..1 [ 1 1 1 3 1 ] 11: 11.1.. [ 1 1 2 3 ] 12: 11.11. [ 1 1 2 1 2 ] 13: 11.111 [ 1 1 2 1 1 1 ] 14: 11.1.1 [ 1 1 2 2 1 ] 15: 11..1. [ 1 1 3 2 ] 16: 11..11 [ 1 1 3 1 1 ] 17: 11...1 [ 1 1 4 1 ] 18: 1.1... [ 1 2 4 ] 19: 1.11.. [ 1 2 1 3 ] 20: 1.111. [ 1 2 1 1 2 ] 21: 1.1111 [ 1 2 1 1 1 1 ] 22: 1.11.1 [ 1 2 1 2 1 ] 23: 1.1.1. [ 1 2 2 2 ] 24: 1.1.11 [ 1 2 2 1 1 ] 25: 1.1..1 [ 1 2 3 1 ] 26: 1..1.. [ 1 3 3 ] 27: 1..11. [ 1 3 1 2 ] 28: 1..111 [ 1 3 1 1 1 ] 29: 1..1.1 [ 1 3 2 1 ] 30: 1...1. [ 1 4 2 ] 31: 1...11 [ 1 4 1 1 ] 32: 1....1 [ 1 5 1 ] 33: .1.... [ 2 5 ] 34: .11... [ 2 1 4 ] 35: .111.. [ 2 1 1 3 ] 36: .1111. [ 2 1 1 1 2 ] 37: .11111 [ 2 1 1 1 1 1 ] 38: .111.1 [ 2 1 1 2 1 ] 39: .11.1. [ 2 1 2 2 ] 40: .11.11 [ 2 1 2 1 1 ] 41: .11..1 [ 2 1 3 1 ] 42: .1.1.. [ 2 2 3 ] 43: .1.11. [ 2 2 1 2 ] 44: .1.111 [ 2 2 1 1 1 ] 45: .1.1.1 [ 2 2 2 1 ] 46: .1..1. [ 2 3 2 ] 47: .1..11 [ 2 3 1 1 ] 48: .1...1 [ 2 4 1 ] 49: ..1... [ 3 4 ] 50: ..11.. [ 3 1 3 ] 51: ..111. [ 3 1 1 2 ] 52: ..1111 [ 3 1 1 1 1 ] 53: ..11.1 [ 3 1 2 1 ] 54: ..1.1. [ 3 2 2 ] 55: ..1.11 [ 3 2 1 1 ] 56: ..1..1 [ 3 3 1 ] 57: ...1.. [ 4 3 ] 58: ...11. [ 4 1 2 ] 59: ...111 [ 4 1 1 1 ] 60: ...1.1 [ 4 2 1 ] 61: ....1. [ 5 2 ] 62: ....11 [ 5 1 1 ] 63: .....1 [ 6 1 ]