Aura Farm
To achieve "maximum aura", Nick decides that he will start an "aura farm" - a physical field of soil where he will grow his "swag" and his "rizz".
To ensure he grows enough "swag" and "rizz" to achieve "maximum aura", the field needs to be at least \(10\) square units. However, there is a problem: the space available might be too small. This space happens to be triangular. Can you help him work out whether he has enough space to achieve "maximum aura"?
Input
The input consists of three lines. Each line contains two integers \(0 \leq x_i, y_i \leq 100\), representing the \(x\) and \(y\) coordinates of one of the field's corners.
Furthermore, of the three corners, there will always be at least one pair of corners that share an identical \(x\) coordinate or an identical \(y\) coordinate. This will be explained in the examples.
Output
The program must output Yes if the area of the field is at least \(10\) square units, or No if it is not.
Examples
Example 1
Input:
0 10
0 0
2 3
In this example, the first and second corners have the same \(x\) coordinate (\(x_1 = x_2\)).
Output:
Yes
The program outputs Yes, because the area is exactly \(10\) square units (and therefore is indeed at least \(10\) units).
Example 2
Input:
1 2
2 1
3 2
In this example, the first and third corners have the same \(y\) coordinate (\(y_1 = y_3\)).
Output:
No
The program outputs No, because the area is less than \(10\) square units.
Example 3
Input:
1 2
1 7
6 2
In this example, there happens to be more than one pair of corners that share a value. This can happen.
Output:
Yes
Comments