Coloring Colorfully

AtCoder

IDabc124_c

Time2000ms

Memory256MB

Difficulty—

$N$ tiles are arranged in a row from left to right. The initial color of each tile is represented by a string $S$ of length $N$. The $i$\-th tile from the left is painted black if the $i$\-th character of $S$ is `0`, and painted white if that character is `1`. You want to repaint some of the tiles black or white, so that any two adjacent tiles have different colors. At least how many tiles need to be repainted to satisfy the condition? ## Constraints * $1 \leq |S| \leq 10^5$ * $S_i$ is `0` or `1`. ## Input Input is given from Standard Input in the following format: $S$ [samples]

Samples

Input #1

Output #1

1

The condition can be satisfied by repainting the middle tile white.

Input #2

10010010

Output #2

Input #3

Output #3

API Response (JSON)

{
  "problem": {
    "name": "Coloring Colorfully",
    "description": {
      "content": "$N$ tiles are arranged in a row from left to right. The initial color of each tile is represented by a string $S$ of length $N$. The $i$\\-th tile from the left is painted black if the $i$\\-th characte",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc124_c"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "$N$ tiles are arranged in a row from left to right. The initial color of each tile is represented by a string $S$ of length $N$.\nThe $i$\\-th tile from the left is painted black if the $i$\\-th characte...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments