

'''simple docstring'''


def     SCREAMING_SNAKE_CASE(	UpperCamelCase ,UpperCamelCase ,UpperCamelCase	)     ->     float:
	UpperCAmelCase_		:   Optional[int]													=       [1 / first_term]
	UpperCAmelCase_		:   Optional[Any]													=       1 / first_term
	for _ in range(number_of_terms - 1	):
		first_term += common_difference
		arithmetic_progression.append(UpperCamelCase	)
	UpperCAmelCase_		:   Optional[Any]													=       [1 / step for step in arithmetic_progression]
	return sum(UpperCamelCase	)


if __name__ == "__main__":
						import doctest

						doctest.testmod()
						print(sum_of_harmonic_progression(1 / 2, 2, 2))









'''simple docstring'''


from itertools import combinations, product







def     SCREAMING_SNAKE_CASE(	UpperCamelCase ,UpperCamelCase ,UpperCamelCase ,UpperCamelCase	)     ->     bool:
	if xa == ya == 0 or xa == ya == 0:
		return False
	UpperCAmelCase_		:   int													=       xa * xa + ya * ya
	UpperCAmelCase_		:   List[str]													=       xa * xa + ya * ya
	UpperCAmelCase_		:   Optional[Any]													=       (xa - xa) * (xa - xa) + (ya - ya) * (ya - ya)
	return (
	    a_square + b_square == c_square
	    or a_square + c_square == b_square
	    or b_square + c_square == a_square
	)







def     SCREAMING_SNAKE_CASE(	UpperCamelCase = 5_0	)     ->     int:
	return sum(
	    1
	    for pta, pta in combinations(product(range(limit + 1	) ,repeat=2	) ,2	)
	    if is_right(*UpperCamelCase ,*UpperCamelCase	)	)


if __name__ == "__main__":
						print(F'{solution() = }')






