lightoj1058 && poj1791 求平行四边形个数

最新推荐文章于 2022-01-06 20:20:41 发布

hzasrd

最新推荐文章于 2022-01-06 20:20:41 发布

阅读量414

点赞数

分类专栏：基础题 Lightoj poj

本文链接：https://blog.csdn.net/zs120197/article/details/52201114

版权

该博客介绍了如何解决一道编程题，题目要求找出一组给定坐标点能构成的平行四边形个数。通过利用平行四边形对角线中点相等的性质，计算每对点的中点并排序，查找重复的中点来确定平行四边形的数量。给出的样例输入和输出展示了测试用例的处理方式。

摘要由CSDN通过智能技术生成

Description

There are n distinct points in the plane, given by their integer coordinates. Find the number of parallelograms whose vertices lie on these points. In other words, find the number of 4-element subsets of these points that can be written as {A, B, C, D} such that AB || CD, and BC || AD. No four points are in a straight line.

Input

Input starts with an integer T (≤ 15), denoting the number of test cases.

The first line of each test case contains an integer n (1 ≤ n ≤ 1000). Each of the nextn lines, contains2 space-separated integers x and y (the coordinates of a point) with magnitude (absolute value) of no more than1000000000.

Output