



"""simple docstring"""






def 			snake_case_    ( A_   :						int,							A_   :						int		):


       '''simple docstring'''





       return int(input_a == input_a == 0		)






def 			snake_case_    ( ):


       '''simple docstring'''





       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()







'''simple docstring'''



from math import pow
def        UpperCAmelCase (    A	:					int       ,		A	:					int       ,		A	:					int       ,		A	:					int       ,		A	:					int       ,		):
							if current_sum == needed_sum:
														# If the sum of the powers is equal to needed_sum, then we have a solution.
														solutions_count += 1
														return current_sum, solutions_count

							SCREAMING_SNAKE_CASE       :   Tuple         =      int(pow(A       ,		A					)					)
							if current_sum + i_to_n <= needed_sum:
														# If the sum of the powers is less than needed_sum, then continue adding powers.
														current_sum += i_to_n
														SCREAMING_SNAKE_CASE       ,SCREAMING_SNAKE_CASE       :   Dict         =      backtrack(
														    A       ,		A       ,		current_number + 1       ,		A       ,		A					)
														current_sum -= i_to_n
							if i_to_n < needed_sum:
														# If the power of i is less than needed_sum, then try with the next power.
														SCREAMING_SNAKE_CASE       ,SCREAMING_SNAKE_CASE       :   int         =      backtrack(
														    A       ,		A       ,		current_number + 1       ,		A       ,		A					)
							return current_sum, solutions_count
def        UpperCAmelCase (    A	:					int       ,		A	:					int					):
							if not (1 <= needed_sum <= 1000 and 2 <= power <= 10):
														raise ValueError(
														    '''Invalid input\n'''
														    '''needed_sum must be between 1 and 1000, power between 2 and 10.'''					)

							return backtrack(A       ,		A       ,		1       ,		0       ,		0					)[1]  # Return the solutions_count


if __name__ == "__main__":
							import doctest

							doctest.testmod()




