From bdfe75ef8a7be289657d53e38f18439d1cd876e1 Mon Sep 17 00:00:00 2001 From: Reiner Herrmann Date: Thu, 1 Dec 2011 16:31:43 +0100 Subject: solved projecteuler 125 --- src/projecteuler/125.py | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 src/projecteuler/125.py diff --git a/src/projecteuler/125.py b/src/projecteuler/125.py new file mode 100644 index 0000000..35dae6b --- /dev/null +++ b/src/projecteuler/125.py @@ -0,0 +1,22 @@ + +limit = 10**8 + +squares = [ x*x for x in xrange(1, 7200) ] + +def is_palindrome(n): + nstr = str(n) + return nstr == nstr[::-1] + + +palindromes = set() + +for i in xrange(len(squares)-1): # iterate over all starting positions + for j in xrange(2, len(squares)): # iterate over all possible lengths + sqrsum = sum(squares[i:i+j]) + if sqrsum >= limit: + break + if is_palindrome(sqrsum): + palindromes.add(sqrsum) + +print sum(palindromes) + -- cgit v1.2.3