2 files changed, 20 insertions, 0 deletions
diff --git a/problem2/a.out b/problem2/a.out
new file mode 100755
index 0000000..dff8845
--- /dev/null
+++ b/problem2/a.out
diff --git a/problem2/problem2.c b/problem2/problem2.c
new file mode 100644
index 0000000..1fa0997
--- /dev/null
+++ b/problem2/problem2.c
@@ -0,0 +1,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);
+}