Educational Codeforces Round 136 (Rated for Div. 2) 补题题解 (A)

Source

Educational Codeforces Round 136 Rated for Div. 2


本来计划着打这场的,快开始了,咳咳某人喊我打王者,没打成比赛,纯补题

A Immobile Knight

简单模拟,只有几种情况下会有孤立的点,单列出来即可

#include<bits/stdc++.h>

using namespace std;

#define db double

const int N = 2e5 + 10;

int T;
int n, m; 

void solve(){
    
      
	cin>>n>>m;
	if(n == 1 || m == 1 || (n == 2 && m == 2)) cout<<"1 1"<<endl;\
	else if(n == 2 && m == 3) cout<<"1 2"<<endl;
	else if(n == 3 && m == 2) cout<<"2 1"<<endl;
	else if(n == 3 && m == 3) cout<<"2 2"<<endl;
	else cout<<"1 1"<<endl;
}

int main()
{
    
      
	cin>>T;
	while(T -- ){
    
      
		solve();
	}
	return 0;
}