1960239_ac_249ms_36k.c

北大大牛代码 1240道题的原代码 超级权威

# include <stdio.h>
# include <stdlib.h>
# define MAX 771

struct node
{
	int x;
	int y;
}cows[MAX];

struct Node
{
	int x;
	int y;
	int z;
}output[MAX];
int main()
{
	int i, j, k, N, m;

	scanf("%d",&N);
	for(i = 0; i < N; i++)
		scanf("%d%d",&cows[i].x,&cows[i].y);
	m = 0;
	for(i = 0; i < N-2; i++)
		for(j = i+1; j < N-1; j++)
			for(k = j+1; k < N; k++)
			{
				if((cows[k].x-cows[j].x)*(cows[j].y-cows[i].y)==(cows[j].x-cows[i].x)*(cows[k].y-cows[j].y))
				{
					output[m].x = i+1;
					output[m].y = j+1;
					output[m++].z = k+1;
				}
			}
	printf("%d\n",m);
	for(i = 0; i < m; i++)
		printf("%d %d %d\n",output[i].x,output[i].y,output[i].z);
	return 1;
}