



def 					__snake_case     (      _UpperCAmelCase       ,			_UpperCAmelCase    ):
				return int(input_a == input_a == 0    )





def 					__snake_case     (      ):
				print('''Truth Table of NOR Gate:'''    )
				print('''|   Input 1   |  Input 2  | Output |'''    )
				print(f'|      0      |    0      |  {nor_gate(0       ,			0    )}     |'    )
				print(f'|      0      |    1      |  {nor_gate(0       ,			1    )}     |'    )
				print(f'|      1      |    0      |  {nor_gate(1       ,			0    )}     |'    )
				print(f'|      1      |    1      |  {nor_gate(1       ,			1    )}     |'    )


if __name__ == "__main__":
	import doctest

	doctest.testmod()
	main()










def 					__snake_case     (      _UpperCAmelCase       ,			_UpperCAmelCase    ):

    def get_matched_characters(_UpperCAmelCase       ,			_UpperCAmelCase    ) -> str:
        __a							=    []
        __a							=    min(len(_stra    )       ,			len(_stra    )    ) // 2
        for i, l in enumerate(_stra    ):
            __a							=    int(max(0       ,			i - limit    )    )
            __a							=    int(min(i + limit + 1       ,			len(_stra    )    )    )
            if l in _stra[left:right]:
                matched.append(_UpperCAmelCase    )
                __a							=    f'{_stra[0:_stra.index(_UpperCAmelCase    )]} {_stra[_stra.index(_UpperCAmelCase    ) + 1:]}'

        return "".join(_UpperCAmelCase    )

    # matching characters
    __a							=    get_matched_characters(_UpperCAmelCase       ,			_UpperCAmelCase    )
    __a							=    get_matched_characters(_UpperCAmelCase       ,			_UpperCAmelCase    )
    __a							=    len(_UpperCAmelCase    )

    # transposition
    __a							=    (
        len([(ca, ca) for ca, ca in zip(_UpperCAmelCase       ,			_UpperCAmelCase    ) if ca != ca]    ) // 2
    )

    if not match_count:
        __a							=    0.0
    else:
        __a							=    (
            1
            / 3
            * (
                match_count / len(_UpperCAmelCase    )
                + match_count / len(_UpperCAmelCase    )
                + (match_count - transpositions) / match_count
            )
        )

    # common prefix up to 4 characters
    __a							=    0
    for ca, ca in zip(stra[:4]       ,			stra[:4]    ):
        if ca == ca:
            prefix_len += 1
        else:
            break

    return jaro + 0.1 * prefix_len * (1 - jaro)


if __name__ == "__main__":
 import doctest

 doctest.testmod()
 print(jaro_winkler('''hello''', '''world'''))





