A. Apples and Oranges

Codeforces

IDCF10289A

Time1000ms

Memory512MB

Difficulty—

English · Original

Formal · Original

It is lunch time in Kiyosumi High School. As usual, the principal prepared apples and oranges for everyone. There are $k$ students in the school, and each of them has at most 1 apple and at most 1 orange. A pair of people can share their food with each other, if and only if the total count of their apples and their oranges are both even. The principal has told you that: The $i$-th student has $a_i$ apples and $o_i$ oranges. Consider the multiset $S$ of pairs defined as $S = {(a_1, o_1), (a_2, o_2), \\dots, (a_k, o_k)}$. Given $n$ and that what the principal said is true, how many different multisets can be constructed this way? The input contains an integer $n$ ($0 <= n <= 10^(18)$). Print one integer, the number of different multisets that can be constructed. In example 1, the only possible multiset is ${(0, 0), (0, 1), (1, 0), (1, 1)}$. In example 2, ${(0, 1), (1, 1), (0, 1), (0, 0), (1, 1), (1, 0)}$ is a possible multiset. ## Input The input contains an integer $n$ ($0 <= n <= 10^(18)$). ## Output Print one integer, the number of different multisets that can be constructed. [samples] ## Scoring Subtask 1 (31 points): $n <= 10^6$ Subtask 2 (23 points): $n <= 10^(12)$ Subtask 3 (46 points): No additional constraints ## Note In example 1, the only possible multiset is ${(0, 0), (0, 1), (1, 0), (1, 1)}$.In example 2, ${(0, 1), (1, 1), (0, 1), (0, 0), (1, 1), (1, 0)}$ is a possible multiset.

"pig"

API Response (JSON)

{
  "problem": {
    "name": "A. Apples and Oranges",
    "description": {
      "content": "It is lunch time in Kiyosumi High School. As usual, the principal prepared apples and oranges for everyone. There are $k$ students in the school, and each of them has at most 1 apple and at most 1 ora",
      "description_type": "Markdown"
    },
    "platform": "Codeforces",
    "limit": {
      "time_limit": 1000,
      "memory_limit": 524288
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "CF10289A"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "It is lunch time in Kiyosumi High School. As usual, the principal prepared apples and oranges for everyone. There are $k$ students in the school, and each of them has at most 1 apple and at most 1 ora...",
      "is_translate": false,
      "language": "English"
    },
    {
      "statement_type": "Markdown",
      "content": "\"pig\"...",
      "is_translate": false,
      "language": "Formal"
    }
  ]
}

Full JSON Raw Segments