TRIOMINO  Triomino Game
English  Vietnamese 
X and Y are playing the following game: They start with an empty 2xN board and move alternately. X moves first. In a move, a player must place an Ltriomino (shown on the right), in any of the 4 possible orientations, on the board. The piece placed must not overlap with a piece that has already been placed. The player that is unable to make a valid move loses.
Given the size of the board, find out who will win the game assuming that both X and Y play optimally
Input
Input consists of multiple testcases. The first line contains a single integer T, the number of test cases. (T<=50)
Each testcase consists of a single line containing a single integer N, the size of the board. (N<=800)
Output
For each testcase, output a single line containing "X" or "Y" depending on who wins that game.
Example
Input: 2 3 4 Output: X Y
hide comments
Tahsin:
20160317 18:31:36
the image is not visible :/


laurfan:
20141225 22:40:00
the board dimension is alwys 2xN (can only has 2 rows)? Last edit: 20141225 22:50:26 

Akshay Jaggi:
20130419 11:54:35
Can I place the Ltriomino anywhere on the board, or it must be just placed next to a already placed one?

Added by:  Race with time 
Date:  20080831 
Time limit:  0.790s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  Byte Code 