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.
Find the sum of all the multiples of 3 or 5 below 1000.
Code
#include <iostream>
using namespace std;
bool isMultipleOfN(int num, int n)
{
return num % n == 0 ? true : false;
}
int main()
{
int max = 1000;
long sum = 0;
for (int i = 0; i != max; i++)
{
if (isMultipleOfN(i, 3))
{
sum += i;
}
else if (isMultipleOfN(i, 5))
{
sum += i;
}
}
cout << sum << endl;
}