#include <queue> #include <cstdio> #include <vector> using namespace std; struct State { int x,y; int count; State() { count = 0; x = 0; y = 0; } }; int moves[8][2] = {{2, 1}, {1, 2}, {-1, 2}, {-2,1}, {-2, -1}, {-1, -2...

#include <bits/stdc++.h> using namespace std; int main(){ int n,m; while(cin>>n>>m){ if(n==1&&m==1)puts("Y"); else if(n==1||m==1)puts("N"); else if(n%2&&m%2)puts("N"); else puts("Y"); } return 0; }  

#include<iostream> #include<algorithm> #include<string.h> using namespace std; int flag[10][10]; int N, M, total, res; int locX[4] = {1,-1,0,0}; int locY[4] = {0,0,1,-1}; void DFS(int n, int m, int cnt){     if(res == 1) return;     if(c...