This is my python solution to the first problem on Project Euler:
n = 1 rn = 0 while n < 1000: if n%3 == 0 or n%5 == 0: rn += n n = n + 1 print(rn)
I would like to find a way to keep everything in this python code to as little number of lines as possible (maybe even a one liner??), and possibly improve the speed (it's currently around 12 ms). By the way, this is the problem:
If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.Suggestions?
Find the sum of all the multiples of 3 or 5 below 1000.