{"id":2345,"date":"2020-07-29T07:34:20","date_gmt":"2020-07-29T07:34:20","guid":{"rendered":"https:\/\/blog.prepbytes.com\/?p=2345"},"modified":"2022-06-17T07:13:04","modified_gmt":"2022-06-17T07:13:04","slug":"play-games-4","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/play-games-4\/","title":{"rendered":"Play Games 4"},"content":{"rendered":"

\"\"<\/p>\n

CONCEPTS USED:<\/h3>\n
\n

Game theory<\/p>\n<\/blockquote>\n

DIFFICULTY LEVEL:<\/h3>\n
\n

Medium.<\/p>\n<\/blockquote>\n

PROBLEM STATEMENT(SIMPLIFIED):<\/h3>\n
\n

Arnab wants to play games with his friend. Now this time Arnab made an array of integers that represent the piles of chocolates. So in each turn, a player can choose only one pile and remove any number of chocolates (greater than or equal to one) from that pile. The player who cannot make a move loses the game. Arnab takes the first move. Both players play optimally.<\/p>\n<\/blockquote>\n

<\/strong><\/u><\/a><\/p>\n

For Example :<\/h4>\n
Input\n1\n5 \n1 2 3 4 5 \n\nOutput\nArnab<\/code><\/pre>\n
OBSERVATION:<\/h3>\n
\n
Take the xor of all the numbers given.<\/p>\n
If the xor comes out to be 0,then the friend wins.<\/p>\n
If it is not zero,then Arnab wins.<\/p>\n<\/blockquote>\n
SOLUTION:<\/h3>\n
\t\t\t\t\t\t