Codeforces 639div2 A

Codeforces 639 div2 A

原题

连接在这

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).

ACcodes

#include 
using namespace std;
const int N = 1e5+10;
int test = 1;
int n,m,a[N];

int main()
{
	scanf("%d",&test);
	while(test--)
	{
		cin >> n >> m;
		if((n>=3 && m!=1) || (m>=3 && n!=1))
			cout << "NO" << endl;
		else
			cout << "YES" << endl;

	}
	return 0;
}