






"""simple docstring"""





def 	lowerCamelCase__			(				_lowerCamelCase			:						list						,							_lowerCamelCase			:						list						,							_lowerCamelCase			:						int					) ->							list:
  lowerCamelCase_       	=		len(_lowerCamelCase					)
  lowerCamelCase_       	=		[[0] * n for i in range(_lowerCamelCase					)]
  for i in range(_lowerCamelCase					):
    lowerCamelCase_       	=		y_points[i]

  for i in range(2						,							_lowerCamelCase					):
    for j in range(_lowerCamelCase						,							_lowerCamelCase					):
      lowerCamelCase_       	=		(
          (xa - x_points[j - i + 1]) * q[j][i - 1]
          - (xa - x_points[j]) * q[j - 1][i - 1]
      ) / (x_points[j] - x_points[j - i + 1])

  return [q[n - 1][n - 1], q]


if __name__ == "__main__":
  import doctest

  doctest.testmod()












"""simple docstring"""





def 	lowerCamelCase__			(				_lowerCamelCase			:						str					) ->							bool:
  lowerCamelCase_       	=		0
  for ch in input_str:
    lowerCamelCase_       	=		ord(_lowerCamelCase					)
    lowerCamelCase_       	=		pow(2						,							_lowerCamelCase					)

    # If we already turned on bit for current character's unicode
    if bitmap >> ch_unicode & 1 == 1:
      return False
    bitmap |= ch_bit_index_on
  return True


if __name__ == "__main__":
  import doctest

  doctest.testmod()




