Problem 01

This is a C++ solution to Project Euler problem 01 found at: https://projecteuler.net/problem=1

My Algorithm

For this problem, we need to find the sum of all the multiples of 3 or 5 below 1000. To do this, we can simply loop through all the numbers from 1000 to 1 and find any multiples of 3 or 5 by using the modulus operation. If a multiple is found, we can then add it to a running sum, which will then be returned to give us our answer of 233168.

Problem 01 GitHub

Full Solution on GitHub

Problem 01 Solution