
from __future__ import annotations

from fractions import Fraction





def 	SCREAMING_SNAKE_CASE__    (      __lowerCAmelCase    ,		__lowerCAmelCase							):
    return (
        num != den and num % 10 == den // 10 and (num // 10) / (den % 10) == num / den
    )





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





def 	SCREAMING_SNAKE_CASE__    (      __lowerCAmelCase = 2							):
    snake_case__						=				1.0
    for fraction in fraction_list(__lowerCAmelCase							):
        snake_case__						=				Fraction(__lowerCAmelCase							)
        result *= frac.denominator / frac.numerator
    return int(__lowerCAmelCase							)


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





from __future__ import annotations





def 	SCREAMING_SNAKE_CASE__    (      __lowerCAmelCase    ,		__lowerCAmelCase							):
    snake_case__						,					snake_case__						=				set(__lowerCAmelCase							), [start]

    while stack:
        snake_case__						=				stack.pop()
        explored.add(__lowerCAmelCase							)
        # Differences from BFS:
        # 1) pop last element instead of first one
        # 2) add adjacent elements to stack without exploring them
        for adj in reversed(graph[v]							):
            if adj not in explored:
                stack.append(__lowerCAmelCase							)
    return explored


__magic_name__            =  {
    '''A''': ['''B''', '''C''', '''D'''],
    '''B''': ['''A''', '''D''', '''E'''],
    '''C''': ['''A''', '''F'''],
    '''D''': ['''B''', '''D'''],
    '''E''': ['''B''', '''F'''],
    '''F''': ['''C''', '''E''', '''G'''],
    '''G''': ['''F'''],
}

if __name__ == "__main__":
     import doctest

     doctest.testmod()
     print(depth_first_search(G, '''A'''))



