Count number less than N which are product of perfect squares | C ++ program to count number less than N which are product of any two perfect squares ; Function to count number less than N which are product of any two perfect squares ; Driver program
#include <bits/stdc++.h> NEW_LINE using namespace std ; int countNumbers ( int N ) { return int ( sqrt ( N ) ) - 1 ; } int main ( ) { int N = 36 ; cout << countNumbers ( N ) ; return 0 ; }