Codeforces Round #553 (Div. 2) B

枚举 

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=1e5+5;

int mp[505][505],n,m,ans;
int main(int argc, char const *argv[])
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++) scanf("%d",&mp[i][j]);
		ans^=mp[i][1];	
	}
	if(ans)
	{
		cout<<"TAK"<<endl;
		for(int i=1;i<=n;i++) cout<<1<<" ";
		cout<<endl;exit(0);
	}
	for(int i=1;i<=n;i++)
		for(int j=2;j<=m;j++)
		{
			ans ^= mp[i][j-1] ^ mp[i][j];
			if(ans)
			{
				cout<<"TAK"<<endl;
				for(int k=1;k<i;k++) cout<<1<<" ";
				cout<<j<<" ";
			    for(int k=i+1;k<=n;k++) cout<<1<<" ";
			    exit(0);
			}
		}
	cout<<"NIE"<<endl;
	return 0;
}