A9508 | Kolya and Tandem Repeat
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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.
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.
输入格式
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.
输出格式
Print a single number — the maximum length of the tandem repeat that could have occurred in the new string.
输入输出样例
输入 #1
aaba 2
输出 #1
6
输入 #2
aaabbbb 2
输出 #2
6
输入 #3
abracadabra 10
输出 #3
20
A tandem repeat of length $2n$ is string $s$ , where for any position $i$ ( $1<=i<=n$ ) the following condition fulfills: $s_{i}=s_{i+n}$ .
In the first sample Kolya could obtain a string aabaab, in the second — aaabbbbbb, in the third — abracadabrabracadabra.
In the first sample Kolya could obtain a string aabaab, in the second — aaabbbbbb, in the third — abracadabrabracadabra.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted