ramitvakil/projecteuler — pull request #1 by ramitvakil (2014-08-18 18:04:49+00:00)
Title: Multiples of 3 and 5

This is the solution to problem number 1.

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.

Find the sum of all the multiples of 3 or 5 below 1000.

So here we loop through the values from 3 to 999(both inclusive) and add all the values that are either divisible by 3 or 5 and print the value.
Execution time =1 second.