program main

!*****************************************************************************80
!
!! knapsack_01_brute_test() tests knapsack_01_brute().
!
!  Licensing:
!
!    This code is distributed under the MIT license.
!
!  Modified:
!
!    20 August 2014
!
!  Author:
!
!    John Burkardt
!
  implicit none

  call timestamp ( )
  write ( *, '(a)' ) ''
  write ( *, '(a)' ) 'knapsack_01_brute_test():'
  write ( *, '(a)' ) '  FORTRAN90 version.'
  write ( *, '(a)' ) '  Test knapsack_01_brute().'

  call knapsack_01_brute_test01 ( )
!
!  Terminate.
!
  write ( *, '(a)' ) ''
  write ( *, '(a)' ) 'knapsack_01_brute_test():'
  write ( *, '(a)' ) '  Normal end of execution.'
  write ( *, '(a)' ) ''
  call timestamp ( )

  return
end
subroutine knapsack_01_brute_test01 ( )

!*****************************************************************************80
!
!! knapsack_01_brute_test01() seeks a solution of the 0/1 Knapsack problem.
!
!  Discussion:
!
!    In the 0/1 knapsack problem, a knapsack of capacity C is given,
!    as well as N items, with the I-th item of weight W(I).
!
!    A selection is "acceptable" if the total weight is no greater than C.
!
!    It is desired to find an optimal acceptable selection, that is,
!    an acceptable selection such that there is no acceptable selection
!    of greater weight.
!
!  Licensing:
!
!    This code is distributed under the MIT license.
!
!  Modified:
!
!    21 August 2014
!
!  Author:
!
!    John Burkardt
!
  implicit none

  integer, parameter :: n = 6

  integer c
  integer i
  integer s(n)
  integer t
  integer, dimension ( n ) :: w = (/ &
    16, 17, 23, 24, 39, 40 /)

  c = 100

  write ( *, '(a)' ) ''
  write ( *, '(a)' ) 'knapsack_01_brute_test01():'
  write ( *, '(a,i4)' ) '  Knapsack maximum capacity is ', c
  write ( *, '(a)' ) '  Come as close as possible to filling the knapsack.'

  call knapsack_01_brute ( n, w, c, s )

  write ( *, '(a)' ) ''
  write ( *, '(a)' ) '   # 0/1  Weight'
  write ( *, '(a)' ) ''
  do i = 1, n
    write ( *, '(2x,i2,2x,i1,2x,i4)' ) i, s(i), w(i)
  end do
  t = dot_product ( s, w )
  write ( *, '(a)' ) ''
  write ( *, '(a,i4)' ) '  Total: ', t

  return
end
subroutine timestamp ( )

!*****************************************************************************80
!
!! timestamp() prints the current YMDHMS date as a time stamp.
!
!  Example:
!
!    31 May 2001   9:45:54.872 AM
!
!  Licensing:
!
!    This code is distributed under the MIT license.
!
!  Modified:
!
!    18 May 2013
!
!  Author:
!
!    John Burkardt
!
  implicit none

  character ( len = 8 ) ampm
  integer d
  integer h
  integer m
  integer mm
  character ( len = 9 ), parameter, dimension(12) :: month = (/ &
    'January  ', 'February ', 'March    ', 'April    ', &
    'May      ', 'June     ', 'July     ', 'August   ', &
    'September', 'October  ', 'November ', 'December ' /)
  integer n
  integer s
  integer values(8)
  integer y

  call date_and_time ( values = values )

  y = values(1)
  m = values(2)
  d = values(3)
  h = values(5)
  n = values(6)
  s = values(7)
  mm = values(8)

  if ( h < 12 ) then
    ampm = 'AM'
  else if ( h == 12 ) then
    if ( n == 0 .and. s == 0 ) then
      ampm = 'Noon'
    else
      ampm = 'PM'
    end if
  else
    h = h - 12
    if ( h < 12 ) then
      ampm = 'PM'
    else if ( h == 12 ) then
      if ( n == 0 .and. s == 0 ) then
        ampm = 'Midnight'
      else
        ampm = 'AM'
      end if
    end if
  end if

  write ( *, '(i2,1x,a,1x,i4,2x,i2,a1,i2.2,a1,i2.2,a1,i3.3,1x,a)' ) &
    d, trim ( month(m) ), y, h, ':', n, ':', s, '.', mm, trim ( ampm )

  return
end