We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Game Theory
  4. A Chessboard Game
  5. Discussions

A Chessboard Game

  • Haseena_CSE
     + 2 comments

    My C solution with O(1) time complexity

    #include<stdio.h>
int main()
{
	int t,x,y;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&x,&y);
		x=x%4;
		y=y%4;
		if((x==0) || (x==3) || (y==0) || (y==3))
			printf("First\n");
		else
			printf("Second\n");
			
	}
	return 0;
}