{"problem":{"name":"Ruined Square","description":{"content":"There is a square in the $xy$\\-plane. The coordinates of its four vertices are $(x_1,y_1),(x_2,y_2),(x_3,y_3)$ and $(x_4,y_4)$ in counter-clockwise order. (Assume that the positive $x$\\-axis points ri","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc108_b"},"statements":[{"statement_type":"Markdown","content":"There is a square in the $xy$\\-plane. The coordinates of its four vertices are $(x_1,y_1),(x_2,y_2),(x_3,y_3)$ and $(x_4,y_4)$ in counter-clockwise order. (Assume that the positive $x$\\-axis points right, and the positive $y$\\-axis points up.)\nTakahashi remembers $(x_1,y_1)$ and $(x_2,y_2)$, but he has forgot $(x_3,y_3)$ and $(x_4,y_4)$.\nGiven $x_1,x_2,y_1,y_2$, restore $x_3,y_3,x_4,y_4$. It can be shown that $x_3,y_3,x_4$ and $y_4$ uniquely exist and have integer values.\n\n## Constraints\n\n*   $|x_1|,|y_1|,|x_2|,|y_2| \\leq 100$\n*   $(x_1,y_1)$ ≠ $(x_2,y_2)$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$x_1$ $y_1$ $x_2$ $y_2$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc108_b","tags":[],"sample_group":[["0 0 0 1","\\-1 1 -1 0\n\n$(0,0),(0,1),(-1,1),(-1,0)$ is the four vertices of a square in counter-clockwise order. Note that $(x_3,y_3)=(1,1),(x_4,y_4)=(1,0)$ is not accepted, as the vertices are in clockwise order."],["2 3 6 6","3 10 -1 7"],["31 -41 -59 26","\\-126 -64 -36 -131"]],"created_at":"2026-03-03 11:01:13"}}