|All-time Popular Problems|
|Maximum difference between node and its ancestor|
|Delete a node from BST|
|K’th smallest element|
|Detect cycle in a directed graph|
|Element with left side smaller and right side greater|
|Sort The Array|
|Level order traversal Line by Line|
|Add two numbers represented by linked lists|
|Root to leaf path sum|
2 players A & B takes turns alternatively and play a game. The game is that they have N numbers on a paper. At any turn a player can replace one of the numbers by any of its factor ( except for 1 & itself ). The player who is unable to make a move looses the game. Find the winner of the game if A starts the game and both play optimally.
The first line has an integer T denoting the number of test cases.Then T test cases follow. The first line of each test case has an integer N denoting the number of numbers on the paper. The next line consists of N numbers.
For each test case print in a new line the winner, ie either A or B.
5 7 3
2 4 7 11
In the first case, the numbers cannot be replaced by any other number so A can not make a move and B is the winner.
In the second case, player A can replace 4 by 2 and thus the numbers left will be 2 2 7 & 11 and all are irreplacable and thus A is the winner.