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.
First, I use the C# to solve this one:
![ContractedBlock.gif](https://i-blog.csdnimg.cn/blog_migrate/8f900a89c6347c561fdf2122f13be562.gif)
![ExpandedBlockStart.gif](https://i-blog.csdnimg.cn/blog_migrate/961ddebeb323a10fe0623af514929fc1.gif)
1
using
System;
2
3 class ProblemOne
4 {
5 static void Main()
6 {
7 int numThousand = 1000 ;
8 int sum = 0 ;
9
10 for ( int i = 0 ; i < numThousand; ++ i)
11 if (i % 3 == 0 || i % 5 == 0 )
12 sum += i;
13 Console.WriteLine( " Sum of these multiples is {0} " , sum);
14
15 }
16 }
17
2
3 class ProblemOne
4 {
5 static void Main()
6 {
7 int numThousand = 1000 ;
8 int sum = 0 ;
9
10 for ( int i = 0 ; i < numThousand; ++ i)
11 if (i % 3 == 0 || i % 5 == 0 )
12 sum += i;
13 Console.WriteLine( " Sum of these multiples is {0} " , sum);
14
15 }
16 }
17
secondly, consider the C++ code:
#include<iostream>
using namespace std;
int main()
{
int numOneThousand = 1000;
int sum = 0;
for(int i = 0; i < numOneThousand; ++i)
if(i % 3 == 0 || i % 5 == 0)
sum += i;
cout<< "Sum below 1000 is:" << sum << endl;
}
Last but not the least, Python:
1
sum
=
0
2 for i in range( 1000 ):
3 if i % 3 == 0 or i % 5 == 0:
4 sum += i
5 print sum
6
2 for i in range( 1000 ):
3 if i % 3 == 0 or i % 5 == 0:
4 sum += i
5 print sum
6
answer:233168