|
||||||||||
Regular polygonTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 4394 Accepted Submission(s): 1613 Problem Description 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. Input 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.) Output For each case, output a number means how many different regular polygon these points can make. Sample Input
Sample Output
Source | ||||||||||
|