POJ - 2002：Squares

最新推荐文章于 2020-04-17 15:27:14 发布

wingrez

最新推荐文章于 2020-04-17 15:27:14 发布

阅读量383

点赞数

CC 4.0 BY-SA版权

分类专栏：【记录】算法题解

本文为博主原创文章，未经博主允许不得转载。

本文链接：https://blog.youkuaiyun.com/wingrez/article/details/80532059

【记录】算法题解专栏收录该内容

229 篇文章 ¥19.90 ¥99.00

订阅专栏

超级会员免费看

该博客介绍了如何解决POJ中的2002题——Squares，即从夜空中的一组星点找出能构成的所有正方形数量。每个测试用例包含n个星点的坐标，要求找到所有可能的正方形。博客提供了输入输出样例以及参考代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Squares

来源：POJ

标签：

参考资料：

相似题目：

题目

A square is a 4-sided polygon whose sides have equal length and adjacent sides form 90-degree angles. It is also a polygon such that rotating about its centre by 90 degrees gives the same polygon. It is not the only polygon with the latter property, however, as a regular octagon also has this property.
So we all know what a square looks like, but can we find all possible squares that can be formed from a set of stars in a night sky? To make the problem easier, we will assume that the night sky is a 2-dimensional plane, and each star is specified by its x and y coordinates.