輸出格式
如果無法偽造目標碼 $t$，請輸出一行 NO。
否則，請輸出 YES。在下一行輸出一個整數 $m$（$0 \le m \le 10^5$），表示你將使用的操作總數。然後輸出 $m$ 行，按順序描述你的操作：
1 x：選擇索引為 $x$ 的現有碼，並執行相位反轉（附加 $x$ 的位元反轉）；2 x y z：選擇索引為 $x$、$y$、$z$ 的現有碼，並執行訊號三角定位（附加 $x$、$y$、$z$ 這三個現有字串的 $\operatorname{maj}$）。
QOJ.ac
QOJ
Time Limit: 1 s
Memory Limit: 1024 MB
Total points: 100
Hackable ✓
#18518. 真實的民謠藍調
Statistics
The problem was used in the following contests:
AI Translation —
This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.
Discussions
About Discussions
The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
Open Discussions 0
No discussions in this category.
Issues
About Issues
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines:
- This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
- Do not submit duplicated issues.
- Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.