Thu Sep 13 17:10:17 2018

SUBSET_SUM_TEST:
  Python version: 3.6.5
  Test the SUBSET_SUM library.

SUBSET_NEXT_TEST
  Python version: 3.6.5
  SUBSET_NEXT generates all subsets of an N set.

  (empty set)

  4

  3

  3
  4

  2

  2
  4

  2
  3

  2
  3
  4

  1

  1
  4

  1
  3

  1
  3
  4

  1
  2

  1
  2
  4

  1
  2
  3

  1
  2
  3
  4

  0

  0
  4

  0
  3

  0
  3
  4

  0
  2

  0
  2
  4

  0
  2
  3

  0
  2
  3
  4

  0
  1

  0
  1
  4

  0
  1
  3

  0
  1
  3
  4

  0
  1
  2

  0
  1
  2
  4

  0
  1
  2
  3

  0
  1
  2
  3
  4


SUBSET_NEXT_TEST:
  Normal end of execution.

SUBSET_SUM_COUNT_TESTS:
  Python version: 3.6.5
  SUBSET_SUM_COUNT_TEST calls SUBSET_SUM_COUNT with a
  particular set of weights and target.

SUBSET_SUM_COUNT_TEST:
  SUBSET_SUM_COUNT counts solutions to the subset sum problem.

  Seek a subset of W that sums to T.

  Target value T = 53

   I       W(I)

   0        15
   1        22
   2        14
   3        26
   4        32
   5         9
   6        16
   7         8

  Number of solutions is 3.

SUBSET_SUM_COUNT_TEST:
  SUBSET_SUM_COUNT counts solutions to the subset sum problem.

  Seek a subset of W that sums to T.

  Target value T = 5842

   I       W(I)

   0       267
   1       493
   2       869
   3       961
   4      1000
   5      1153
   6      1246
   7      1598
   8      1766
   9      1922

  Number of solutions is 1.

SUBSET_SUM_COUNT_TEST:
  SUBSET_SUM_COUNT counts solutions to the subset sum problem.

  Seek a subset of W that sums to T.

  Target value T = 2463098

   I       W(I)

   0    518533
   1   1037066
   2   2074132
   3   1648264
   4    796528
   5   1593056
   6    686112
   7   1372224
   8    244448
   9    488896
  10    977792
  11   1955584
  12   1411168
  13    322336
  14    644672
  15   1289344
  16     78688
  17    157376
  18    314752
  19    629504
  20   1259008

  Number of solutions is 1.

SUBSET_SUM_COUNT_TEST:
  SUBSET_SUM_COUNT counts solutions to the subset sum problem.

  Seek a subset of W that sums to T.

  Target value T = 50

   I       W(I)

   0        41
   1        34
   2        21
   3        20
   4         8
   5         7
   6         7
   7         4
   8         3
   9         3

  Number of solutions is 2.

SUBSET_SUM_COUNT_TEST:
  SUBSET_SUM_COUNT counts solutions to the subset sum problem.

  Seek a subset of W that sums to T.

  Target value T = 100

   I       W(I)

   0        81
   1        80
   2        43
   3        40
   4        30
   5        26
   6        12
   7        11
   8         9

  Number of solutions is 1.

SUBSET_SUM_COUNT_TEST:
  SUBSET_SUM_COUNT counts solutions to the subset sum problem.

  Seek a subset of W that sums to T.

  Target value T = 22

   I       W(I)

   0         1
   1         2
   2         4
   3         8
   4        16
   5        32

  Number of solutions is 1.

SUBSET_SUM_COUNT_TEST:
  SUBSET_SUM_COUNT counts solutions to the subset sum problem.

  Seek a subset of W that sums to T.

  Target value T = 50

   I       W(I)

   0        25
   1        27
   2         3
   3        12
   4         6
   5        15
   6         9
   7        30
   8        21
   9        19

  Number of solutions is 1.

SUBSET_SUM_COUNT_TESTS:
  Normal end of execution.

SUBSET_SUM_FIND_TESTS:
  Python version: 3.6.5
  SUBSET_SUM_FIND_TEST calls SUBSET_SUM_FIND with a
  particular set of weights and target.

