



def      __snake_case	(			_UpperCAmelCase   , _UpperCAmelCase				):
    __a						       =				len(_UpperCAmelCase				)
    __a						       =				[[False] * (required_sum + 1) for _ in range(arr_len + 1				)]

    # for each arr value, a sum of zero(0) can be formed by not taking any element
    # hence True/1
    for i in range(arr_len + 1				):
        __a						       =				True

    # sum is not zero and set is empty then false
    for i in range(1   , required_sum + 1				):
        __a						       =				False

    for i in range(1   , arr_len + 1				):
        for j in range(1   , required_sum + 1				):
            if arr[i - 1] > j:
                __a						       =				subset[i - 1][j]
            if arr[i - 1] <= j:
                __a						       =				subset[i - 1][j] or subset[i - 1][j - arr[i - 1]]

    return subset[arr_len][required_sum]


if __name__ == "__main__":
 import doctest

 doctest.testmod()








"""simple docstring"""


from numpy import exp, pi, sqrt






def     a__    (    __SCREAMING_SNAKE_CASE					, __SCREAMING_SNAKE_CASE = 0.0					, __SCREAMING_SNAKE_CASE = 1.0 )	->	int:
		return 1 / sqrt(2 * pi * sigma**2 ) * exp(-((x - mu) ** 2) / (2 * sigma**2) )


if __name__ == "__main__":
			import doctest

			doctest.testmod()


