Preparando MOJI

Kolya and Tandem Repeat

2000ms 262144K

Description:

Kolya got string s for his birthday, the string consists of small English letters. He immediately added k more characters to the right of the string.

Then Borya came and said that the new string contained a tandem repeat of length l as a substring. How large could l be?

See notes for definition of a tandem repeat.

Input:

The first line contains s (1 ≤ |s| ≤ 200). This string contains only small English letters. The second line contains number k (1 ≤ k ≤ 200) — the number of the added characters.

Output:

Print a single number — the maximum length of the tandem repeat that could have occurred in the new string.

Sample Input:

aaba
2

Sample Output:

6

Sample Input:

aaabbbb
2

Sample Output:

6

Sample Input:

abracadabra
10

Sample Output:

20

Note:

A tandem repeat of length 2n is string s, where for any position i (1 ≤ i ≤ n) the following condition fulfills: si = si + n.

In the first sample Kolya could obtain a string aabaab, in the second — aaabbbbbb, in the third — abracadabrabracadabra.

Informação

Codeforces

Provedor Codeforces

Código CF443B

Tags

brute forceimplementationstrings

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 08:52:19

Relacionados

Nada ainda