摘要："A. Orac and Factors" 一个偶数每次操作后都会加2，一个奇数第一次操作后会变成偶数 代码 pragma GCC optimize(2) include include include include include include include include include 阅读全文

摘要："A. Puzzle Pieces" 首先只有一行或只有一列是可以拼出来的。之后可以猜出剩下的情况只有2x2可以，拼图只有一条边凹进去，构造过程中不难发现这一点。比较简单的写法是判断m+n =mn 代码 pragma GCC optimize(2) include include include i 阅读全文