//Note: This is ONLY THE SECOND PART of the function.

int matchFound=0;
int i=1;

while (i*i <= t) {
	if (i*i == t) matchFound=1;
	i++;
	}

return matchFound;