首页 诗词 字典 板报 句子 名言 友答 励志 学校 网站地图
当前位置: 首页 > 教程频道 > 开发语言 > perl python >

perl解析欧拉计划:Progect Euler1-2题

2012-12-14 
perl解析欧拉计划:Progect Euler1--2题Problem 1:1000一下,能被3,5整除的数的和If we list all the natura

perl解析欧拉计划:Progect Euler1--2题
Problem 1:1000一下,能被3,5整除的数的和

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.

Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:

1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...

By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.

use strict;use warnings;my $first_value =1;my $second_value=2;my $third_value =0;my $sum         =2;while($third_value<4000000){$third_value=$first_value+$second_value;if(0==$third_value%2){$sum=$sum+$third_value;}$first_value =$second_value;$second_value=$third_value ;}print $sum;



热点排行