From 2c7660786d903e984558be9b312a9418556c571e Mon Sep 17 00:00:00 2001
From: FuryFire <furyfire@users.noreply.github.com>
Date: Thu, 1 Mar 2012 11:35:34 +0100
Subject: [PATCH] Initial import

---
 ProjectEuler/001/desc.yml  | 20 ++++++++++++++++++++
 ProjectEuler/001/solve.c   | 15 +++++++++++++++
 ProjectEuler/001/solve.php | 10 ++++++++++
 ProjectEuler/001/solve.rb  |  7 +++++++
 ProjectEuler/002/desc.yml  | 21 +++++++++++++++++++++
 ProjectEuler/002/solve.c   | 18 ++++++++++++++++++
 ProjectEuler/002/solve.php | 12 ++++++++++++
 ProjectEuler/002/solve.rb  | 11 +++++++++++
 8 files changed, 114 insertions(+)
 create mode 100644 ProjectEuler/001/desc.yml
 create mode 100644 ProjectEuler/001/solve.c
 create mode 100644 ProjectEuler/001/solve.php
 create mode 100644 ProjectEuler/001/solve.rb
 create mode 100644 ProjectEuler/002/desc.yml
 create mode 100644 ProjectEuler/002/solve.c
 create mode 100644 ProjectEuler/002/solve.php
 create mode 100644 ProjectEuler/002/solve.rb

diff --git a/ProjectEuler/001/desc.yml b/ProjectEuler/001/desc.yml
new file mode 100644
index 0000000..c17b707
--- /dev/null
+++ b/ProjectEuler/001/desc.yml
@@ -0,0 +1,20 @@
+title: Add all the natural numbers below one thousand that are multiples of 3 or 5.
+url: http://projecteuler.net/problem=1
+
+desc: |
+  If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.
+  Find the sum of all the multiples of 3 or 5 below 1000.
+  
+solution: |
+  Loop numbers from 1-1000 - Use mod to find the multiples
+
+solutions:
+  solve.php:
+    desc: Basic solution
+    language: php
+  solve.rb:
+    desc: Basic solution in Ruby
+    language: ruby
+  solve.c:
+    desc: ANSI C solution (Tested with TCC)
+    language: c
diff --git a/ProjectEuler/001/solve.c b/ProjectEuler/001/solve.c
new file mode 100644
index 0000000..c884762
--- /dev/null
+++ b/ProjectEuler/001/solve.c
@@ -0,0 +1,15 @@
+#include <stdio.h>
+
+int main( )
+{
+	int sum = 0;
+	int i = 0;
+	for(i = 1; i < 1000; i++)
+	{
+		if(i % 3 == 0 || i % 5 == 0)
+		{
+			sum += i;
+		}
+	}
+	printf( "%i", sum );
+}
\ No newline at end of file
diff --git a/ProjectEuler/001/solve.php b/ProjectEuler/001/solve.php
new file mode 100644
index 0000000..0f85864
--- /dev/null
+++ b/ProjectEuler/001/solve.php
@@ -0,0 +1,10 @@
+<?php
+$sum = 0;
+$i = 0;
+for($i=1; $i<1000;$i++) {
+	if($i % 3 == 0 OR $i % 5 == 0) {
+		$sum += $i;
+	}
+}
+
+echo $sum;
\ No newline at end of file
diff --git a/ProjectEuler/001/solve.rb b/ProjectEuler/001/solve.rb
new file mode 100644
index 0000000..a589e53
--- /dev/null
+++ b/ProjectEuler/001/solve.rb
@@ -0,0 +1,7 @@
+sum = 0
+(1..1000).each do |i| 
+	if(i % 3 == 0 or i % 5 == 0) 
+		sum += i
+	end
+end
+puts sum
\ No newline at end of file
diff --git a/ProjectEuler/002/desc.yml b/ProjectEuler/002/desc.yml
new file mode 100644
index 0000000..a514798
--- /dev/null
+++ b/ProjectEuler/002/desc.yml
@@ -0,0 +1,21 @@
+title: By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.
+url: http://projecteuler.net/problem=2
+
+desc: |
+  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.
+  
+solution: |
+  Step through the fibonacci sequence while you sum each even entry. Quit as you reach 4million
+
+solutions:
+  solve.php:
+    desc: Basic solution
+    language: php
+  solve.rb:
+    desc: Basic solution in Ruby
+    language: ruby
+  solve.c:
+    desc: ANSI C solution (Tested with TCC)
+    language: c
diff --git a/ProjectEuler/002/solve.c b/ProjectEuler/002/solve.c
new file mode 100644
index 0000000..e26e47b
--- /dev/null
+++ b/ProjectEuler/002/solve.c
@@ -0,0 +1,18 @@
+#include <stdio.h>
+
+int main( )
+{
+	int sum = 2;
+	int fib[3] = { 1, 2, 3 };
+
+	while(fib[2] < 4000000)
+	{
+		fib[2] = fib[0] + fib[1];
+		if(fib[2] % 2 == 0)
+			sum += fib[2];
+
+		fib[0] = fib[1];
+		fib[1] = fib[2];
+	}
+	printf( "%i", sum );
+}
\ No newline at end of file
diff --git a/ProjectEuler/002/solve.php b/ProjectEuler/002/solve.php
new file mode 100644
index 0000000..2153110
--- /dev/null
+++ b/ProjectEuler/002/solve.php
@@ -0,0 +1,12 @@
+<?php
+$fib = array(1,2,3);
+$sum = 2;
+while($fib[2] < 4000000) {
+	$fib[2] = $fib[0] + $fib[1];
+	if($fib[2] % 2 == 0) {
+		$sum += $fib[2];
+	} 
+	$fib[0] = $fib[1];
+	$fib[1] = $fib[2];
+}
+echo $sum;
\ No newline at end of file
diff --git a/ProjectEuler/002/solve.rb b/ProjectEuler/002/solve.rb
new file mode 100644
index 0000000..f0bd692
--- /dev/null
+++ b/ProjectEuler/002/solve.rb
@@ -0,0 +1,11 @@
+fib = [1, 2, 3];
+sum = 2;
+while(fib[2] < 4000000) 
+	fib[2] = fib[0] + fib[1];
+	if(fib[2] % 2 == 0) 
+		sum += fib[2];
+	end
+	fib[0] = fib[1];
+	fib[1] = fib[2];
+end
+puts sum;
\ No newline at end of file