欧拉计划150题中文.docVIP

欧拉计划1.10以下的自然数中，属于3和5的倍数的有3,5,6和9，它们之和是23。找出1000以下的自然数中，属于3和5的倍数的数字之和。Java:public class Test1 { public static void main(String[] args) { beishu(); } public static void beishu(){ int sum = 0; for(int i = 3; i 1000; i++){ if(i % 3 == 0||i % 5 ==0){ sum += i; } } System.out.println(1000以内3和5所有的倍数的和为： + sum); }}c/c++:#include stdio.hvoid main(){ long int sum = 0; for(int i=3;i1000;i++) if( ( i % 3 == 0 ) || ( i % 5 == 0 ) ) sum += i; printf(%ld\n,sum);}2. 斐波那契数列中的每一项被定义为前两项之和。从1和2开始，斐波那契数列的前十项为： 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...Java:public class Test2 { public static void main(String[] args) { int i = 1, j = 2,sum = 0; while(i 4000000 j 4000000){ if(j % 2 ==0) sum += j; i = i + j; if(i % 2 == 0) sum += i; j = i + j; } System.out.println(sum); }}c/c++:#include stdio.h#define MAX 200void main(){ long int first = 3; long int second = 2; long int result[MAX] = {0}; result[0] = 2; int n = 3; while(first 4000000 ) { if(n++ % 2 == 0) { result[0] += first; printf( %ld,first); } long int temp = first; first = first + second; second = temp ; int i=0; while(result[i]) { if( result[i] ) { result[i+1] = result[i] / result[i] %= } i++; } } int i = MAX; while(!result[--i]); printf(\n%ld,result[i--]); // printf(%03ld\n,5); while( i=0 ) { printf(%07ld\n,result[i]); i--; } printf(\n);}考虑斐波那契数列中数值不超过4百万的项，找出这些项中偶数项之和。3. 13195的质数因子有5,7,13和29。600851475143的最大质数因子是多少？#include stdio.h/*13195的质数因子有5,7,13和29。600851475143的最大质数因子是多少？*/#define MAX 3void main(){ int arr[MAX] = {6008,5147,5143}; int i=0; int j=0; int i_temp = 0; for(j=2;j10000;j++) { int arr_temp[MAX]={0}; for(i_temp = 0 ; i_temp MAX;i_temp++) arr_temp[i_temp] = arr[i_temp]; for(i=0;iMAX-1;i++) { arr_temp[i+1] = (arr_temp[i] % j ) * 10000 + arr_temp[i+1]; arr_temp[i] /= j; } if(0 != arr_temp[i] % j) continue; arr_temp[i] /= j;printf(%d * ,j); for(i_temp = 0 ; i_temp MAX;i_temp++) arr[i_temp] = a