九度 oj 题目1548：平面上的点

http://ac.jobdu.com/problem.php?pid=1548

code from http://www.lai18.com/content/477808.html

#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
#define ms(x,y) memset(x,y,sizeof(x))
#define inone(i) scanf("%d",&i)
#define intwo(i,j) scanf("%d %d",&i,&j)
#define rep(i,j,k) for(int i=j;i<=k;i++)
const int maxn = 101 + 10;
int n, a[maxn], b[maxn], nk;
double k;

int main()
{
	while (inone(n) != EOF)
	{
		rep(i, 1, n) intwo(a[i], b[i]);
		if (n == 0 || n == 1 || n == 2) {
			printf("%d\n", n);
			continue;
		}
		nk = 0;
		rep(i, 1, n)
		{
			rep(j, i + 1, n)
			{
				int tk = 2;
				while (j <= n&&a[i] == a[j] && b[i] == b[j]) { tk++; j++; }
				if (j == n+1) tk--; //很重要，如果找不到不重合的点，tk要--
				rep(k, j+1, n)
				{
					int k1 = (b[k] - b[j]) * (a[j] - a[i]);
					int k2 = (b[j] - b[i]) * (a[k] - a[j]);
					if (k1 == k2) tk++;
				}
				nk = max(nk, tk);
			}
		}
		printf("%d\n", nk);
	}
    return 0;
}