北邮复试机试：85. Three Points On A Line

85. Three Points On A Line

时间限制 1000 ms 内存限制 65536 KB
题目描述
Given points on a 2D plane, judge whether there’re three points that locate on the same line.

输入格式
The number of test cases T(1≤T≤10) appears in the first line of input.

Each test case begins with the number of points N(1≤N≤100). The following N lines describe the coordinates (xi,yi) of each point, in accuracy of at most 3 decimals. Coordinates are ranged in [−104,104].

输出格式
For each test case, output Yes if there’re three points located on the same line, otherwise output No.

#include<iostream>
#include <cstdio>
using namespace std;
const int NUM=101;
double ayy[NUM][2];

int main()
{
	int t,n;
	scanf("%d",&t);
	while(t--)
	{
		int count=0;
		int i;
		scanf("%d",&n);
		for(i=0;i<n;i++)
		{
			scanf("%lf %lf",&ayy[i][0],&ayy[i][1]);
			if(i>1)
			{
				for(int j=1;j<i&&!count;j++)
				for(int k=0;k<j&&!count;k++)
				if((ayy[i][1]-ayy[j][1])/(ayy[i][0]-ayy[j][0])==(ayy[j][1]-ayy[k][1])/(ayy[j][0]-ayy[k][0]))
				{
				
					count=1;
					
				}
			}
		}
		
		if(!count)
		printf("No\n");
		else printf("Yes\n");
	}
	return 0;
}
//注意输出要求