Triangle

AtCoder

IDagc036_a

Time2000ms

Memory256MB

Difficulty—

Given is an integer $S$. Find a combination of six integers $X_1,Y_1,X_2,Y_2,X_3,$ and $Y_3$ that satisfies all of the following conditions: * $0 \leq X_1,Y_1,X_2,Y_2,X_3,Y_3 \leq 10^9$ * The area of the triangle in a two-dimensional plane whose vertices are $(X_1,Y_1),(X_2,Y_2),$ and $(X_3,Y_3)$ is $S/2$. We can prove that there always exist six integers that satisfy the conditions under the constraints of this problem. ## Constraints * $1 \leq S \leq 10^{18}$ * All values in input are integers. ## Input Input is given from Standard Input in the following format: $S$ [samples]

Samples

Input #1

Output #1

1 0 2 2 0 1

The area of the triangle in a two-dimensional plane whose vertices are $(1,0),(2,2),$ and $(0,1)$ is $3/2$. Printing `3 0 3 1 0 1` or `1 0 0 1 2 2` will also be accepted.

Input #2

Output #2

0 0 10 0 0 10

Input #3

311114770564041497

Output #3

314159265 358979323 846264338 327950288 419716939 937510582

API Response (JSON)

{
  "problem": {
    "name": "Triangle",
    "description": {
      "content": "Given is an integer $S$. Find a combination of six integers $X_1,Y_1,X_2,Y_2,X_3,$ and $Y_3$ that satisfies all of the following conditions: *   $0 \\leq X_1,Y_1,X_2,Y_2,X_3,Y_3 \\leq 10^9$ *   The are",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "agc036_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Given is an integer $S$. Find a combination of six integers $X_1,Y_1,X_2,Y_2,X_3,$ and $Y_3$ that satisfies all of the following conditions:\n\n*   $0 \\leq X_1,Y_1,X_2,Y_2,X_3,Y_3 \\leq 10^9$\n*   The are...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments