Shrinking

AtCoder

IDagc016_a

Time2000ms

Memory256MB

Difficulty—

Snuke can change a string $t$ of length $N$ into a string $t'$ of length $N - 1$ under the following rule: * For each $i$ ($1 ≤ i ≤ N - 1$), the $i$\-th character of $t'$ must be either the $i$\-th or $(i + 1)$\-th character of $t$. There is a string $s$ consisting of lowercase English letters. Snuke's objective is to apply the above operation to $s$ repeatedly so that all the characters in $s$ are the same. Find the minimum necessary number of operations. ## Constraints * $1 ≤ |s| ≤ 100$ * $s$ consists of lowercase English letters. ## Input Input is given from Standard Input in the following format: $s$ [samples]

Samples

Input #1

serval

Output #1

3

One solution is: `serval` → `srvvl` → `svvv` → `vvv`.

Input #2

jackal

Output #2

2

One solution is: `jackal` → `aacaa` → `aaaa`.

Input #3

zzz

Output #3

0

All the characters in $s$ are the same from the beginning.

Input #4

whbrjpjyhsrywlqjxdbrbaomnw

Output #4

8

In $8$ operations, he can change $s$ to `rrrrrrrrrrrrrrrrrr`.

API Response (JSON)

{
  "problem": {
    "name": "Shrinking",
    "description": {
      "content": "Snuke can change a string $t$ of length $N$ into a string $t'$ of length $N - 1$ under the following rule: *   For each $i$ ($1 ≤ i ≤ N - 1$), the $i$\\-th character of $t'$ must be either the $i$\\-th",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "agc016_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Snuke can change a string $t$ of length $N$ into a string $t'$ of length $N - 1$ under the following rule:\n\n*   For each $i$ ($1 ≤ i ≤ N - 1$), the $i$\\-th character of $t'$ must be either the $i$\\-th...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments