Subarray Sum

AtCoder

IDkeyence2020_c

Time2000ms

Memory256MB

Difficulty—

Given are three integers $N$, $K$, and $S$. Find a sequence $A_1, A_2, ..., A_N$ of $N$ integers between $1$ and $10^9$ (inclusive) that satisfies the condition below. We can prove that, under the conditions in Constraints, such a sequence always exists. * There are exactly $K$ pairs $(l, r)$ of integers such that $1 \leq l \leq r \leq N$ and $A_l + A_{l + 1} + \cdots + A_r = S$. ## Constraints * $1 \leq N \leq 10^5$ * $0 \leq K \leq N$ * $1 \leq S \leq 10^9$ * All values in input are integers. ## Input Input is given from Standard Input in the following format: $N$ $K$ $S$ [samples]

Samples

Input #1

4 2 3

Output #1

1 2 3 4

Two pairs $(l, r) = (1, 2)$ and $(3, 3)$ satisfy the condition in the statement.

Input #2

5 3 100

Output #2

50 50 50 30 70

API Response (JSON)

{
  "problem": {
    "name": "Subarray Sum",
    "description": {
      "content": "Given are three integers $N$, $K$, and $S$. Find a sequence $A_1, A_2, ..., A_N$ of $N$ integers between $1$ and $10^9$ (inclusive) that satisfies the condition below. We can prove that, under the con",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "keyence2020_c"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Given are three integers $N$, $K$, and $S$.\nFind a sequence $A_1, A_2, ..., A_N$ of $N$ integers between $1$ and $10^9$ (inclusive) that satisfies the condition below. We can prove that, under the con...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments