visual fixes

problem-125/125.py

@@ -1,19 +1,17 @@
 from math import *
 
 def palindrome( s ):
-    return str( s )[ ::-1 ] == str( s )
+    return s[ ::-1 ] == s
 
 seen = {}
-ret = 0
 N = pow( 10, 8 )
 sqrtN = int( sqrt( N ) )
 for i in xrange( 1, sqrtN ):
     s = i * i
     for j in xrange( i + 1, sqrtN ):
-        s = s + j * j
+        s += j * j
         if s > N:
             break
-        if palindrome( s ) and s not in seen:
+        if palindrome( str( s ) ):
             seen[ s ] = True
-            ret = ret + s
-print ret
+print sum( iter( seen ) )