Codeforces 639div2 A

Luo_Xubo

于 2020-05-07 09:07:58 发布

阅读量284

点赞数 1

CC 4.0 BY-SA版权

分类专栏： Codeforces 文章标签：算法动态规划

本文链接：https://blog.csdn.net/Luo_Xubo/article/details/105965020

Codeforces 专栏收录该内容

38 篇文章

订阅专栏

本文详细解析了Codeforces639div2A题目，这是一个关于特殊拼图的问题，每块拼图有三个凸起和一个凹槽。文章探讨了通过旋转和平移拼图块来判断是否能解决拼图问题的方法。输入包含多个测试用例，每个用例由两个整数n和m组成，分别表示拼图的行数和列数。输出为每个测试用例的解决方案，如果可以解决拼图则输出“YES”，否则输出“NO”。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 <bits/stdc++.h>
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;
}