Snippets created by Eugene Gavrin
This snippet is code that solves first Project Euler problem. It finds the sum of all the multiples of 3 or 5 below 1000. Please add other (more efficient, succinct or interesting) solutions to this snippet.
1 people like this
Like the snippet!
Posted: 6 months ago by