1808: Regular polygon
时间限制: 3 Sec 内存限制: 128 MB提交: 40 解决: 24
[提交][状态][讨论版][命题人:]
题目描述
On a two-dimensional plane, give you n integer points. Your task is to figure out how many different regular polygon these points can make.
输入描述
The input file consists of several test cases. Each case the first line is a numbers N (N <= 500). The next N lines ,each line contain two number Xi and Yi(-100 <= xi,yi <= 100), means the points’ position.(the data assures no two points share the same position.)
输出描述
For each case, output a number means how many different regular polygon these points can make.
样例输入
4
0 0
0 1
1 0
1 1
6
0 0
0 1
1 0
1 1
2 0
2 1样例输出
1
2来源
-
Anything about this OnlineJudge, Please Contact Administrator. Click add QQ
OJ system based on HUSTOJ Project , UI based on Twitter Bootstrap
Copyright 2016 ACM算法攻关部
关于网站改版