p01.cpp
455 Bytes
/*
Multiples of 3 and 5
Problem 1
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.
By: dbk
*/
#include <iostream>
#include <stdio.h>
using namespace std;
int main()
{
int res = 0;
for (int i = 1; i < 1000; i++)
{
res += (i % 3 == 0 || i % 5 == 0) ? i : 0;
}
printf("Resultado: %i\n", res);
return 0;
}