Sir, could you please give me an idea to solve this problem. also add how do you think of that approach.
thanks.
Unable to find an approch to solve this question
@raghurajj hey,first calculate total powers of all prime number in array. For example - in array [3 18 2 2] total powers of 2 will be 3 and powers of 3 will be 3. Now let me try to relate this problem with a classical game theory problem.
Let prime numbers are piles of stones and their total prime powers in array are equivalent to respective piles size. Now this has become a problem where two players are playing optimally and they reduce every pile to size 0. The last player unable to move loses.
I suggest you to read over internet about NIM game.
yeah got it sir…thanks!!