CF 851B-Arpa and an exam about geometry

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.

Input

The only line contains six integers ax,ay,bx,by,cx,cy ≤ $10^9$. It’s guaranteed that the points are distinct.

Output

Print “Yes” if the problem has a solution, “No” otherwise.

You can print each letter in any case (upper or lower).

input

0 1 1 1 1 0

output

Yes

input

1 1 0 0 1000 1000

output

No

Note

In the first sample test, rotate the page around (0.5, 0.5) by 90°.

In the second sample test, you can’t find any solution.

---

判断AB和BC长度是否相等即可，注意三点不能共线

#include <vector>
#include <iostream>
using namespace std;
static const auto io_sync_off = []() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    return nullptr;
}();

using ll = long long;
int main()
{
    ll x1, y1, x2, y2, x3, y3;
    cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3;
    if ((x2 - x1) * (y3 - y1) == (y2 - y1) * (x3 -x1))
    {
        cout << "No";
        return 0;
    }
    ll a = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2); 
    ll b = (x3 - x2) * (x3 - x2) + (y3 - y2) * (y3 - y2);
    if (a == b)
        cout << "Yes";
    else 
        cout << "No";
    return 0;
}