Restructuring

solutions/ProjectEuler/005/desc.yml

@@ -0,0 +1,20 @@
+title: What is the smallest number divisible by each of the numbers 1 to 20?
+url: http://projecteuler.net/problem=5
+
+desc: |
+  2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.
+  What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?
+  
+solution: |
+  See code
+
+solutions:
+  solve.php:
+    desc: Basic solution
+    language: php
+  solve.rb:
+    desc: Basic solution in Ruby
+    language: ruby
+  solve.js:
+    desc: Basic solution for NodeJS
+    language: js

solutions/ProjectEuler/005/solve.js

@@ -0,0 +1,11 @@
+for(i=20;true;i+=20) {
+	div = 19;
+
+	while(!(i % div)) {
+		div--;
+		if(div == 0) {
+			console.log( i );
+			process.exit(0);
+		}
+	}
+}

solutions/ProjectEuler/005/solve.lua

@@ -0,0 +1,12 @@
+i=0
+while(true) do
+	i = i + 20 
+	div = 19
+	while((i % div) == 0) do
+		div = div - 1
+		if(div == 0) then
+			print(i)
+			os.exit()
+		end
+	end
+end

solutions/ProjectEuler/005/solve.php

@@ -0,0 +1,12 @@
+<?php
+for($i=20;true;$i+=20) {
+	$div = 19;
+
+	while(!($i % $div)) {
+		$div--;
+		if($div == 0) {
+			echo $i;
+			die;
+		}
+	}
+}

solutions/ProjectEuler/005/solve.rb

@@ -0,0 +1,13 @@
+i = 0
+while (true) 
+i = i + 20
+div = 19
+
+	while((i % div) == 0) 
+		div = div - 1
+		if(div == 0) then
+			puts i
+			exit
+		end
+	end
+end