For this Question: The Dilmo game is a two-player game played on a rectangular grid of cells. Each cell can be claimed by either player, but once a player claims a cell, none of the cells in the same row or column can be claimed by either player. Players take turns claiming cells, and the game ends when neither player can make a move. The player who can't make a move loses. Alice and Bob decide to play the game. Given the initial state of the grid and the fact that Alice goes first, write a program to predict the winner of the game, assuming that both players play optimally.

Optimally means they choose the most strategic move at each turn to increase their chances of winning the game.The first line consists of two space-separated integers k and l, the number of rows and columns in the matrix.
The following k lines consist of l space-separated integers each either 0 or 1. 

<b>Constraints</b>
1 &le; k, l &le; 50Print Single string, Alice or Bob. (case sensitive ).Input:
2 2
0 0
0 0
Output:
Bob
Explanation :
One possible optimal case can be Alice choosing (1,1) now Bob can choose only (2,2). Alice didn't have any cells to choose from according to the given condition, therefore Bob wins., I have written this Solution Code: #include<bits/stdc++.h> 
using namespace std;
 
#define endl "\n"


const int N = 51;

int n, m;
int a[N][N];

int main()
{
	
	int t;
	t=1;
	while(t--)
	{
		cin >> n >> m;
		set< int > r, c;
		for(int i = 1; i <= n; i++)
		{
			for(int j = 1; j <= m; j++)
			{
				cin >> a[i][j];
				if(a[i][j] == 1)
					r.insert(i), c.insert(j);
			}
		} 
        int k=n-r.size();
        int l=m-c.size();
		int mn = min(k,l);
		if(mn % 2)
			cout << "Alice" << endl;
		else
			cout << "Bob" << endl;
	}
	return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?