SUBSET_SUM_FIND_TEST:
  SUBSET_SUM_FIND seeks a subset of W that sums to T.

  Target value T = 53

   I       W(I)

   0        15
   1        22
   2        14
   3        26
   4        32
   5         9
   6        16
   7         8

  53 = 
 + 22
 + 14
 + 9
 + 8


SUBSET_SUM_FIND_TEST:
  SUBSET_SUM_FIND seeks a subset of W that sums to T.

  Target value T = 5842

   I       W(I)

   0       267
   1       493
   2       869
   3       961
   4      1000
   5      1153
   6      1246
   7      1598
   8      1766
   9      1922

  5842 = 
 + 869
 + 961
 + 1000
 + 1246
 + 1766


SUBSET_SUM_FIND_TEST:
  SUBSET_SUM_FIND seeks a subset of W that sums to T.

  Target value T = 2463098

   I       W(I)

   0    518533
   1   1037066
   2   2074132
   3   1648264
   4    796528
   5   1593056
   6    686112
   7   1372224
   8    244448
   9    488896
  10    977792
  11   1955584
  12   1411168
  13    322336
  14    644672
  15   1289344
  16     78688
  17    157376
  18    314752
  19    629504
  20   1259008

  2463098 = 
 + 1037066
 + 796528
 + 629504


SUBSET_SUM_FIND_TEST:
  SUBSET_SUM_FIND seeks a subset of W that sums to T.

  Target value T = 50

   I       W(I)

   0        41
   1        34
   2        21
   3        20
   4         8
   5         7
   6         7
   7         4
   8         3
   9         3

  50 = 
 + 21
 + 8
 + 7
 + 7
 + 4
 + 3


SUBSET_SUM_FIND_TEST:
  SUBSET_SUM_FIND seeks a subset of W that sums to T.

  Target value T = 100

   I       W(I)

   0        81
   1        80
   2        43
   3        40
   4        30
   5        26
   6        12
   7        11
   8         9

  100 = 
 + 80
 + 11
 + 9


SUBSET_SUM_FIND_TEST:
  SUBSET_SUM_FIND seeks a subset of W that sums to T.

  Target value T = 22

   I       W(I)

   0         1
   1         2
   2         4
   3         8
   4        16
   5        32

  22 = 
 + 2
 + 4
 + 16


SUBSET_SUM_FIND_TEST:
  SUBSET_SUM_FIND seeks a subset of W that sums to T.

  Target value T = 50

   I       W(I)

   0        25
   1        27
   2         3
   3        12
   4         6
   5        15
   6         9
   7        30
   8        21
   9        19

  50 = 
 + 25
 + 6
 + 19


SUBSET_SUM_FIND_TESTS:
  Normal end of execution.

SUBSET_SUM_NEXT_TESTS:
  SUBSET_SUM_NEXT_TEST solves the subset sum problem
  for specific values of S, N and V.

SUBSET_SUM_NEXT_TEST:
  SUBSET_SUM_NEXT finds the "next" subset of the values
  which sum to the desired total S.

  Desired sum S = 9
  Number of targets = 5
  Targets:
 1
 2
 3
 5
 7


  1:  9 = 
1
+
3
+
5

  2:  9 = 
2
+
7


SUBSET_SUM_NEXT_TEST:
  SUBSET_SUM_NEXT finds the "next" subset of the values
  which sum to the desired total S.

  Desired sum S = 8
  Number of targets = 9
  Targets:
 1
 2
 3
 4
 5
 6
 7
 8
 9


  1:  8 = 
1
+
2
+
5

  2:  8 = 
1
+
3
+
4

  3:  8 = 
1
+
7

  4:  8 = 
2
+
6

  5:  8 = 
3
+
5

  6:  8 = 
8


SUBSET_SUM_NEXT_TEST:
  SUBSET_SUM_NEXT finds the "next" subset of the values
  which sum to the desired total S.

  Desired sum S = 8
  Number of targets = 9
  Targets:
 1
 2
 3
 3
 5
 6
 7
 8
 9


  1:  8 = 
