Codeforces Round #432 (Div. 2)
来源:互联网 发布:算法导论第四章思考题 编辑:程序博客网 时间:2024/05/16 10:30
Arpa is taking a geometry exam. Here is the last problem of the exam.
You are given three points a, b, c.
Find a point and an angle such that if we rotate the page around the point by the angle, the new position of a is the same as the old position of b, and the new position of b is the same as the old position of c.
Arpa is doubting if the problem has a solution or not (i.e. if there exists a point and an angle satisfying the condition). Help Arpa determine if the question has a solution or not.
The only line contains six integers ax, ay, bx, by, cx, cy (|ax|, |ay|, |bx|, |by|, |cx|, |cy| ≤ 109). It's guaranteed that the points are distinct.
Print "Yes" if the problem has a solution, "No" otherwise.
You can print each letter in any case (upper or lower).
0 1 1 1 1 0
Yes
1 1 0 0 1000 1000
No
In the first sample test, rotate the page around (0.5, 0.5) by .
In the second sample test, you can't find any solution.
题意:
在平面上有 a , b , c 三个点,问是否在平面上存在一点,使得a、b以该点为轴选择某一角度后a->b, b->c
思路:
因为a可以到b,b可以到c,所以a可以到c且a,b,c三点在同一圆上,因为转的角度相同,所以ab = bc ,同时因为是在圆上,所以ac≠ab+bc
#include<iostream>#include<string.h>#include<stdio.h>#include<math.h>using namespace std;int main(){ double ax,bx,cx,ay,by,cy; cin>>ax>>ay>>bx>>by>>cx>>cy; double ab = sqrt(pow(ax-bx,2)+pow(ay-by,2)); double bc = sqrt(pow(cx-bx,2)+pow(cy-by,2)); double ac = sqrt(pow(ax-cx,2)+pow(ay-cy,2)); if(ab==bc && ac!=ab+bc) printf("Yes"); else printf("No"); return 0;}
- Codeforces Round #432 (Div. 2)
- Codeforces Round #432 (Div. 2)
- Codeforces Round #432 (Div. 2)
- Codeforces Round #432 (Div.2)
- Codeforces Round #432 (Div. 2) D
- Codeforces Round #432 (Div. 2) 题解
- Codeforces Round #432 (Div. 2) 总结
- Codeforces Round #432(Div. 1)
- Codeforces Round #102 (Div. 2)
- Codeforces Round #103 (Div. 2)
- Codeforces Round #103 (Div. 2)
- Codeforces Round #104 (Div. 2)
- Codeforces Round #105 (Div. 2)
- Codeforces Round #105 (Div. 2)
- Codeforces Round #107 (Div. 2)
- Codeforces Round #108 (Div. 2)
- Codeforces Round #110 (Div. 2)
- Codeforces Round #122 (Div. 2)
- 拓扑排序及模板
- C++文件操作——文本写入
- 《Java核心技术(卷一)》读书笔记——第三章:Java基础
- 表是否在数据库中,字段是否存在表中
- Server Tomcat v7.0 Server at localhost failed to start.解决方法
- Codeforces Round #432 (Div. 2)
- Java web学习总结19: JSP标签
- java final修饰符详解
- DB2 SQL 多字段更新 语句
- 设置winDbg为即时调试器JIT
- 利用百度OCR的node.js的接口实现文字识别的功能
- ROS中需要了解的几个概念
- mybatis 项目配置 xml文件时 报错提示(The reference to entity "useSSL" must end with the ';'
- 11:整数的个数