Monday, February 23, 2009

The Pythonic way!

With my earlier experience of Project Euler (I used to solve in Java), after being quite well conversant in Python, I just had a re-look. I was simply pleased by the compactness, doing it in the pythonic way achieved. The question is to find the sum of all numbers between 1 and 1000 that are divisible by either 3 or 5. Here is how simply, we can do it in python:
a=[i for i in xrange(1000) if not (i%3 and i%5)]
print sum(a)
blog comments powered by Disqus