Split the square at different poitns and see if sum of any pair of splitted numbers is equal to n .
for ( int r_digits = 1 ; r_digits < count_digits ; r_digits ++ ) { int eq_parts = pow ( 10 , r_digits ) ;