Placing Marbles

AtCoder

IDabc081_a

Time2000ms

Memory256MB

Difficulty—

Snuke has a grid consisting of three squares numbered $1$, $2$ and $3$. In each square, either `0` or `1` is written. The number written in Square $i$ is $s_i$. Snuke will place a marble on each square that says `1`. Find the number of squares on which Snuke will place a marble. ## Constraints * Each of $s_1$, $s_2$ and $s_3$ is either `1` or `0`. ## Input Input is given from Standard Input in the following format: $s_{1}s_{2}s_{3}$ [samples]

Samples

Input #1

Output #1

2

*   A marble will be placed on Square $1$ and $3$.

Input #2

Output #2

0

*   No marble will be placed on any square.

API Response (JSON)

{
  "problem": {
    "name": "Placing Marbles",
    "description": {
      "content": "Snuke has a grid consisting of three squares numbered $1$, $2$ and $3$. In each square, either `0` or `1` is written. The number written in Square $i$ is $s_i$. Snuke will place a marble on each squar",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc081_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Snuke has a grid consisting of three squares numbered $1$, $2$ and $3$. In each square, either `0` or `1` is written. The number written in Square $i$ is $s_i$.\nSnuke will place a marble on each squar...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments