#639 (Div. 2)A. Puzzle Pieces

题目描述

You are given a special jigsaw puzzle consisting of n⋅m identical pieces. Every piece has three tabs and one blank, as pictured below.

The jigsaw puzzle is considered solved if the following conditions hold:
The pieces are arranged into a grid with n rows and m columns.
For any two pieces that share an edge in the grid, a tab of one piece fits perfectly into a blank of the other piece.
Through rotation and translation of the pieces, determine if it is possible to solve the jigsaw puzzle.

Input

The test consists of multiple test cases. The first line contains a single integer t (1≤t≤1000) — the number of test cases. Next t lines contain descriptions of test cases.
Each test case contains two integers n and m (1≤n,m≤105).

Output

For each test case output a single line containing “YES” if it is possible to solve the jigsaw puzzle, or “NO” otherwise. You can print each letter in any case (upper or lower).

Example

input
3
1 3
100000 100000
2 2
output
YES
NO
YES

Note

For the first test case, this is an example solution:

For the second test case, we can show that no solution exists.
For the third test case, this is an example solution:

题目大意：

你有一些如图所示的拼图，将这些拼图拼成n*m的矩形。问是否可以拼成。

题目分析：

根据样例1，我们可以发现：只有一行或一列的拼图组合是可以做到无限长的。
根据样例3，大于一行或一列的拼图组合只能存在2*2样式的（原因如图）。
所以，做一个简单的判断就行了。

代码如下

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <map>
#include <queue>
#include <vector>
#include <algorithm>
#include <iomanip>
#define LL long long
using namespace std;
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		int n,m;
		cin>>n>>m;
		if(n==1||m==1) puts("YES");
		else if(n==2&&m==2) puts("YES");
		else puts("NO");
	}
    return 0;
}