A15898 | Love Story
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Timur loves codeforces. That's why he has a string $s$ having length $10$ made containing only lowercase Latin letters. Timur wants to know how many indices string $s$ differs from the string "codeforces".
For example string $s =$ "coolforsez" differs from "codeforces" in $4$ indices, shown in bold.
Help Timur by finding the number of indices where string $s$ differs from "codeforces".
Note that you can't reorder the characters in the string $s$ .
For example string $s =$ "coolforsez" differs from "codeforces" in $4$ indices, shown in bold.
Help Timur by finding the number of indices where string $s$ differs from "codeforces".
Note that you can't reorder the characters in the string $s$ .
输入格式
The first line contains a single integer $t$ ( $1 \leq t \leq 1000$ ) — the number of test cases.
Each test case is one line and contains the string $s$ , consisting of exactly $10$ lowercase Latin characters.
Each test case is one line and contains the string $s$ , consisting of exactly $10$ lowercase Latin characters.
输出格式
For each test case, output a single integer — the number of indices where string $s$ differs.
输入输出样例
输入 #1
5 coolforsez cadafurcie codeforces paiuforces forcescode
输出 #1
4 5 0 4 9
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted