It has been fascinating to watch you wrestle with this problem. If the
obvious solution has not yet occurred to you, may I suggest that you turn
the problem upside down, and then laugh at its simplicity.

It is very difficult and time consuming to find squares using the sqrt()
function. It is much easier to create them from plain old integers like
this:-

#include 
#include 
int main (void)
{   int n;
    for (n=0; n * Origin: Escan BBS (2:25/200)

SEEN-BY: 633/267 270

@PATH: 25/200 108 252/110 250/501 140/1 106/2000 633/267