L. Scientist Ayoub (B)

Codeforces

IDCF10203L

Time1000ms

Memory256MB

Difficulty—

English · Original

Formal · Original

After long researches on rabbits Ayoub got very tired, dealing with rabbits is really hard, also testing every subset of rabbits takes lots of time. After some tests Ayoub saw that he doesn't need to test every subset of rabbits, but he need only to test every subarray of rabbits, this way he can test even more rabbits right? Anyway, Ayoub needs also to give every subarray of rabbits a unique number. He will do the same thing, which is giving every rabbit a value and the number of the subarray will be the sum of values of rabbits in the subarray. Once again, Ayoub asked Kilani to do it and he couldn't, so he gave the problem to you. Given the number of rabbits $n$, you should give every rabbit a number so that every sub-array has a unique sum, and the numbers are between $1$ and $10^9$. the input will contain only one integer $n$ $(1 <= n <= 1000)$ which is the number of rabbits. You should print $n$ separated integers, the $i_{t h}$ one should be the number given to the $i_{t h}$ rabbit. Every number should be between $1$ and $10^9$, and every subarray should have a unique sum. *Alert!!! This problem is related to the previous problem.* ## Input the input will contain only one integer $n$ $(1 <= n <= 1000)$ which is the number of rabbits. ## Output You should print $n$ separated integers, the $i_(t h)$ one should be the number given to the $i_(t h)$ rabbit.Every number should be between $1$ and $10^9$, and every subarray should have a unique sum. [samples] ## Note *Alert!!! This problem is related to the previous problem.*

Let $ n \in \mathbb{Z} $ with $ 1 \leq n \leq 1000 $. Assign to the $ i $-th rabbit the value $ a_i = 2^{i-1} $ for $ i = 1, 2, \dots, n $. **Output:** $ a_1, a_2, \dots, a_n $ where $ a_i = 2^{i-1} $.

API Response (JSON)

{
  "problem": {
    "name": "L. Scientist Ayoub (B)",
    "description": {
      "content": "After long researches on rabbits Ayoub got very tired, dealing with rabbits is really hard, also testing every subset of rabbits takes lots of time. After some tests Ayoub saw that he doesn't need to",
      "description_type": "Markdown"
    },
    "platform": "Codeforces",
    "limit": {
      "time_limit": 1000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "CF10203L"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "After long researches on rabbits Ayoub got very tired, dealing with rabbits is really hard, also testing every subset of rabbits takes lots of time.\n\nAfter some tests Ayoub saw that he doesn't need to...",
      "is_translate": false,
      "language": "English"
    },
    {
      "statement_type": "Markdown",
      "content": "Let $ n \\in \\mathbb{Z} $ with $ 1 \\leq n \\leq 1000 $.  \nAssign to the $ i $-th rabbit the value $ a_i = 2^{i-1} $ for $ i = 1, 2, \\dots, n $.  \n\n**Output:** $ a_1, a_2, \\dots, a_n $ where $ a_i = 2^{i...",
      "is_translate": false,
      "language": "Formal"
    }
  ]
}

Full JSON Raw Segments