编程介的小学生 2017-04-28 10:31 采纳率: 20.5%
浏览 716
已采纳

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条回答 默认 最新

报告相同问题?

悬赏问题

  • ¥15 求差集那个函数有问题,有无佬可以解决
  • ¥15 【提问】基于Invest的水源涵养
  • ¥20 微信网友居然可以通过vx号找到我绑的手机号
  • ¥15 寻一个支付宝扫码远程授权登录的软件助手app
  • ¥15 解riccati方程组
  • ¥15 display:none;样式在嵌套结构中的已设置了display样式的元素上不起作用?
  • ¥15 使用rabbitMQ 消息队列作为url源进行多线程爬取时,总有几个url没有处理的问题。
  • ¥15 Ubuntu在安装序列比对软件STAR时出现报错如何解决
  • ¥50 树莓派安卓APK系统签名
  • ¥65 汇编语言除法溢出问题