2018-02-08 18:10:31 +01:00
|
|
|
<!doctype html>
|
|
|
|
|
<html lang="en">
|
|
|
|
|
<head>
|
|
|
|
|
<!-- Required meta tags -->
|
|
|
|
|
<meta charset="utf-8">
|
|
|
|
|
<meta name="viewport" content="width=device-width, initial-scale=1, shrink-to-fit=no">
|
|
|
|
|
|
|
|
|
|
<!-- Bootstrap CSS -->
|
|
|
|
|
<link rel="stylesheet" href="https://maxcdn.bootstrapcdn.com/bootstrap/4.0.0/css/bootstrap.min.css" integrity="sha384-Gn5384xqQ1aoWXA+058RXPxPg6fy4IWvTNh0E263XmFcJlSAwiGgFAW/dAiS6JXm" crossorigin="anonymous">
|
|
|
|
|
|
|
|
|
|
<title>Project Euler Solutions</title>
|
|
|
|
|
</head>
|
|
|
|
|
|
|
|
|
|
<body>
|
|
|
|
|
<header>
|
|
|
|
|
<div class="navbar navbar-dark bg-dark box-shadow">
|
|
|
|
|
<div class="container d-flex justify-content-between">
|
|
|
|
|
<a href="#" class="navbar-brand d-flex align-items-center">
|
|
|
|
|
<strong>My Project Euler Solutions</strong>
|
|
|
|
|
</a>
|
|
|
|
|
</div>
|
|
|
|
|
</div>
|
|
|
|
|
</header>
|
|
|
|
|
|
|
|
|
|
<main role="main">
|
|
|
|
|
<div class="container">
|
|
|
|
|
|
|
|
|
|
<div class="row" style="padding-top: 40px;">
|
|
|
|
|
<div class="col">
|
|
|
|
|
<table class="table">
|
|
|
|
|
<thead>
|
|
|
|
|
<tr>
|
|
|
|
|
<th scope="col">Name</th>
|
|
|
|
|
<th scope="col">Completion date</th>
|
|
|
|
|
<th scope="col">Link</th>
|
|
|
|
|
<th scope="col">Tags</th>
|
|
|
|
|
</tr>
|
|
|
|
|
</thead>
|
|
|
|
|
<tbody>
|
|
|
|
|
|
|
|
|
|
<tr>
|
|
|
|
|
<td>Problem 001</td>
|
|
|
|
|
<td>Tue, 19 Aug 2014, 20:11</td>
|
|
|
|
|
<td><a href="EulerProblem001.html">Problem 001</a></td>
|
|
|
|
|
<td>
|
|
|
|
|
|
|
|
|
|
<kbd>brute force</kbd>
|
|
|
|
|
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
|
|
|
|
|
<tr>
|
|
|
|
|
<td>Problem 002</td>
|
|
|
|
|
<td>Tue, 19 Aug 2014, 20:36</td>
|
|
|
|
|
<td><a href="EulerProblem002.html">Problem 002</a></td>
|
|
|
|
|
<td>
|
|
|
|
|
|
|
|
|
|
<kbd>fibonacci</kbd>
|
|
|
|
|
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
|
|
|
|
|
<tr>
|
|
|
|
|
<td>Problem 003</td>
|
|
|
|
|
<td>Tue, 19 Aug 2014, 23:35</td>
|
|
|
|
|
<td><a href="EulerProblem003.html">Problem 003</a></td>
|
|
|
|
|
<td>
|
|
|
|
|
|
|
|
|
|
<kbd>prime</kbd>
|
|
|
|
|
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
|
|
|
|
|
<tr>
|
|
|
|
|
<td>Problem 004</td>
|
|
|
|
|
<td>Wed, 20 Aug 2014, 13:27</td>
|
|
|
|
|
<td><a href="EulerProblem004.html">Problem 004</a></td>
|
|
|
|
|
<td>
|
|
|
|
|
|
|
|
|
|
<kbd>palindrome</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>combinations</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>brute force</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>timeit</kbd>
|
|
|
|
|
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
|
|
|
|
|
<tr>
|
|
|
|
|
<td>Problem 005</td>
|
|
|
|
|
<td>Wed, 20 Aug 2014, 14:32</td>
|
|
|
|
|
<td><a href="EulerProblem005.html">Problem 005</a></td>
|
|
|
|
|
<td>
|
|
|
|
|
|
|
|
|
|
<kbd>reduce</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>divisible</kbd>
|
|
|
|
|
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
|
|
|
|
|
<tr>
|
|
|
|
|
<td>Problem 006</td>
|
|
|
|
|
<td>Wed, 20 Aug 2014, 15:13</td>
|
|
|
|
|
<td><a href="EulerProblem006.html">Problem 006</a></td>
|
|
|
|
|
<td>
|
|
|
|
|
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
|
|
|
|
|
<tr>
|
|
|
|
|
<td>Problem 007</td>
|
|
|
|
|
<td>Wed, 20 Aug 2014, 15:40</td>
|
|
|
|
|
<td><a href="EulerProblem007.html">Problem 007</a></td>
|
|
|
|
|
<td>
|
|
|
|
|
|
|
|
|
|
<kbd>prime</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>nth prime</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>nth</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>generator</kbd>
|
|
|
|
|
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
|
|
|
|
|
<tr>
|
|
|
|
|
<td>Problem 008</td>
|
|
|
|
|
<td>Wed, 20 Aug 2014, 16:03</td>
|
|
|
|
|
<td><a href="EulerProblem008.html">Problem 008</a></td>
|
|
|
|
|
<td>
|
|
|
|
|
|
|
|
|
|
<kbd>product</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>reduce</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>slice</kbd>
|
|
|
|
|
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
|
|
|
|
|
<tr>
|
|
|
|
|
<td>Problem 009</td>
|
|
|
|
|
<td>Wed, 20 Aug 2014, 17:06</td>
|
|
|
|
|
<td><a href="EulerProblem009.html">Problem 009</a></td>
|
|
|
|
|
<td>
|
|
|
|
|
|
|
|
|
|
<kbd>brute force</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>pythagorean</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>triplet</kbd>
|
|
|
|
|
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
|
|
|
|
|
<tr>
|
|
|
|
|
<td>Problem 010</td>
|
|
|
|
|
<td>Wed, 20 Aug 2014, 20:28</td>
|
|
|
|
|
<td><a href="EulerProblem010.html">Problem 010</a></td>
|
|
|
|
|
<td>
|
|
|
|
|
|
|
|
|
|
<kbd>primes</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>brute force</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>timeit</kbd>
|
|
|
|
|
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
|
|
|
|
|
<tr>
|
|
|
|
|
<td>Problem 011</td>
|
|
|
|
|
<td>Sun, 31 Aug 2014, 07:39</td>
|
|
|
|
|
<td><a href="EulerProblem011.html">Problem 011</a></td>
|
|
|
|
|
<td>
|
|
|
|
|
|
|
|
|
|
<kbd>brute force</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>product</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>matrix</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>tricky</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>diagonal</kbd>
|
|
|
|
|
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
|
|
|
|
|
<tr>
|
|
|
|
|
<td>Problem 012</td>
|
|
|
|
|
<td>Sun, 31 Aug 2014, 17:07</td>
|
|
|
|
|
<td><a href="EulerProblem012.html">Problem 012</a></td>
|
|
|
|
|
<td>
|
|
|
|
|
|
|
|
|
|
<kbd>triangular</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>number</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>divisors</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>factorization</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>prime</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>group</kbd>
|
|
|
|
|
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
|
|
|
|
|
<tr>
|
|
|
|
|
<td>Problem 013</td>
|
|
|
|
|
<td>Sun, 31 Aug 2014, 19:03</td>
|
|
|
|
|
<td><a href="EulerProblem013.html">Problem 013</a></td>
|
|
|
|
|
<td>
|
|
|
|
|
|
|
|
|
|
<kbd>brute force</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>sum</kbd>
|
|
|
|
|
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
|
|
|
|
|
<tr>
|
|
|
|
|
<td>Problem 014</td>
|
|
|
|
|
<td>Sun, 31 Aug 2014, 19:45</td>
|
|
|
|
|
<td><a href="EulerProblem014.html">Problem 014</a></td>
|
|
|
|
|
<td>
|
|
|
|
|
|
|
|
|
|
<kbd>collatz</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>cache</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>deque</kbd>
|
|
|
|
|
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
|
|
|
|
|
<tr>
|
|
|
|
|
<td>Problem 015</td>
|
|
|
|
|
<td>Sun, 31 Aug 2014, 20:05</td>
|
|
|
|
|
<td><a href="EulerProblem015.html">Problem 015</a></td>
|
|
|
|
|
<td>
|
|
|
|
|
|
|
|
|
|
<kbd>factorial</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>grid</kbd>
|
|
|
|
|
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
|
|
|
|
|
<tr>
|
|
|
|
|
<td>Problem 016</td>
|
|
|
|
|
<td>Sun, 31 Aug 2014, 20:49</td>
|
|
|
|
|
<td><a href="EulerProblem016.html">Problem 016</a></td>
|
|
|
|
|
<td>
|
|
|
|
|
|
|
|
|
|
<kbd>c</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>manual</kbd>
|
|
|
|
|
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
|
|
|
|
|
<tr>
|
|
|
|
|
<td>Problem 017</td>
|
|
|
|
|
<td>Sun, 31 Aug 2014, 21:20</td>
|
|
|
|
|
<td><a href="EulerProblem017.html">Problem 017</a></td>
|
|
|
|
|
<td>
|
|
|
|
|
|
|
|
|
|
<kbd>count</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>numbers</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>tricky</kbd>
|
|
|
|
|
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
|
|
|
|
|
<tr>
|
|
|
|
|
<td>Problem 018</td>
|
|
|
|
|
<td>Thu, 4 Sep 2014, 20:38</td>
|
|
|
|
|
<td><a href="EulerProblem018.html">Problem 018</a></td>
|
|
|
|
|
<td>
|
|
|
|
|
|
|
|
|
|
<kbd>fold</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>reduce</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>search</kbd>
|
|
|
|
|
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
|
|
|
|
|
<tr>
|
|
|
|
|
<td>Problem 019</td>
|
|
|
|
|
<td>Fri, 5 Sep 2014, 09:56</td>
|
|
|
|
|
<td><a href="EulerProblem019.html">Problem 019</a></td>
|
|
|
|
|
<td>
|
|
|
|
|
|
|
|
|
|
<kbd>weekdays</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>brain</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>brute force</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>leap year</kbd>
|
|
|
|
|
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
|
|
|
|
|
<tr>
|
|
|
|
|
<td>Problem 020</td>
|
|
|
|
|
<td>Fri, 5 Sep 2014, 10:42</td>
|
|
|
|
|
<td><a href="EulerProblem020.html">Problem 020</a></td>
|
|
|
|
|
<td>
|
|
|
|
|
|
|
|
|
|
<kbd>factorial</kbd>
|
|
|
|
|
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
|
|
|
|
|
<tr>
|
|
|
|
|
<td>Problem 021</td>
|
|
|
|
|
<td>Fri, 5 Sep 2014, 14:39</td>
|
|
|
|
|
<td><a href="EulerProblem021.html">Problem 021</a></td>
|
|
|
|
|
<td>
|
|
|
|
|
|
|
|
|
|
<kbd>amicable</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>sieve of eratosthenes</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>factors</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>timeit</kbd>
|
|
|
|
|
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
|
|
|
|
|
<tr>
|
|
|
|
|
<td>Problem 022</td>
|
|
|
|
|
<td>Fri, 5 Sep 2014, 15:24</td>
|
|
|
|
|
<td><a href="EulerProblem022.html">Problem 022</a></td>
|
|
|
|
|
<td>
|
|
|
|
|
|
|
|
|
|
<kbd>sorting</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>lexicographical order</kbd>
|
|
|
|
|
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
|
|
|
|
|
<tr>
|
|
|
|
|
<td>Problem 023</td>
|
|
|
|
|
<td>Thu, 5 Nov 2015, 14:48</td>
|
|
|
|
|
<td><a href="EulerProblem023.html">Problem 023</a></td>
|
|
|
|
|
<td>
|
|
|
|
|
|
|
|
|
|
<kbd>perfect number</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>abundant</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>factors</kbd>
|
|
|
|
|
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
|
|
|
|
|
<tr>
|
|
|
|
|
<td>Problem 024</td>
|
|
|
|
|
<td>Thu, 5 Nov 2015, 16:04</td>
|
|
|
|
|
<td><a href="EulerProblem024.html">Problem 024</a></td>
|
|
|
|
|
<td>
|
|
|
|
|
|
|
|
|
|
<kbd>permutation</kbd>
|
|
|
|
|
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
|
|
|
|
|
<tr>
|
|
|
|
|
<td>Problem 025</td>
|
|
|
|
|
<td>Fri, 5 Sep 2014, 14:57</td>
|
|
|
|
|
<td><a href="EulerProblem025.html">Problem 025</a></td>
|
|
|
|
|
<td>
|
|
|
|
|
|
|
|
|
|
<kbd>fibonacci</kbd>
|
|
|
|
|
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
|
|
|
|
|
<tr>
|
|
|
|
|
<td>Problem 026</td>
|
|
|
|
|
<td>Mon, 9 Nov 2015, 22:11</td>
|
|
|
|
|
<td><a href="EulerProblem026.html">Problem 026</a></td>
|
|
|
|
|
<td>
|
|
|
|
|
|
|
|
|
|
<kbd>reciprocal</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>division</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>nominator</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>denominator</kbd>
|
|
|
|
|
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
|
|
|
|
|
<tr>
|
|
|
|
|
<td>Problem 027</td>
|
|
|
|
|
<td>Mon, 21 Aug 2017, 21:11</td>
|
|
|
|
|
<td><a href="EulerProblem027.html">Problem 027</a></td>
|
|
|
|
|
<td>
|
|
|
|
|
|
2018-02-08 23:10:09 +01:00
|
|
|
<kbd>quadratic</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>primes</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>formula</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>brain</kbd>
|
2018-02-08 18:10:31 +01:00
|
|
|
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
|
|
|
|
|
<tr>
|
|
|
|
|
<td>Problem 067</td>
|
|
|
|
|
<td>Fri, 5 Sep 2014, 07:36</td>
|
|
|
|
|
<td><a href="EulerProblem067.html">Problem 067</a></td>
|
|
|
|
|
<td>
|
|
|
|
|
|
|
|
|
|
<kbd>reduce</kbd>
|
|
|
|
|
|
|
|
|
|
<kbd>triangle</kbd>
|
|
|
|
|
|
|
|
|
|
</td>
|
|
|
|
|
</tr>
|
|
|
|
|
|
|
|
|
|
</tbody>
|
|
|
|
|
</table>
|
|
|
|
|
</div>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
<div class="row" style="padding-top: 40px;">
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
</main>
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
<!-- Optional JavaScript -->
|
|
|
|
|
<!-- jQuery first, then Popper.js, then Bootstrap JS -->
|
|
|
|
|
<script src="https://code.jquery.com/jquery-3.2.1.slim.min.js" integrity="sha384-KJ3o2DKtIkvYIK3UENzmM7KCkRr/rE9/Qpg6aAZGJwFDMVNA/GpGFF93hXpG5KkN" crossorigin="anonymous"></script>
|
|
|
|
|
<script src="https://cdnjs.cloudflare.com/ajax/libs/popper.js/1.12.9/umd/popper.min.js" integrity="sha384-ApNbgh9B+Y1QKtv3Rn7W3mgPxhU9K/ScQsAP7hUibX39j7fakFPskvXusvfa0b4Q" crossorigin="anonymous"></script>
|
|
|
|
|
<script src="https://maxcdn.bootstrapcdn.com/bootstrap/4.0.0/js/bootstrap.min.js" integrity="sha384-JZR6Spejh4U02d8jOt6vLEHfe/JQGiRRSQQxSfFWpi1MquVdAyjUar5+76PVCmYl" crossorigin="anonymous"></script>
|
|
|
|
|
</body>
|
|
|
|
|
</html>
|
