codeforces1438C Engineer Artem

https://codeforces.com/contest/1438/problem/C

构造题一生之敌

一条斜线奇数，一条斜线偶数，相邻的一定就不一样了

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

const int maxl=210;

int n,m,cnt,tot,cas,ans;
int a[maxl][maxl],b[maxl][maxl];

inline void prework()
{
	scanf("%d%d",&n,&m);tot=0;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
		{	
			scanf("%d",&a[i][j]);
			if((i+j)&1)
				b[i][j]=a[i][j]+(a[i][j]&1);
			else
				b[i][j]=a[i][j]+((a[i][j]&1)^1);
		}
}

inline void mainwork()
{
}

inline void print()
{
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			printf("%d%c",b[i][j]," \n"[j==m]);
}

int main()
{
	int t=1;
	scanf("%d",&t);
	for(cas=1;cas<=t;cas++)
	{
		prework();
		mainwork();
		print();
	}
	return 0;
}