


from __future__ import annotations

from pathlib import Path







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







def 	A (		A__		,		A__		,		A__		,		A__		,		A__		,		A__			):
     UpperCAmelCase    :					tuple[int, int]			=      (xa, ya)
     UpperCAmelCase    :					tuple[int, int]			=      (xa - xa, ya - ya)
     UpperCAmelCase    :					tuple[int, int]			=      (xa - xa, ya - ya)
     UpperCAmelCase    :					float			=      -vector_product(A__		,		A__			) / vector_product(
         A__		,		A__			)
     UpperCAmelCase    :					float			=      +vector_product(A__		,		A__			) / vector_product(
         A__		,		A__			)

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







def 	A (		A__ = "p102_triangles.txt"			):
     UpperCAmelCase    :					str			=      Path(A__			).parent.joinpath(A__			).read_text(encoding="utf-8"			)

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

     UpperCAmelCase    :					int			=      0
     UpperCAmelCase    :					list[int]

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

     return ret


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







def 	A (		A__			):
     UpperCAmelCase    :					Dict			=      9

     while num > 0:
          if num % 1_0 != digit:
               return False
          num //= 1_0_0
          digit -= 1

     return True







def 	A (		):
     UpperCAmelCase    :					Optional[Any]			=      1_3_8_9_0_2_6_6_3

     while not is_square_form(num * num			):
          if num % 1_0 == 3:
               num -= 6  # (3 - 6) % 10 = 7
          else:
               num -= 4  # (7 - 4) % 10 = 3

     return num * 1_0


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



