A10458 | Simple Strings
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
zscoder loves simple strings! A string $t$ is called simple if every pair of adjacent characters are distinct. For example ab, aba, zscoder are simple whereas aa, add are not simple.
zscoder is given a string $s$ . He wants to change a minimum number of characters so that the string $s$ becomes simple. Help him with this task!
zscoder is given a string $s$ . He wants to change a minimum number of characters so that the string $s$ becomes simple. Help him with this task!
输入格式
The only line contains the string $s$ ( $1<=|s|<=2·10^{5}$ ) — the string given to zscoder. The string $s$ consists of only lowercase English letters.
输出格式
Print the simple string $s'$ — the string $s$ after the minimal number of changes. If there are multiple solutions, you may output any of them.
Note that the string $s'$ should also consist of only lowercase English letters.
Note that the string $s'$ should also consist of only lowercase English letters.
输入输出样例
输入 #1
aab
输出 #1
bab
输入 #2
caaab
输出 #2
cabab
输入 #3
zscoder
输出 #3
zscoder
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted