Question:
U need to return the maximum number of pairs the array can be divided into such that the product of the two numbers (from the pair) is not a perfect square. U can change at max k numbers from the array into any other number (need not be on the list- just any random number)

Input:
Array (of +ve integers & size< 10^5) , int k

Output:
Return the maximum number of pairs the array can be divided into such that the product of the two numbers is not a perfect square.