Commit Graph
100 Commits
Author SHA1 Message Date
flip a342d1d04d Tried my first real codeforces round, got stuck way too long on one of the earlier questions, but over all, you gotta start somewhere i guess 2021-12-21 21:54:41 +01:00
flip 6b735054c5 Finished part 2 day 4 lightning quick 2021-12-19 15:21:30 +01:00
flip f75ef2969b Finished part 1 day 4, after a night of bugs and a morning of wonder 2021-12-19 15:03:31 +01:00
flip b0c82a440c I don't like learning Rust, continue in c++ for now -- advent_of_code 2021-12-19 01:00:35 +01:00
flip 7a8d39f5ca Changed advent_of_code rust stuff to be good cargo packages instead 2021-12-17 16:17:45 +01:00
flip 6533d3ccca Bingo cards for AoC day 4 not functional yet 2021-12-15 00:37:31 +01:00
flip 2025f59963 Started on advent of code day 4 2021-12-13 14:25:48 +01:00
flip 4fadfc81d7 Fixed bugs in part 2 of 3, mcb and lcb were not determined correctly 2021-12-12 23:59:56 +01:00
flip 297077aac5 Too tired to finish part 2 of day 3 of advent of code, but answer is not vaid yet 2021-12-12 02:21:23 +01:00
flip 2c59298671 Finished part 1 of day 3 of advent of code 2021-12-12 00:43:00 +01:00
flip 75a1991223 Finished part 2 of day 2 2021-12-11 23:48:23 +01:00
flip 677e28a60a Finished day 2 of advent of code with rust 2021-12-11 23:35:07 +01:00
flip 2d5cf15bf0 Started on advent of code in Rust; o.d.z. on becoming a Rustacean 2021-12-10 15:25:20 +01:00
flip 7af7c853c2 Changed gitignore in order to untrack extensionless files 2021-12-10 15:24:29 +01:00
flip 93c452fdfa Started with Codeforces educational round 118, finished a and b 2021-12-07 00:43:31 +01:00
flip 51c9a998f9 Finished g of the 226th atcoder contest 2021-12-06 00:55:13 +01:00
flip 61b6cbc2c7 Finished c and d, e doesn't check for faulty arrangements 2021-12-05 02:35:53 +01:00
flip b94359378b Started on 226th beginner contest of atcoder.jp, a and b finished 2021-11-27 01:10:32 +01:00
flip 93479faf32 Solved 72 with a good totient function I found online 2021-11-16 00:05:39 +01:00
flip 3d1ef6360b Finished 071 by using fraction arithmetics 2021-11-15 01:39:00 +01:00
flip 20237a22af Finished 070, by using the way quicker prime factorization it is done in 18 seconds 2021-11-14 22:25:02 +01:00
flip 673b908d16 Edited the prime factorization function of 69 so it is quick now 2021-11-14 22:20:56 +01:00
flip ec1fae253d Finished 69 (nice), wasn't too hard but my solution is pretty slow for some reason (19 s) 2021-11-14 21:24:24 +01:00
flip d06da3219a Solved 068 by hand 2021-11-13 13:55:57 +01:00
flip e1ed7960aa Added txt to their problem directory 2021-11-13 13:48:46 +01:00
flip 0e1b0de59f 067 pretty easy, just keep track of the maximum routes starting from the bottom 2021-11-13 13:29:55 +01:00
flip 8f5217e793 Solved 66, made some initialization error and had to gradually build up the chain instead of recomputing it everytime 2021-11-13 01:52:05 +01:00
flip d2d19d3efa Added bigint header file and edited the solution to include bigint to correctly handle the large numbers 2021-11-10 13:07:18 +01:00
flip aafaeb91fc I solved it by using someones pseudocode and to be honest I don't completely understand how it works 2021-11-06 13:48:12 +01:00
flip 7430bccec9 Finished 62 in a jiffy, wasn't hard when using a sorted list to keep track of the found cubes 2021-11-02 13:50:35 +01:00
flip f649acf5a3 Did it all on my own, while being incredibly quick at the same time, very proud 2021-11-02 12:55:06 +01:00
flip 7eaf59bb45 Changed the folder structure of codeforces problemsets 2021-11-02 12:54:37 +01:00
flip 5c71f0bbdd Changed the base to include all includes 2021-10-30 21:46:56 +02:00
flip 38ad5e4d1f Cleaned up project euler folder and moved the license and readme 2021-10-30 19:59:38 +02:00
flip e0c627a384 Rebased projecteuler folder, now includes all contest programming stuff 2021-10-26 10:54:24 +02:00
flip 1aa6120838 Easy one tussendoor met hulp van Miekster 2021-05-15 00:23:57 +02:00
flip 1879be093d Started on 061, did a lot of stuff that was really really slow, now try to use bit masking 2021-04-29 21:53:12 +02:00
flip dff7d5b48e Merge branch 'master' of ssh://git.pzwietering.nl:55555/flip/project-euler 2021-04-26 19:07:47 +02:00
flip 4821130440 Added 061 to cmake 2021-04-26 19:07:44 +02:00
flip 5e43dee9cc Forgot to commit solution of 59, copied from internet 2021-04-26 00:10:41 +02:00
flip 85574d755f Merge branch 'master' of ssh://git.pzwietering.nl:55555/flip/project-euler 2021-04-26 00:06:51 +02:00
flip 57f6869306 Added all warnings to cmake 2021-04-26 00:06:45 +02:00
flip 462b7138a0 Added std to cout because vscode was a lil' bitch 2021-04-20 23:23:56 +02:00
flip bfb2a5fe85 Found the five pairwise concatative prime number 2021-04-20 23:08:20 +02:00
flip d4a063ef64 Started on 060 2021-04-19 16:14:58 +02:00
flip 0b15db7b92 Well that truly cost me some grey hairs 2021-04-19 00:55:03 +02:00
flip 4d657b5506 work in progress 2021-04-17 21:49:11 +02:00
flip a92e4b6429 Added cmakelists and changed externals file structure 2021-04-16 17:57:58 +02:00
flip 197b3eea8a Renamed all folders 2021-04-16 16:58:48 +02:00
flip dbc6cfef05 From now on programming in C++, no Python cheats anymore 2021-04-16 16:54:43 +02:00
flip 17d591c658 For some reason the execution time is very variable, also I learned that sympy isprime exists 2021-04-11 02:14:57 +02:00
flip fd9f4b7a49 Had it run 10 times too many integers woops, but still easy to solve 2021-04-10 00:48:31 +02:00
flip fbfce7984e Brute forcing all day 2021-04-09 16:16:42 +02:00
flip f5aaf8e36a Not that hard, just a loopty loop and keep track of which ones you did already 2021-04-08 18:11:54 +02:00
flip 6661d47747 I wouldn't call it hard, it was just a metric shitton of work to get all cases handled correctly 2021-04-08 16:09:20 +02:00
flip c712043c4c Gotta love these easy ones 2021-04-06 10:19:08 +02:00
flip cc10f8f4e0 52 was so easy that at first I thought my code was bugged 2021-04-06 01:56:27 +02:00
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