2021.07.02 B. Bad Boy # 726 Div.2 시간 1초, 메모리 256MB input : t (1≤t≤10^4) n, m, i, j (1≤n,m≤10^9, 1≤i≤n, 1≤j≤m) output : For each test case, print four integers x1, y1, x2, y2 (1≤x1,x2≤n, 1≤y1,y2≤m) — the coordinates of where the two yo-yos should be throw... 2021.07.022021.07.02
B. Bad Boy # 726 Div.2 시간 1초, 메모리 256MB input : t (1≤t≤10^4) n, m, i, j (1≤n,m≤10^9, 1≤i≤n, 1≤j≤m) output : For each test case, print four integers x1, y1, x2, y2 (1≤x1,x2≤n, 1≤y1,y2≤m) — the coordinates of where the two yo-yos should be throw... 2021.07.022021.07.02