- #1
rollcast
- 408
- 0
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.
I'm new to C# and I'm trying to solve this problem but there's no solution availible on Project Euler for it. I have made this bit of code and the result seems ok.
Code:
using System;
class MultipleSum
{
public static void Main()
{
int sum = 0;
for (int i = 0; i < 1000; i++)
{
if (i % 3 == 0)
sum += i;
continue;
if (i % 5 == 0)
sum += i;
continue;
}
Console.WriteLine(sum);
Console.WriteLine("Press ANY Key to continue");
Console.ReadKey();
}
}
Will that work for the problem?
Thanks
AL