Draw Grids

最新推荐文章于 2021-07-23 09:05:38 发布

Elicsyd

最新推荐文章于 2021-07-23 09:05:38 发布

阅读量133

点赞数

分类专栏：牛客多校

本文链接：https://blog.csdn.net/qq_49638570/article/details/118929267

版权

13 篇文章 0 订阅

订阅专栏

ZYT and LBC decided to play a game.

They will alternately do the following operation.

Pick 4 integers a,b,c,d(1≤a,c≤na,b,c,d(1\leq a,c \leq na,b,c,d(1≤a,c≤n and 1≤b,d≤m)\ 1\leq b,d \leq m) 1≤b,d≤m) , where ∣a−c∣+∣b−d∣=1{ |a-c|+|b-d|=1}∣a−c∣+∣b−d∣=1 , and draw a straight segment between point (a,b){(a,b)}(a,b) and point (c,d){(c,d)}(c,d). The segment shouldn't overlap with a segment that already exists.
In any time, the segments shouldn't form a polygon. That is, there exists no sequence of distinct points (x0,y0),(x1,y1),⋯,(xk−1,yk−1){(x_0,y_0),(x_1,y_1),⋯,(x_{k−1},y_{k−1})}(x0,y0),(x1,y1),⋯,(xk−1,yk−1) satisfying for each integer 0≤u<k0 \leq u < k0≤u<k，there is a segment between (xu,yu)(x_u,y_u)(xu,yu) and (x(u+1) mod k,y(u+1) mod k)(x_{ (u+1)\ \text{mod}\ k },y_{ (u+1)\ \text{mod}\ k })(x(u+1) mod k,y(u+1) mod k).

The player who can't perform an operation during his move loses.

Determine whether ZYT can win considering that both players play optimally and ZYT starts.

The input consists of one line containing two integers n{n}n and m{m}m.

Print "YES"(without quote) if ZYT can win and "NO"(without quote) if ZYT can't.

示例1

1 3

NO

示例2

2 2

YES

It is guaranteed that 1≤n,m≤41\le n,m\le 41≤n,m≤4.

题解

只要判断奇偶就可以

如果真的做的话就可以用搜索

因为数据不大

#include<iostream>
using namespace std;
int main()
{
	int n,m;
	cin>>n>>m;
	if(n%2==1&&m%2==1)
	{
		cout<<"NO"<<endl;
	}
	else
	cout<<"YES"<<endl;
}

关注

专栏目录