Snippets created by Eugene Gavrin

  • Project Euler #1

    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.

    3 people like this

    Posted: 1 year ago by Eugene Gavrin