CF1036E Covered Points
Description
You are given $ n $ segments on a Cartesian plane. Each segment's endpoints have integer coordinates. Segments can intersect with each other. No two segments lie on the same line.
Count the number of distinct points with integer coordinates, which are covered by at least one segment.
Input Format
N/A
Output Format
N/A
Explanation/Hint
The image for the first example:
Several key points are marked blue, the answer contains some non-marked points as well.
The image for the second example:
