Alignment of the Planets

时限：1000ms 内存限制：10000K  总时限：3000ms

描述：

Actually, this problem is about alignment of N (1 <= N <= 770) cows numbered 1..N who are grazing in their field that is about 15,000x15,000 units. Their grazing locations all fall on integer coordinates in a standard x,y scheme (coordinates are in the range 0..15,000).

Bessie looks up and notices that she is exactly lined up with Sara and Julie. She wonders how many groups of three aligned cows exist within the field.

Given the locations of all the cows (no two cows occupy the same location), figure out all sets of three cows are exactly collinear. Keep track of the sets, sorting the cows in each set by their ID number, lowest first. Then sort the sets by the three ID numbers (lowest first), breaking ties by examining the second and third ID numbers.

输入：

Line 1: A single integer, N

Lines 2..N+1: Line i+1 describes cow i's location with two space-separated integers that are her x and y coordinates

输出：

Line 1: A single integer that is the number of sets of three cows that are exactly collinear. A set of four collinear cows would, of course, result in four sets of three collinear cows.

Lines 2..?: Each line contains three space-separated integers that are the cow ID numbers of three collinear cows. The lines are sorted as specified above. This output section is empty if no collinear sets exist.

输入样例：

8
0 0
0 4
1 2
2 4
4 3
4 5
5 1
6 5

输出样例：

1
1 3 4

提示：

Be careful of floating point arithmetic. Floating point comparison for equality almost never works as well as one would hope.

Explanation of the sample:

Eight cows grazing on a grid whose lower left corner looks like this:

. . . . * . *  
* . * . . . .  
. . . . * . .  
. * . . . . .  
. . . . . * . 
* . . . . . .
The digits mark the collinear cow IDs:

. . . . * . *  
* . 4 . . . .  
. . . . * . .  
. 3 . . . . .  
. . . . . * . 
1 . . . . . .
#include <iostream> #include <vector> using namespace std; struct Pos { int x; int y; }; Pos star[770], slope[770][770]; int n; vector<int> point; void ThreeAligned(void) { int i, j, k; for (i = 0; i < n; ++i) { for (j = i + 1; j < n; ++j) { slope[i][j].x = star[i].x - star[j].x; slope[i][j].y = star[i].y - star[j].y; } } for (i = 0; i < n; ++i) { for (j = i + 1; j < n; ++j) { for (k = j + 1; k < n; ++k) if (slope[i][j].x * slope[i][k].y == slope[i][j].y * slope[i][k].x) { point.push_back(i); point.push_back(j); point.push_back(k); } } } int count = 1; cout << point.size() / 3 << endl; if (!point.empty()) { for (vector<int>::iterator it = point.begin(); it != point.end(); ++it, ++count) { if (count % 3 != 0) cout << *it + 1 << " "; else cout << *it + 1 << endl; } } } int main(void) { cin >> n; for (int i = 0; i < n; ++i) cin >> star[i].x >> star[i].y; ThreeAligned(); return 0; }