bupt|118. Three Points On A Line

最新推荐文章于 2024-09-12 19:02:20 发布

July_zh

最新推荐文章于 2024-09-12 19:02:20 发布

阅读量165

点赞数 2

分类专栏：刷题的日常文章标签：算法

本文链接：https://blog.csdn.net/chaokudeztt/article/details/105566508

版权

刷题的日常专栏收录该内容

217 篇文章 21 订阅

订阅专栏

时间限制 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 (x_i,y_i) of each point, in accuracy of at most 3 decimals. Coordinates are ranged in [−10⁴,10⁴].

输出格式
For each test case, output Yes if there’re three points located on the same line, otherwise output No.
对于每个测试用例，如果有三个点位于同一行，则输出Yes，否则输出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

#include<bits/stdc++.h>
using namespace std;
int main() {
    int t, n;
    float a[105];
    float b[105];
    while(scanf("%d", &t) != EOF) {
        while(t--) {
            int flag = 0;
            scanf("%d", &n);
            for(int i = 0; i < n; i++) {
                scanf("%f", &a[i]);
                scanf("%f", &b[i]);
            }
            for(int i = 0; i < n && !flag; i++) {
                for(int j = i + 1; j < n && !flag; j++) {
                    for(int k = j + 1; k < n && !flag; k++) {
                        if((b[k] - b[j]) / (a[k] - a[j]) == (b[j] - b[i]) / (a[j] - a[i])) {
                            flag = 1;
                        }
                    }
                }
            }
            if(flag == 1) {
                printf("Yes\n");
            } else {
                printf("No\n");
            }
        }
    }
    return 0;
}