diff --git a/Generic/HelloWorld/desc.yml b/Generic/HelloWorld/desc.yml index a6002c3..67936f3 100644 --- a/Generic/HelloWorld/desc.yml +++ b/Generic/HelloWorld/desc.yml @@ -13,4 +13,7 @@ solutions: language: ruby solve.c: desc: ANSI C solution (Tested with TCC) - language: c \ No newline at end of file + language: c + solve.js: + desc: NodeJS solution + language: js \ No newline at end of file diff --git a/ProjectEuler/039/desc.yml b/ProjectEuler/039/desc.yml new file mode 100644 index 0000000..4e24fb9 --- /dev/null +++ b/ProjectEuler/039/desc.yml @@ -0,0 +1,18 @@ +title: Integer right triangles +url: http://projecteuler.net/problem=39 + +desc: | + If p is the perimeter of a right angle triangle with integral length sides, {a,b,c}, there are exactly three solutions for p = 120. + {20,48,52}, {24,45,51}, {30,40,50} + For which value of p <=1000, is the number of solutions maximised? + +solution: | + Bruteforce + +solutions: + solve.php: + desc: Basic solution + language: php + solve.c: + desc: Basic solution + language: c diff --git a/ProjectEuler/039/solve.c b/ProjectEuler/039/solve.c new file mode 100644 index 0000000..1595629 --- /dev/null +++ b/ProjectEuler/039/solve.c @@ -0,0 +1,28 @@ +#include +#define P_VALUE 1000 + +int p, a, b, c, max, key, result = 0; +int main( ) +{ + for(p=2;p max) { + max = result; + key = p; + } + result = 0; + } + printf( "%i", key); +} \ No newline at end of file diff --git a/ProjectEuler/039/solve.php b/ProjectEuler/039/solve.php new file mode 100644 index 0000000..51478fb --- /dev/null +++ b/ProjectEuler/039/solve.php @@ -0,0 +1,20 @@ + $max) { + $max = $result; $key = $p; + } + $result = 0; +} +echo $key; \ No newline at end of file diff --git a/ProjectEuler/041/desc.yml b/ProjectEuler/041/desc.yml new file mode 100644 index 0000000..e4855b5 --- /dev/null +++ b/ProjectEuler/041/desc.yml @@ -0,0 +1,14 @@ +title: Integer right triangles +url: http://projecteuler.net/problem=41 + +desc: | + We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once. For example, 2143 is a 4-digit pandigital and is also prime. + What is the largest n-digit pandigital prime that exists? + +solution: | + Bruteforce + +solutions: + solve.php: + desc: Basic solution + language: php diff --git a/ProjectEuler/041/solve.php b/ProjectEuler/041/solve.php new file mode 100644 index 0000000..4b2a5b8 --- /dev/null +++ b/ProjectEuler/041/solve.php @@ -0,0 +1,27 @@ +