Question

count the number of square integers between a and b

Answer 1

Answer:

here's ur answer mate

// A Simple Method to count squares between a and b

#include <bits/stdc++.h>

using namespace std;

int countSquares(int a, int b)

{

int cnt = 0; // Initialize result

// Traverse through all numbers

for (int i = a; i <= b; i++)

// Check if current number 'i' is perfect

// square

for (int j = 1; j * j <= i; j++)

if (j * j == i)

cnt++;

return cnt;

}