function subset_sum_count_tests ( )

%*****************************************************************************80
%
%% SUBSET_SUM_COUNT_TESTS tests SUBSET_SUM_COUNT_TEST.
%
%  Licensing:
%
%    I don't care what you do with this code.
%
%  Modified:
%
%    10 November 2015
%
%  Author:
%
%    John Burkardt
%
  fprintf ( 1, '\n' );
  fprintf ( 1, 'SUBSET_SUM_COUNT_TESTS:\n' );
  fprintf ( 1, '  SUBSET_SUM_COUNT_TEST calls SUBSET_SUM_COUNT with a\n' );
  fprintf ( 1, '  particular set of weights and target.\n' );
%
%  Problem #1.
%
  w = [ 15, 22, 14, 26, 32, 9, 16, 8 ];
  t = 53;
  count = subset_sum_count_test ( w, t );
%
%  Problem #2.
%
  w = [   267,  493,  869,  961, 1000, 1153, 1246, 1598, 1766, 1922 ];
  t = 5842;
  count = subset_sum_count_test ( w, t );
%
%  Problem #3.
%
  w = [  518533, 1037066, 2074132, 1648264, 796528, ...
        1593056,  686112, 1372224,  244448, 488896, ...
         977792, 1955584, 1411168,  322336, 644672, ...
        1289344,   78688,  157376,  314752, 629504, ...
        1259008 ];
  t = 2463098;
  count = subset_sum_count_test ( w, t );
%
%  Problem #4.
%
  w = [ 41, 34, 21, 20,  8,  7,  7,  4,  3,  3 ];
  t = 50;
  count = subset_sum_count_test ( w, t );
%
%  Problem #5.
%
  w = [ 81, 80, 43, 40, 30, 26, 12, 11, 9 ];
  t = 100;
  count = subset_sum_count_test ( w, t );
%
%  Problem #6.
%
  w = [ 1, 2, 4, 8, 16, 32 ];
  t = 22;
  r = [ 0, 2^6 - 1 ];
  count = subset_sum_count_test ( w, t, r );
%
%  Problem #7.
%
  w = [ 25, 27, 3, 12, 6, 15, 9, 30, 21, 19 ];
  t = 50;
  r = [ 0, 2^10 - 1 ];
  count = subset_sum_count_test ( w, t, r );
%
%  Terminate.
%
  fprintf ( 1, '\n' );
  fprintf ( 1, 'SUBSET_SUM_COUNT_TESTS:\n' );
  fprintf ( 1, '  Normal end of execution.\n' );

  return
end
