





import unittest

from knapsack import greedy_knapsack as kp
class        SCREAMING_SNAKE_CASE     (unittest.TestCase   ):


   def  SCREAMING_SNAKE_CASE_							(					self    :       Optional[int] )->     Dict:





     """simple docstring"""







     lowercase__			    =						[10, 20, 30, 40, 50, 60]
     lowercase__			    =						[2, 4, 6, 8, 10, 12]
     lowercase__			    =						100
     self.assertEqual(kp.calc_profit(a    ,  a    ,  a )    ,  210 )


   def  SCREAMING_SNAKE_CASE_							(					self    :       Tuple )->     Any:





     """simple docstring"""







     self.assertRaisesRegex(a    ,  'max_weight must greater than zero.' )


   def  SCREAMING_SNAKE_CASE_							(					self    :       Any )->     Optional[Any]:





     """simple docstring"""







     self.assertRaisesRegex(a    ,  'Weight can not be negative.' )


   def  SCREAMING_SNAKE_CASE_							(					self    :       Tuple )->     Tuple:





     """simple docstring"""







     self.assertRaisesRegex(a    ,  'Profit can not be negative.' )


   def  SCREAMING_SNAKE_CASE_							(					self    :       Dict )->     List[str]:





     """simple docstring"""







     self.assertRaisesRegex(a    ,  'max_weight must greater than zero.' )


   def  SCREAMING_SNAKE_CASE_							(					self    :       str )->     Union[str, Any]:





     """simple docstring"""







     self.assertRaisesRegex(
         a    ,  'The length of profit and weight must be same.' )


if __name__ == "__main__":
      unittest.main()









import math




def     __UpperCamelCase						(_SCREAMING_SNAKE_CASE	,		_SCREAMING_SNAKE_CASE	)       ->     List[Any]:
  if 0 not in (x, y):
    # We use the relation x^y = y*log10(x), where 10 is the base.
    return y * math.logaa(_SCREAMING_SNAKE_CASE	)
  else:
    if x == 0:  # 0 raised to any number is 0
      return 0
    elif y == 0:
      return 1  # any number raised to 0 is 1
  raise AssertionError('This should never happen'	)


if __name__ == "__main__":  # Main function
      # Read two numbers from input and typecast them to int using map function.
      # Here x is the base and y is the power.
      lowercase_					     =	"""Enter the base and the power separated by a comma: """
      lowercase_     ,							lowercase_					     =	map(int, input(prompt).split(""","""))
      lowercase_     ,							lowercase_					     =	map(int, input(prompt).split(""","""))

      # We find the log of each number, using the function res(), which takes two
      # arguments.
      lowercase_					     =	res(xa, ya)
      lowercase_					     =	res(xa, ya)

      # We check for the largest number
      if resa > resa:
            print("""Largest number is""", xa, """^""", ya)
      elif resa > resa:
            print("""Largest number is""", xa, """^""", ya)
      else:
            print("""Both are equal""")


