square root of an integer.

  

Consider a sample space S consisting of all perfect squares starting from 1, 4, 9 and so on. You are given a number N, you have to output the number of integers less than N in the sample space S.

 

Example 1:

Input :
N = 9
Output:
2
Explanation:
1 and 4 are the only Perfect Squares
less than 9. So, the Output is 2.

Example 2:

Input :
N = 3
Output:
1
Explanation:
1 is the only Perfect Square
less than 3. So, the Output is 1.

Constraints:
1 <= N <= 108

Solution Hunt:

// Here we are giving the function only.

 

     int countSquares(int N) 
    {   long long c=0;
        
        for(long long i=1;i*i<N;i++)
        
       {
            if(i*i<N)
            c++;
        }
        
        return c;
        
    }