21. Close Proximity (1)

Time Limit: 1 seconds

Memory Limit: 128 MB

Rating: 900

Problem Statement

Superman wants to know if there is any close friends nearby. As a prank, generate 3 random points where his ‘friends’ are and their corresponding distances away from him. Assume map is a cartesian grid.

Input

You are given no input.

Output

Output two randomly generated space-separated integers, $X_i$ and $Y_i$ on each of the three separate lines. $(1 \le i \le 3)$

Sample Cases
Sample Output 1:
3 4
9 2
-5439 35986

Sample Output 2:
-359086 2039858
-999 42395
35948 -439058
Explanation

Note: The judge checks for different integers being outputted each time in the format given.

Sources

KL Coding Cup 2022 > Problem 7 > Developmental League

Submit | Back