Accepted...?

AtCoder

IDtenka1_2017_a

Time2000ms

Memory256MB

Difficulty—

Snuke prepared $6$ problems for a upcoming programming contest. For each of those problems, Rng judged whether it can be used in the contest or not. You are given a string $S$ of length $6$. If the $i$\-th character of $s$ is `1`, it means that the $i$\-th problem prepared by Snuke is accepted to be used; `0` means that the problem is not accepted. How many problems prepared by Snuke are accepted to be used in the contest? ## Constraints * The length of $S$ is $6$. * $S$ consists of `0` and `1`. ## Inputs Input is given from Standard Input in the following format: $S$ [samples]

Samples

Input #1

Output #1

4

The first, second, third and fourth problems are accepted, for a total of four.

Input #2

Output #2

Input #3

Output #3

API Response (JSON)

{
  "problem": {
    "name": "Accepted...?",
    "description": {
      "content": "Snuke prepared $6$ problems for a upcoming programming contest. For each of those problems, Rng judged whether it can be used in the contest or not. You are given a string $S$ of length $6$. If the $i",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "tenka1_2017_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Snuke prepared $6$ problems for a upcoming programming contest. For each of those problems, Rng judged whether it can be used in the contest or not.\nYou are given a string $S$ of length $6$. If the $i...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments