← 返回题目
题库练习 Covered Points
← 上一题 下一题 →

A11999 | Covered Points

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

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.

输入格式

The first line contains a single integer $n$ ( $1 \le n \le 1000$ ) — the number of segments.

Each of the next $n$ lines contains four integers $Ax_i, Ay_i, Bx_i, By_i$ ( $-10^6 \le Ax_i, Ay_i, Bx_i, By_i \le 10^6$ ) — the coordinates of the endpoints $A$ , $B$ ( $A \ne B$ ) of the $i$ -th segment.

It is guaranteed that no two segments lie on the same line.

输出格式

Print a single integer — the number of distinct points with integer coordinates, which are covered by at least one segment.

输入输出样例

输入 #1
9
0 0 4 4
-1 5 4 0
4 0 4 4
5 2 11 2
6 1 6 7
5 6 11 6
10 1 10 7
7 0 9 8
10 -1 11 -1
输出 #1
42
输入 #2
4
-1 2 1 2
-1 0 1 0
-1 0 0 3
0 3 1 0
输出 #2
7
C++ 编辑器
输入
输出