F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1    Accepted Submission(s): 1


Problem Description
设集合S={(X1,Y1),(X2,Y2),...,(XN,YN)}是给出的平面点集,统计集合S的4元子集{P1,P2,P3,P4}的数量,满足点P1,P2,P3,P4四点共圆。
 

Input
输入的第一行为一个整数T (1<=T<=50),表示测试用例的个数。
接下来输入T组数据,每组数据为:
第1行,整数N,表示点的数量(N<=200)。
第2到N+1行,2个整数Xi和Yi,表示点的坐标(-10,000<=Xi,Yi<=10,000)。
 

Output
输出T行数据,每行一个整数K,表示满足条件的子集的数量。
 

Sample Input
1 4 0 0 0 1 1 0 1 1
 

Sample Output
1
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2025 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2025-03-29 18:20:49, Gzip enabled