




"""simple docstring"""




from __future__ import annotations

from fractions import Fraction



def        a__					(							snake_case__			,					snake_case__							)		->   bool:
			return (
			    num != den and num % 10 == den // 10 and (num // 10) / (den % 10) == num / den
			)



def        a__					(							snake_case__							)		->   list[str]:
			lowerCamelCase      =   []
			lowerCamelCase      =   11
			lowerCamelCase      =   int("""1""" + """0""" * digit_len							)
			for num in range(snake_case__			,					snake_case__							):
						while den <= 99:
									if (num != den) and (num % 10 == den // 10) and (den % 10 != 0):
												if is_digit_cancelling(snake_case__			,					snake_case__							):
															solutions.append(F'{num}/{den}'							)
									den += 1
						num += 1
						lowerCamelCase      =   10
			return solutions



def        a__					(							snake_case__ = 2							)		->   int:
			lowerCamelCase      =   1.0
			for fraction in fraction_list(snake_case__							):
						lowerCamelCase      =   Fraction(snake_case__							)
						result *= frac.denominator / frac.numerator
			return int(snake_case__							)


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









"""simple docstring"""




from collections.abc import Sequence



def        a__					(							snake_case__			,					snake_case__ = False							)		->   float:
			if not arr:
						return 0

			lowerCamelCase      =   0 if allow_empty_subarrays else float("""-inf"""							)
			lowerCamelCase      =   0.0
			for num in arr:
						lowerCamelCase      =   max(0 if allow_empty_subarrays else num			,					curr_sum + num							)
						lowerCamelCase      =   max(snake_case__			,					snake_case__							)

			return max_sum


if __name__ == "__main__":
					from doctest import testmod

					testmod()

					lowerCAmelCase				:     Union[str, Any]					=				[-2, 1, -3, 4, -1, 2, 1, -5, 4]
					print(F"""{max_subarray_sum(nums) = }""")



