




"""simple docstring"""





from __future__ import annotations

from collections.abc import Callable

def        _UpperCamelCase     (      UpperCamelCase					,							UpperCamelCase					,							UpperCamelCase					,							UpperCamelCase = 100					,							)      ->      float:


			"""simple docstring"""
			__UpperCAmelCase						:			Optional[int]												=       x_start
			__UpperCAmelCase						:			List[str]												=       fnc(UpperCamelCase				)
			__UpperCAmelCase						:			Tuple												=       0.0
			for _ in range(UpperCamelCase				):
						# Approximates small segments of curve as linear and solve
						# for trapezoidal area
						__UpperCAmelCase						:			int												=       (x_end - x_start) / steps + xa
						__UpperCAmelCase						:			Tuple												=       fnc(UpperCamelCase				)
						area += abs(fxa + fxa				) * (xa - xa) / 2
						# Increment step
						__UpperCAmelCase						:			List[Any]												=       xa
						__UpperCAmelCase						:			Dict												=       fxa
			return area


if __name__ == "__main__":

					def        _UpperCamelCase     (      UpperCamelCase				)      ->      Optional[int]:


								"""simple docstring"""
								return x**3 + x**2

					print("""f(x) = x^3 + x^2""")
					print("""The area between the curve, x = -5, x = 5 and the x axis is:""")
					A				=							10
					while i <= 100_000:
										print(f'''with {i} steps: {trapezoidal_area(f, -5, 5, i)}''')
										i *= 10




import os

# Precomputes a list of the 100 first triangular numbers
__a         =   [int(0.5 * n * (n + 1)) for n in range(1, 1_0_1)]




def 							a		(				):


				'''simple docstring'''
				lowercase_	    =   os.path.dirname(os.path.realpath(snake_case__   )   )
				lowercase_	    =   os.path.join(snake_case__		,  '''words.txt'''   )

				lowercase_	    =   ''''''
				with open(snake_case__   ) as f:
								lowercase_	    =   f.readline()

				lowercase_	    =   [word.strip('''"'''   ) for word in words.strip('''\r\n'''   ).split(''','''   )]
				lowercase_	    =   [
				    word
				    for word in [sum(ord(snake_case__   ) - 64 for x in word   ) for word in words]
				    if word in TRIANGULAR_NUMBERS
				]
				return len(snake_case__   )


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




