my-solutions/codeforces/round-171/problem_a/README.md

60 lines
1.5 KiB
Markdown

# A. Perpendicular Segments
[Codeforces](https://codeforces.com/contest/2026/problem/A)
You are given a coordinate plane and three integers `X`, `Y`, and `K`. Find two line segments `AB` and `CD` such that
1. the coordinates of points `A`, `B`, `C`, and `D` are integers;
2. 0 ≤ `Ax`, `Bx`, `Cx`, `Dx``X` and 0 ≤ `Ay`, `By`, `Cy`, `Dy``Y`;
3. the length of segment `AB` is at least `K`;
4. the length of segment `CD` is at least `K`;
5. segments `AB` and `CD` are perpendicular: if you draw lines that contain `AB` and `CD`, they will cross at a right angle.
Note that it's not necessary for segments to intersect.
Segments are perpendicular as long as the lines they induce are perpendicular.
## Input
The first line contains a single integer `t` (1 ≤ `t` ≤ 5000) — the number of test cases. Next, `t` cases follow.
The first and only line of each test case contains three integers `X`, `Y`, and `K`
(1 ≤ `X`, `Y` ≤ 1000; 1 ≤ `K`≤ 1414).
Additional constraint on the input: the values of `X`, `Y`, and `K`
are chosen in such a way that the answer exists.
## Output
For each test case, print two lines. The first line should contain 4
integers `Ax`, `Ay`, `Bx`, and `By` — the coordinates of the first segment.
The second line should also contain 4
integers `Cx`, `Cy`, `Dx`, and `Dy` — the coordinates of the second segment.
If there are multiple answers, print any of them.
## Example
Input
```
4
1 1 1
3 4 1
4 3 3
3 4 4
```
Output
```
0 0 1 0
0 0 0 1
2 4 2 2
0 1 1 1
0 0 1 3
1 2 4 1
0 1 3 4
0 3 3 0
```