同和创作矩阵 › ›博文归档› 技术博文归档 › 查看内容

10053_Triangle

2022-5-16 18:16| 发布者: Hocassian| 查看: 115| 评论: 0|原作者: 肇庆学院ACM合集

摘要:

C:\Users\Administrator\Downloads\2019-10-12-10-14-3-89504495017400-Problem List-采集的数据-后羿采集器.html

Pro.ID

10053

Title

Triangle

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=10053

AC

Submit

Ratio

23.26%

时间&空间限制

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

描述

It is a simple task, for N points on the 2D plane, you are supposed to find whether there are three points which could form a isosceles triangle.

输入

There are several test cases. For each case, the first line is an integer N ( 3 ≤ N ≤ 500 ) indicating the number of points. N lines follow, each line contains two doubles ( not exceed 1000.0 ), indicating the coordinates of the points.

输出

Description

It is a simple task, for N points on the 2D plane, you are supposed to find whether there are three points which could form a isosceles triangle.

Input

Output

For each case, if there exists a solution which could form a isosceles triangle, output "YES", else output "NO".

Sample Input

3
0 0
1 1
-1 1
3
0 0
1 1
5 10

Sample Output

YES
NO

样例输入