-
Notifications
You must be signed in to change notification settings - Fork 29
Expand file tree
/
Copy pathProblem_2.java
More file actions
31 lines (21 loc) · 707 Bytes
/
Problem_2.java
File metadata and controls
31 lines (21 loc) · 707 Bytes
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
/*
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.
*/
class Problem_2 {
public static void main(String[] args) {
int x = 0;
int y = 1;
int z;
int max = 4000000 ;
int sum = 0;
for (z = 0; z < max; z++) {
z = x + y;
x = y;
y = z;
if (z % 2 == 0) {sum += z;}
}
System.out.println(sum);
}
}