1
+
2
+
5

  2:  8 = 
1
+
7

  3:  8 = 
2
+
3
+
3

  4:  8 = 
2
+
6

  5:  8 = 
3
+
5

  6:  8 = 
3
+
5

  7:  8 = 
8


SUBSET_SUM_NEXT_TEST:
  SUBSET_SUM_NEXT finds the "next" subset of the values
  which sum to the desired total S.

  Desired sum S = 18
  Number of targets = 5
  Targets:
 1
 2
 3
 5
 7


  1:  18 = 
1
+
2
+
3
+
5
+
7


SUBSET_SUM_NEXT_TEST:
  SUBSET_SUM_NEXT finds the "next" subset of the values
  which sum to the desired total S.

  Desired sum S = 5842
  Number of targets = 10
  Targets:
 267
 493
 869
 961
 1000
 1153
 1246
 1598
 1766
 1922


  1:  5842 = 
869
+
961
+
1000
+
1246
+
1766


SUBSET_SUM_NEXT_TESTS:
  Normal end of execution.

SUBSET_SUM_TABLE_TESTS:
  Python version: 3.6.5
  SUBSET_SUM_TABLE_TEST calls SUBSET_SUM_TABLE with a
  particular set of weights and target.

SUBSET_SUM_TABLE_TEST:
  SUBSET_SUM_TABLE seeks a subset of W that sums to T.

  Target value T = 53

   I       W(I)

   0        15
   1        22
   2        14
   3        26
   4        32
   5         9
   6        16
   7         8

  53 =
16
+
22
+
15


SUBSET_SUM_TABLE_TEST:
  SUBSET_SUM_TABLE seeks a subset of W that sums to T.

  Target value T = 5842

   I       W(I)

   0       267
   1       493
   2       869
   3       961
   4      1000
   5      1153
   6      1246
   7      1598
   8      1766
   9      1922

  5842 =
1766
+
1246
+
1000
+
961
+
869


SUBSET_SUM_TABLE_TEST:
  SUBSET_SUM_TABLE seeks a subset of W that sums to T.

  Target value T = 2463098

   I       W(I)

   0    518533
   1   1037066
   2   2074132
   3   1648264
   4    796528
   5   1593056
   6    686112
   7   1372224
   8    244448
   9    488896
  10    977792
  11   1955584
  12   1411168
  13    322336
  14    644672
  15   1289344
  16     78688
  17    157376
  18    314752
  19    629504
  20   1259008

  2463098 =
629504
+
796528
+
1037066


SUBSET_SUM_TABLE_TEST:
  SUBSET_SUM_TABLE seeks a subset of W that sums to T.

  Target value T = 50

   I       W(I)

   0        41
   1        34
   2        21
   3        20
   4         8
   5         7
   6         7
   7         4
   8         3
   9         3

  50 =
3
+
4
+
7
+
7
+
8
+
21


SUBSET_SUM_TABLE_TEST:
  SUBSET_SUM_TABLE seeks a subset of W that sums to T.

  Target value T = 100

   I       W(I)

   0        81
   1        80
   2        43
   3        40
   4        30
   5        26
   6        12
   7        11
   8         9

  100 =
9
+
11
+
80


SUBSET_SUM_TABLE_TEST:
  SUBSET_SUM_TABLE seeks a subset of W that sums to T.

  Target value T = 22

   I       W(I)

   0         1
   1         2
   2         4
   3         8
   4        16
   5        32

  22 =
16
+
4
+
2


SUBSET_SUM_TABLE_TEST:
  SUBSET_SUM_TABLE seeks a subset of W that sums to T.

  Target value T = 50

   I       W(I)

   0        25
   1        27
   2         3
   3        12
   4         6
   5        15
   6         9
   7        30
   8        21
   9        19

  50 =
19
+
6
+
25


SUBSET_SUM_TABLE_TESTS:
  Normal end of execution.

SUBSET_SUM_TEST:
  Normal end of execution.
Thu Sep 13 17:11:00 2018