Commit Graph
67 Commits
Author SHA1 Message Date
flip a4d31debeb Strictly speaking this algorithm has an O(n^2) part in it, but it runs under a second so... 2021-04-06 01:16:05 +02:00
flip 3f1859d923 Testing gitea migration to privately owned server 2021-03-28 03:12:48 +02:00
flip a4363d2e24 Added 51 description and first observrations 2021-03-25 00:10:00 +01:00
flip 906fa69004 Misinterpreted that questin multiple times, finally just did an exhaustive search 2021-03-12 01:11:59 +01:00
flip 9bb3ada0ba Tricky one, but quick code 2021-03-06 18:43:50 +01:00
flip 1eaf67e3f0 Remember that 0^0 is not 0, or at least not implemented as such (what it truly is is a mystery) 2021-03-06 17:51:52 +01:00
flip df64e1015d Quite a slow solution for 47, but it works 2021-03-06 01:32:47 +01:00
flip f7ee0fca41 Finished 46 with quite a quick algorithm 2021-03-06 00:57:36 +01:00
flip 731aecfad3 45 really easy once you can quickly verify pentagonal numbers 2021-03-02 00:03:01 +01:00
flip ead9f6e82d Not even that slow of a solution for 44 2021-03-01 23:45:01 +01:00
flip ac3557e3f2 43 done, not too bad 2021-02-27 23:34:17 +01:00
flip 126ed459a0 42 was too easy, can't be the answer to everything 2021-02-27 22:46:09 +01:00
flip 01c47248bf Oof I feel ashamed by having written this code, 41 2021-02-26 01:43:39 +01:00
flip de82029eef Basically just indexing, god python is easy 2021-02-26 01:02:00 +01:00
flip 0b13772d44 Finished the pythagorean triangle circumferences 2021-02-26 00:52:25 +01:00
flip 136d9e8bd2 Found highest pandigital concat product 2021-02-26 00:22:50 +01:00
flip 8eab5128a1 Dumb solution is quick enough so me do dumb solution 2021-02-25 23:37:52 +01:00
flip 2726c2d2ca Finished 36, was really easy 2021-02-23 16:33:00 +01:00
flip 5f9bb74434 Started on 36 2021-02-23 16:29:38 +01:00
flip 07c5ae99ee 35 done, slow but it works 2021-02-22 21:35:25 +01:00
flip 61edc6a92a 34 done, that was way too easy haha 2021-02-22 21:04:13 +01:00
flip 110d4faf40 Manually edit end result to simplified fraction 2021-02-22 20:51:32 +01:00
flip faa921d824 Merge branch 'master' of ssh://git.v1a.nl:2280/philippe/project-euler 2021-02-13 21:59:43 +01:00
flip 5a84dcd95d Solved the pandigits, tried to do it way more complicated than necessary at first 2021-02-13 20:14:10 +01:00
flip 71792dcf06 Added vs code to gitignore 2021-02-13 15:08:32 +01:00
flip fe6c079f8a Standard coin change algorithm 2020-11-09 00:35:30 +01:00
flip 46a3f5ae4a Easy bruteforce solution 2020-11-08 23:28:22 +01:00
flip 605831c4f5 Very easy to do in Python 2020-11-08 22:54:08 +01:00
flip da71c9def7 That one was easy 2020-11-08 22:45:13 +01:00
flip 0e365c99eb Ok so this solution is supersuperslow but it worked 2020-11-08 22:09:34 +01:00
flip ef8cfc2d4a Finally finished 26, think I did it good enough 2020-11-08 01:57:52 +01:00
flip b4c8909835 Added python file for 26, thinking about approach 2020-04-17 13:12:57 +02:00
flip 6708bd6865 First 25 done. I still feel dirty for using Python 2020-04-14 21:14:18 +02:00
flip da55a33218 Really fast solution, not bruteforce 2020-04-14 18:36:37 +02:00
flip 02dea31c31 Finished 23, pretty darn slow and ugly solution 2020-04-14 00:37:45 +02:00
flip e52795b032 Added base to prevent me from typing 2020-04-13 22:18:04 +02:00
flip 22b8b934f4 Next time inspect target file better 2020-04-13 22:16:09 +02:00
flip 7383ed6bdf Work in progress, sort doesn't work on strings? 2020-04-12 14:39:45 +02:00
flip 80a586037c Python is frustratingly weird with equality checks 2020-04-12 01:09:31 +02:00
flip 9741297006 Forgot problem description 2020-04-11 23:08:54 +02:00
flip 770455a168 These kinda things are fairly straightforward in Python 2020-04-11 23:05:55 +02:00
flip 8800c2030d Was lazy, used datetime library for this 2020-04-11 22:56:17 +02:00
flip 6422ce19ae Finished with a divide and conquer approach, max sum is 1074 2020-04-11 22:38:23 +02:00
flip 411690914c More descriptive problem description 2020-04-09 03:10:47 +02:00
flip c5c7fb93c1 Added just problem description for now 2020-04-09 03:09:00 +02:00
flip dd7990462b I learned that 18 is spelled as eighteen 2020-04-09 03:02:24 +02:00
flip 61f7d81e19 Forgot to add problem description 2020-04-09 02:39:45 +02:00
flip 44322645d0 Easy problem, 1366 2020-04-09 02:26:01 +02:00
flip cb444f8946 Finally finished, learned how not init nested array 2020-04-09 02:14:55 +02:00
flip 5c638b32a7 Work in progress, 15 doesn't work like intended 2020-04-07 11:41:01 +02:00
flip 73d0d4ff36 Found the longest Collatz chain: 837799 2020-04-05 15:36:53 +02:00
flip 50cb74e20d This was probably the easiest problem so far, Python is just cheating 2020-04-05 14:48:53 +02:00
flip c7ad4142ed Finished 11, always remember there are 2 diagonals 2020-03-31 15:33:02 +02:00
flip 8262d4dad2 Finished 10, finally learned to write a proper friggin sieve 2020-03-31 00:49:32 +02:00
flip 03bb8d283f Finished 9, easy brute force solution 2020-03-31 00:46:27 +02:00
flip 5e7d81e847 Merge branch 'master' of ssh://git.v1a.nl:2280/philippe/project-euler 2020-03-30 21:55:09 +02:00
flip 85647e6032 Initial commit 2020-03-30 21:49:44 +02:00
flip 756e261dc2 Found the biggest, 23514624000 2020-03-30 21:38:44 +02:00
flip e517826f90 Finished 7 2020-03-29 04:03:01 +02:00
flip 4ad00182b2 Technically was a bug in 3 2020-03-29 04:02:44 +02:00
flip 73044d95e1 6 was rather easy, answer 25164150 2020-03-28 18:57:32 +01:00
flip 90e96cfeb4 Finished 5, rather ugly, but answer is 232792560 2020-03-28 18:51:09 +01:00
flip 35ec7de216 Finished 4, palindrome was 906609 2020-03-28 18:19:36 +01:00
flip 212632463c Found the biggest factor: 6857 2020-03-28 17:27:52 +01:00
flip d6d94b3866 Finished problem 2: sum of even fibonacci numbers 2020-03-28 03:30:48 +01:00
flip fafebcde78 Added problem description for future reference 2020-03-28 03:30:25 +01:00
flip 2a0b0f1ca0 Started on project Euler, finished ass 1 in the most ugly way 2020-03-28 03:09:13 +01:00