Chess Rook - NDDCoder

#include<iostream>

using namespace std;

int n;
int board[4][4];
int maxscore;
int visited[4][4];

void tang(int r, int c){
	int tmp1=c, tmp2=c;
	// danh dau het phia ben trai cua hang cho den khi gap X
	while (tmp1>=0 && !board[r][tmp1]) visited[r][tmp1--]++;
	// danh dau phia ben phai
	while (tmp2<n && !board[r][tmp2]) visited[r][tmp2++]++;
	tmp1=r; tmp2=r;
	// danh dau phia tren
	while (tmp1>=0 && !board[tmp1][c]) visited[tmp1--][c]++;
	// danh dau phia duoi
	while (tmp2<n && !board[tmp2][c]) visited[tmp2++][c]++;
}

void giam(int r, int c){
	int tmp1=c, tmp2=c;
	// danh dau het phia ben trai cua hang cho den khi gap X
	while (tmp1>=0 && !board[r][tmp1]) visited[r][tmp1--]--;
	// danh dau phia ben phai
	while (tmp2<n && !board[r][tmp2]) visited[r][tmp2++]--;
	tmp1=r; tmp2=r;
	// danh dau phia tren
	while (tmp1>=0 && !board[tmp1][c]) visited[tmp1--][c]--;
	// danh dau phia duoi
	while (tmp2<n && !board[tmp2][c]) visited[tmp2++][c]--;
}

void Try(int score){
	if (score>maxscore) maxscore=score;
	for (int i=0;i<n;i++){
		for (int j=0;j<n;j++){
			if (!board[i][j] && !visited[i][j]){
				tang(i,j);
				Try(score+1);
				giam(i,j);
			}
		}
	}
}

int main(){
	ios::sync_with_stdio(false);
	freopen("ChessRock.txt","r",stdin);
	int T;
	cin>>T;
	for (int tc=1;tc<=T;tc++){
		cout<<"Case #"<<tc<<endl;
		cin>>n;
		for (int i=0;i<n;i++){
			for (int j=0;j<n;j++){
				char tmp;
				cin>>tmp;
				if (tmp=='.') board[i][j]=0;
				else if (tmp=='X') board[i][j]=1;
//				cout<<board[i][j];
			}
//			cout<<endl;
		}
		maxscore=0;
		for (int i=0;i<n;i++){
			for (int j=0;j<n;j++){
				visited[i][j]=0;
			}
		}
		Try(0);
		cout<<maxscore<<endl;
	}
}