Codeforces Round #639 (Div. 2)
(做了有蛮久的CF了,但是就懒得写博客)
(写个水题练练markdown咯)
A.Puzzle PiecesA
- 题意:给你n排m列个拼图块,每个拼图块长成题目给你的那个样子。判断是否能够相互嵌合。
- 思路:我完全可以认为,单排必可以达成题目条件,而多排仅仅是2x2的情况下可以达成条件。
#include<cassert>
#include<string>
#include<cmath>
#include<cstring>
#include<stack>
#include<iostream>
#include<map>
#include<set>
#include<algorithm>
#include<vector>
#include<cstdlib>
#pragma warning(disable:4996)
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f
#define itn int
#define ll long long
#define mes(a,k) memset(a,k,sizeof(a))
//#define max(a,b) a>b?a:b
//#define min(a,b) a<b?a:b
#define eps 1e-8
//#define pb(a) push_back(a)
using namespace std;
const int N = 2e5 + 5;
using namespace std;
int T, x, y;
void io()
{
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
}
int main() {
io();
cin >> T;
while (T--) {
cin >> x >> y;
if (x == 1 || y == 1 || (x == 2 && y == 2))
cout << "YES" << endl;
else
cout << "NO" << endl;
}
return 0;
}