blob: 1fa09972266796d90bd8b58cd35a611f2e090a84 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
|
/*
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.
*/
#include <stdio.h>
int main() {
unsigned int l = 1;
unsigned int h = 2;
unsigned long int sum = 0;
while (h < 40000000) {
if (h % 2 == 0) {
sum += h;
}
unsigned int t = h;
h += l;
l = t;
}
printf("%ul\n", sum);
}
|
