code: 
  
  
  
  
  
  
  from itertools import combinations_with_replacement
  
  
  def 						_A     (       SCREAMING_SNAKE_CASE__						:			int = 100 ):
      UpperCamelCase :list[int]										=     [*list(range(1  ,						21 ) ), 25]
      UpperCamelCase :list[int]										=     [2 * x for x in range(1  ,						21 )] + [50]
      UpperCamelCase :list[int]										=     [3 * x for x in range(1  ,						21 )]
      UpperCamelCase :list[int]										=     singles + doubles + triples + [0]
  
      UpperCamelCase :int										=     0
      UpperCamelCase :int
      UpperCamelCase :int
      UpperCamelCase :int
      UpperCamelCase :int
  
      for double in doubles:
          for throwa, throwa in combinations_with_replacement(SCREAMING_SNAKE_CASE__  ,						2 ):
              UpperCamelCase :Optional[Any]										=     double + throwa + throwa
              if checkout_total < limit:
                  num_checkouts += 1
  
      return num_checkouts
  
  
  if __name__ == "__main__":
   print(f'''{solution() = }''')
  
  
  
  
  
  
style_context: 
  
  
  
  
  
  
  from __future__ import annotations
  
  
  
  
  
  
  
  class     UpperCAmelCase_		:
  
  
  
        """simple docstring"""
        def __init__(       self					,       SCREAMING_SNAKE_CASE_				)       ->   None:
            UpperCamelCase :Tuple										=     value
            UpperCamelCase :Node | None										=     None
            UpperCamelCase :Node | None										=     None
  
  
  
  
  
  
  
  class     UpperCAmelCase_		:
  
  
  
        """simple docstring"""
        UpperCamelCase_       :      int
        def __init__(       self				)       ->   None:
            UpperCamelCase :List[Any]										=     0
        def 					UpperCAmelCase		(       self					,       SCREAMING_SNAKE_CASE_					,       SCREAMING_SNAKE_CASE_				)       ->   None:
            if node is None:
                return
  
            if path_sum == self.target:
                self.paths += 1
  
            if node.left:
                self.depth_first_search(node.left					,       path_sum + node.left.value				)
            if node.right:
                self.depth_first_search(node.right					,       path_sum + node.right.value				)
  
  
  
  
        def 					UpperCAmelCase		(       self					,       SCREAMING_SNAKE_CASE_					,       SCREAMING_SNAKE_CASE_ = None				)       ->   int:
            if node is None:
                return 0
            if target is not None:
                UpperCamelCase :Tuple										=     target
  
            self.depth_first_search(SCREAMING_SNAKE_CASE_					,       node.value				)
            self.path_sum(node.left				)
            self.path_sum(node.right				)
  
            return self.paths
  
  
  if __name__ == "__main__":
   import doctest
  
   doctest.testmod()
  
  
  
  
  
  