A16227 | Short Sort
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
There are three cards with letters $\texttt{a}$ , $\texttt{b}$ , $\texttt{c}$ placed in a row in some order. You can do the following operation at most once:
- Pick two cards, and swap them.
Is it possible that the row becomes $\texttt{abc}$ after the operation? Output "YES" if it is possible, and "NO" otherwise.
- Pick two cards, and swap them.
Is it possible that the row becomes $\texttt{abc}$ after the operation? Output "YES" if it is possible, and "NO" otherwise.
输入格式
The first line contains a single integer $t$ ( $1 \leq t \leq 6$ ) — the number of test cases.
The only line of each test case contains a single string consisting of each of the three characters $\texttt{a}$ , $\texttt{b}$ , and $\texttt{c}$ exactly once, representing the cards.
The only line of each test case contains a single string consisting of each of the three characters $\texttt{a}$ , $\texttt{b}$ , and $\texttt{c}$ exactly once, representing the cards.
输出格式
For each test case, output "YES" if you can make the row $\texttt{abc}$ with at most one operation, or "NO" otherwise.
You can output the answer in any case (for example, the strings "yEs", "yes", "Yes" and "YES" will be recognized as a positive answer).
You can output the answer in any case (for example, the strings "yEs", "yes", "Yes" and "YES" will be recognized as a positive answer).
输入输出样例
输入 #1
6 abc acb bac bca cab cba
输出 #1
YES YES YES NO NO YES
In the first test case, we don't need to do any operations, since the row is already $\texttt{abc}$ .
In the second test case, we can swap $\texttt{c}$ and $\texttt{b}$ : $\texttt{acb} \to \texttt{abc}$ .
In the third test case, we can swap $\texttt{b}$ and $\texttt{a}$ : $\texttt{bac} \to \texttt{abc}$ .
In the fourth test case, it is impossible to make $\texttt{abc}$ using at most one operation.
In the second test case, we can swap $\texttt{c}$ and $\texttt{b}$ : $\texttt{acb} \to \texttt{abc}$ .
In the third test case, we can swap $\texttt{b}$ and $\texttt{a}$ : $\texttt{bac} \to \texttt{abc}$ .
In the fourth test case, it is impossible to make $\texttt{abc}$ using at most one operation.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted