-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path2.c
42 lines (32 loc) · 751 Bytes
/
2.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
/*************************************************************************
> File Name: 2.c
> Author: qusijun
> Mail: [email protected]
> Created Time: 2014年05月04日 星期日 12时32分36秒
************************************************************************/
#include<stdio.h>
#define MAX 4000000
int fib[MAX];
int main(void)
{
fib[0] = 1;
fib[1] = 2;
int i ;
long sum = 0;
for(i = 2;i<MAX;i++)
{
if(fib[i-1]<MAX)
fib[i] = fib[i-1]+fib[i-2];
if(fib[i]>MAX)
{
fib[i] = 0;
break;
}
}
for(int j = 0;j<i;j++)
{
if(fib[j]%2 == 0 )
sum+=fib[j];
}
printf("%li,%d",sum,i);
}