"""simple docstring"""


a				={}





def      lowerCamelCase_					(   __lowerCAmelCase  ,       __lowerCAmelCase  ,       __lowerCAmelCase							)				->   int:




						'''simple docstring'''



						if late == 3 or absent == 2:
												return 0

						# if we have no days left, and have not failed any other rules,
						# we have a prize string
						if days == 0:
												return 1

						# No easy solution, so now we need to do the recursive calculation

						# First, check if the combination is already in the cache, and
						# if yes, return the stored value from there since we already
						# know the number of possible prize strings from this point on
						lowerCamelCase__   =(days, absent, late)
						if key in cache:
												return cache[key]

						# now we calculate the three possible ways that can unfold from
						# this point on, depending on our attendance today

						# 1) if we are late (but not absent), the "absent" counter stays as
						# it is, but the "late" counter increases by one
						lowerCamelCase__   =_calculate(days - 1  ,       __lowerCAmelCase  ,       late + 1							)

						# 2) if we are absent, the "absent" counter increases by 1, and the
						# "late" counter resets to 0
						lowerCamelCase__   =_calculate(days - 1  ,       absent + 1  ,       0							)

						# 3) if we are on time, this resets the "late" counter and keeps the
						# absent counter
						lowerCamelCase__   =_calculate(days - 1  ,       __lowerCAmelCase  ,       0							)

						lowerCamelCase__   =state_late + state_absent + state_ontime

						lowerCamelCase__   =prizestrings
						return prizestrings





def      lowerCamelCase_					(   __lowerCAmelCase = 30							)				->   int:




						'''simple docstring'''



						return _calculate(__lowerCAmelCase  ,       absent=0  ,       late=0							)


if __name__ == "__main__":
	print(solution())



"""simple docstring"""


from __future__ import annotations

from numpy import array, cos, cross, floataa, radians, sin
from numpy.typing import NDArray





def      lowerCamelCase_					(   __lowerCAmelCase  ,       __lowerCAmelCase  ,       __lowerCAmelCase = False							)				->   list[float]:




						'''simple docstring'''



						if radian_mode:
												return [magnitude * cos(__lowerCAmelCase							), magnitude * sin(__lowerCAmelCase							)]
						return [magnitude * cos(radians(__lowerCAmelCase							)							), magnitude * sin(radians(__lowerCAmelCase							)							)]





def      lowerCamelCase_					(   __lowerCAmelCase  ,       __lowerCAmelCase  ,       __lowerCAmelCase = 10**-1							)				->   bool:




						'''simple docstring'''



						lowerCamelCase__   =cross(__lowerCAmelCase  ,       __lowerCAmelCase							)
						lowerCamelCase__   =sum(__lowerCAmelCase							)
						return abs(__lowerCAmelCase							) < eps


if __name__ == "__main__":
	# Test to check if it works
	a				=array(
	    [
	        polar_force(718.4, 180 - 30),
	        polar_force(879.54, 45),
	        polar_force(100, -90),
	    ]
	)

	a				=array([[0, 0], [0, 0], [0, 0]])

	assert in_static_equilibrium(forces, location)

	# Problem 1 in image_data/2D_problems.jpg
	a				=array(
	    [
	        polar_force(30 * 9.81, 15),
	        polar_force(215, 180 - 45),
	        polar_force(264, 90 - 30),
	    ]
	)

	a				=array([[0, 0], [0, 0], [0, 0]])

	assert in_static_equilibrium(forces, location)

	# Problem in image_data/2D_problems_1.jpg
	a				=array([[0, -2000], [0, -1200], [0, 1_5600], [0, -1_2400]])

	a				=array([[0, 0], [6, 0], [10, 0], [12, 0]])

	assert in_static_equilibrium(forces, location)

	import doctest

	doctest.testmod()


