Function to count integers upto k which are having perfect squares as factors . i is index of next prime number whose square needs to be checked . curr is current number whos square to be checked .
long long countSquares ( long long i , long long cur , long long k , vector < long long > & a ) {