bupt 85 Three Points On A Line(水题)

思路:判断是否存在三个点在同一条直线上,直接用斜率就可以了


#include<iostream>
#include<cstdio>
using namespace std;
double x[105];
double y[105];
int main()
{
	int T;
	scanf("%d",&T);
	while(T--)
	{
		int n;
		scanf("%d",&n);
		for(int i = 1;i<=n;i++)
		    scanf("%lf%lf",&x[i],&y[i]);
		int flag = 0;
		for(int i = 1;i<=n&&!flag ;i++)
			for(int j = i+1;j<=n&&!flag;j++)
				for(int k = j+1;k<=n&&!flag;k++)
					if((y[k]-y[i])/(x[k]-x[i]) == (y[j]-y[i])/(x[j]-x[i]))
						flag=1;
		printf("%s\n",flag?"Yes":"No");
	}
}


时间限制 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(1T10)  appears in the first line of input.

Each test case begins with the number of points  N(1N100) . 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.

输入样例

2
3
0.0 0.0
1.0 1.0
2.0 2.0
3
0.001 -2.000
3.333 4.444
1.010 2.528

输出样例

Yes
No

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值