Base 2

AtCoder

IDabc306_b

Time2000ms

Memory256MB

Difficulty—

You are given a sequence $A=(A_0,A_1,\dots,A_{63})$ of length $64$ consisting of $0$ and $1$. Find $A_0 2^0 + A_1 2^1 + \dots + A_{63} 2^{63}$. ## Constraints * $A_i$ is $0$ or $1$. ## Input The input is given from Standard Input in the following format: $A_0$ $A_1$ $\dots$ $A_{63}$ [samples]

Samples

Input #1

1 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

Output #1

13

$A_0 2^0 + A_1 2^1 + \dots + A_{63} 2^{63} = 2^0 + 2^2 + 2^3 = 13$.

Input #2

1 0 1 0 1 0 0 0 0 1 0 0 1 1 0 1 1 1 1 0 0 0 1 0 0 1 1 1 1 1 1 0 0 0 0 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 0 0 0 1 0 1 0 1 0 1 0 0 0 0

Output #2

766067858140017173

API Response (JSON)

{
  "problem": {
    "name": "Base 2",
    "description": {
      "content": "You are given a sequence $A=(A_0,A_1,\\dots,A_{63})$ of length $64$ consisting of $0$ and $1$. Find $A_0 2^0 + A_1 2^1 + \\dots + A_{63} 2^{63}$.",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc306_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "You are given a sequence $A=(A_0,A_1,\\dots,A_{63})$ of length $64$ consisting of $0$ and $1$.\nFind $A_0 2^0 + A_1 2^1 + \\dots + A_{63} 2^{63}$.\n\n## Constraints\n\n*   $A_i$ is $0$ or $1$.\n\n## Input\n\nThe...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments