shunfurh
编程介的小学生
采纳率92.7%
2017-09-10 06:20 阅读 698
已采纳

Fix the Lines

A line segment is said to be fixed if two distinct points on the line are fixed.
Given several lines on a plane, let's calculate the minimum number of points needed to fix these lines on the plane.

Input

One integer 't' stating the number of test cases, followed by 't' blocks.

One integer 'n' specifying the number of line segments, followed by n pairs of coordinates specifying the ends of the segments. All coordinates are at the format of (x, y). the number n does not exceed 7.

Output

One integer a line stating the points needed to fix the line segments.

Sample Input

1

2
1 1 2 1
2 2 3 2

Sample Output

4

  • 点赞
  • 写回答
  • 关注问题
  • 收藏
  • 复制链接分享

1条回答 默认 最新

相关推荐