| Author: | A. Baranov | Time limit: | 1 sec | |
| Input file: | Standard input | Memory limit: | 256 Mb | |
| Output file: | Standard output |
Let us consider a character sequence S consisting of digits and lowercase Latin letters.
It is required to find a subsequence of S that has maximal length and consists of same character located at positions with a fixed step (that is, on equidistant positions).
If there are several solutions, choose any of them with the maximum step.
Input contains a single string S.
Output must contain index of the start position and step. Positions are numbered from zero.
If the subsequence has only one element, step must be zero.
0 < |S| ≤ 5000
| No. | Standard input | Standard output |
|---|---|---|
| 1 | |
|
| 2 | |
|