POJ 3174 Alignment of the Planets

题目问三点同时在一条直线上的情况有多少种，并输出。
题解：判断(x2-x1)*(y3-y2)=(x3-x2)*(y2-y1)是否成立即可。

数据不清楚长啥样，O(N^3)的算法能跑得比 O(N^2LgN)的快，O(N^2LgN^2)的能超时貌似……

如下图，蓝蓝与红红乘积相等即可。

我写的比较繁琐，最后有别人同思路简短版

#include<stdio.h>
#include<iostream>
#include<math.h>
#include<string.h>
#include<iomanip>
#include<stdlib.h>
#include<ctype.h>
#include<algorithm>
#include<deque>
#include<functional>
#include<iterator>
#include<vector>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<sstream>
#define CPY(A, B) memcpy(A, B, sizeof(A))
typedef long long LL;
typedef unsigned long long uLL;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-9;
const double OO = 1e20;
const double PI = acos (-1.0);
int dx[]= {0,1,1,1,0,-1,-1,-1};
int dy[]= {1,1,0,-1,-1,-1,0,1};
int gcd (const LL &a, const LL &b) {return b==0?a:gcd (b,a%b);}
using namespace std;
struct NN {
    int x,y;
} nn[780];
NN dis[780][780];
vector<int> ANS;
int main() {
    int n; cin>>n;
    for (int i=0; i<n; ++i) {cin>>nn[i].x>>nn[i].y;}
    for (int i=0; i<n; ++i) {
        for (int j=i+1; j<n; ++j) {
            dis[i][j].x=nn[i].x-nn[j].x;
            dis[i][j].y=nn[i].y-nn[j].y;
        }//计算距离
    }
    for (int i=0; i<n-2; ++i) {
        for (int j=i+1; j<n-1; ++j) {
            for (int k=j+1; k<n; ++k) {
                if (dis[i][j].x*dis[j][k].y==dis[j][k].x*dis[i][j].y) {
                    ANS.push_back (i);
                    ANS.push_back (j);
                    ANS.push_back (k);
                }//存储答案
            }
        }
    }
    cout<<ANS.size() /3<<endl; int cas=1;
    if (!ANS.empty() ) {
        vector<int>::iterator it;
        for (it=ANS.begin(); it!=ANS.end(); ++it) {
            (cas%3) ? cout<<*it+1<<" ":cout<<*it+1<<endl;
            cas++;
        }
    }
    return 0;
}

别人的简短代码：来自：http://blog.csdn.net/flqbestboy/

#include<cstdio>
const int M=880;
const int Max=999999;
int n,i,j,k,counter;
struct node {
    int x,y;
} point[M];
struct node1 {
    int o,p,q;
} res[Max];
using namespace std;
int main() {
    while (scanf ("%d",&n) !=EOF) {
        counter=0;
        for (i=1; i<=n; i++) {scanf ("%d%d",&point[i].x,&point[i].y);}
        for (i=1; i<=n-2; i++)
            for (j=i+1; j<=n-1; j++)
                for (k=j+1; k<=n; k++)
                    if ( (point[j].x-point[i].x)*(point[k].y-point[i].y)==(point[k].x-point[i].x)*(point[j].y-point[i].y)){
                        counter++;
                        res[counter].o=i;
                        res[counter].p=j;
                        res[counter].q=k;
                    }
        printf ("%d\n",counter);
        for (i=1; i<=counter; i++) {
            printf ("%d %d %d\n",res[i].o,res[i].p,res[i].q);//直截了当，结构体速度还比STL快一点
        }
    }
    return 0;
}