






"""simple docstring"""






def 						_UpperCamelCase			(  A    ,       A    ,       A			):
   UpperCamelCase_     =[1 / first_term]
   UpperCamelCase_     =1 / first_term
   for _ in range(number_of_terms - 1			):
      first_term += common_difference
      arithmetic_progression.append(A			)
   UpperCamelCase_     =[1 / step for step in arithmetic_progression]
   return sum(A			)


if __name__ == "__main__":
    import doctest

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








"""simple docstring"""






from __future__ import annotations

from pathlib import Path




def 						_UpperCamelCase			(  A    ,       A			):
   return pointa[0] * pointa[1] - pointa[1] * pointa[0]




def 						_UpperCamelCase			(  A    ,       A    ,       A    ,       A    ,       A    ,       A			):
   UpperCamelCase_     =(xa, ya)
   UpperCamelCase_     =(xa - xa, ya - ya)
   UpperCamelCase_     =(xa - xa, ya - ya)
   UpperCamelCase_     =-vector_product(A    ,       A			) / vector_product(
       A    ,       A			)
   UpperCamelCase_     =+vector_product(A    ,       A			) / vector_product(
       A    ,       A			)

   return a > 0 and b > 0 and a + b < 1




def 						_UpperCamelCase			(  A = "p102_triangles.txt"			):
   UpperCamelCase_     =Path(A			).parent.joinpath(A			).read_text(encoding="utf-8"			)

   UpperCamelCase_     =[]
   for line in data.strip().split("\n"			):
      triangles.append([int(A			) for number in line.split(","			)]			)

   UpperCamelCase_     =0
   UpperCamelCase_     =42

   for triangle in triangles:
      ret += contains_origin(*A			)

   return ret


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