



def 		_UpperCAmelCase				(      snake_case			):





					"""simple docstring"""

					_lowerCAmelCase						=    len(snake_case			)
					_lowerCAmelCase						=    sum(snake_case			)

					_lowerCAmelCase						=    [[False for x in range(s + 1			)] for y in range(n + 1			)]

					for i in range(1	,						n + 1			):
										_lowerCAmelCase						=    True

					for i in range(1	,						s + 1			):
										_lowerCAmelCase						=    False

					for i in range(1	,						n + 1			):
										for j in range(1	,						s + 1			):
															_lowerCAmelCase						=    dp[i][j - 1]

															if arr[i - 1] <= j:
																				_lowerCAmelCase						=    dp[i][j] or dp[i - 1][j - arr[i - 1]]

					for j in range(int(s / 2			)	,						-1	,						-1			):
										if dp[n][j] is True:
															_lowerCAmelCase						=    s - 2 * j
															break

					return diff








'''simple docstring'''




def 				lowerCAmelCase_   (	_lowerCamelCase:   float       ,      _lowerCamelCase:   list[float]					):
		if discount_rate < 0:
				raise ValueError("""Discount rate cannot be negative"""					)
		if not cash_flows:
				raise ValueError("""Cash flows list cannot be empty"""					)
		__SCREAMING_SNAKE_CASE       :		List[str]           =		sum(
		    cash_flow / ((1 + discount_rate) ** i) for i, cash_flow in enumerate(_lowerCamelCase					)					)
		return round(_lowerCamelCase       ,      ndigits=2					)


if __name__ == "__main__":
						import doctest

						doctest.testmod()