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.
#include <iostream>
#include <vector>
using namespace std;
//Multiples of 3 and 5
//Problem 1
int main()
{
vector<int> sum3or5;
for (int i = 1; i < 1000; i++)
{
if (i % 3 == 0 || i % 5 ==0)
{
sum3or5.push_back(i);
}
}
int count = 0;
for (int j = 0; j <= sum3or5.size(); j++)
{
count = count + sum3or5[j];
}
cout << count << endl;
cin.get();
}