Problem 1: Add all the natural numbers below one thousand that are multiples of 3 or 5.

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 ExpandedBlockStart.gif Code
 
   
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  



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



answer:233168

转载于:https://www.cnblogs.com/edmundli/archive/2010/07/28/1787333.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值