Restructuring

solutions/ProjectEuler/006/desc.yml

@@ -0,0 +1,27 @@
+title: What is the smallest number divisible by each of the numbers 1 to 20?
+url: http://projecteuler.net/problem=6
+
+desc: |
+  The sum of the squares of the first ten natural numbers is,
+  1^2 + 2^2 + ... + 10^2 = 385
+  The square of the sum of the first ten natural numbers is,
+  (1 + 2 + ... + 10)^2 = 55^2 = 3025
+  Hence the difference between the sum of the squares of the first ten natural numbers and the square of the sum is 3025  385 = 2640.
+  Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum.
+  
+solution: |
+  See code
+
+solutions:
+  solve.php:
+    desc: Basic solution
+    language: php
+  solve.rb:
+    desc: Basic Ruby solution
+    language: ruby
+  solve.c:
+    desc: ANSI C solution (Tested with TCC)
+    language: c
+  solve.js:
+    desc: Javascript solution for NodeJS
+    language: javascript

solutions/ProjectEuler/006/solve.c

@@ -0,0 +1,19 @@
+#include <stdio.h>
+#include <math.h>
+
+int main( )
+{
+	int num;
+	int result;
+	
+	int square = 0;
+	int sum = 0;
+	
+	for(num=1; num<=100; num++) {
+		square += pow(num,2);
+		sum += num;
+
+	}
+	result = pow(sum,2) - square;
+	printf("%d", result);
+}

solutions/ProjectEuler/006/solve.js

@@ -0,0 +1,9 @@
+square = 0;
+sum = 0;
+for(num=1;num<101;num++) {
+	square += Math.pow(num,2);
+	sum += num;
+
+}
+console.log( Math.pow(sum,2) - square);
+

solutions/ProjectEuler/006/solve.php

@@ -0,0 +1,9 @@
+<?php
+$square =0;
+$sum =0;
+for($num=1;$num<101;$num++) {
+	$square += pow($num,2);
+	$sum += $num;
+
+}
+echo pow($sum,2) - $square;

solutions/ProjectEuler/006/solve.rb

@@ -0,0 +1,7 @@
+square = 0
+sum = 0
+(1..100).each do |num| 
+	square += num**2;
+	sum += num;
+end
+puts sum**2 - square;