|
||||||||||
Counting TrianglesTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 414 Accepted Submission(s): 16 Problem Description There are many different points int xoy coordinate axes. Connect every two points with straight line. How many triangles can you find. Input There are many test cases. Please process to end of file. First of each test case is an integer N (3 <= N <= 1000). Then N line follows, each line contains one unique point X, Y (-10000000 <= X, Y <= 10000000). Output Print the number of triangles you can find. Sample Input
Sample Output
Author lemon Source | ||||||||||
|