Commit Graph

236 Commits

Author SHA1 Message Date
1f1d45e2db Added .in to gitignore for the usaco challenges 2022-01-05 22:09:37 +01:00
c8d92c7874 Bit stuck on day 9 part 2, don't know best way to solve this 2022-01-04 01:18:55 +01:00
d91f9e1266 Part 1 day 9 of advent of code finished 2021-12-30 01:25:36 +01:00
43549c9d38 Holy shit I think that is the most complicated code I have ever written without a single bug in one go 2021-12-30 00:59:00 +01:00
d9c082445b Working on advent of code day 8 2021-12-22 20:59:58 +01:00
4789d7ce32 Finished part 2 of day 7, still binary search with a slightly harder cost function 2021-12-22 17:04:10 +01:00
67be539f92 Finished advent of code day 7 part 1, classic binary search 2021-12-22 02:14:15 +01:00
d968ed595b Advent of code day 6 finished - learned a lot today 2021-12-22 01:51:39 +01:00
c618edfc18 Finished both parts of advent of code day 5 2021-12-21 21:55:10 +01:00
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
6b735054c5 Finished part 2 day 4 lightning quick 2021-12-19 15:21:30 +01:00
f75ef2969b Finished part 1 day 4, after a night of bugs and a morning of wonder 2021-12-19 15:03:31 +01:00
b0c82a440c I don't like learning Rust, continue in c++ for now -- advent_of_code 2021-12-19 01:00:35 +01:00
7a8d39f5ca Changed advent_of_code rust stuff to be good cargo packages instead 2021-12-17 16:17:45 +01:00
6533d3ccca Bingo cards for AoC day 4 not functional yet 2021-12-15 00:37:31 +01:00
2025f59963 Started on advent of code day 4 2021-12-13 14:25:48 +01:00
4fadfc81d7 Fixed bugs in part 2 of 3, mcb and lcb were not determined correctly 2021-12-12 23:59:56 +01:00
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
2c59298671 Finished part 1 of day 3 of advent of code 2021-12-12 00:43:00 +01:00
75a1991223 Finished part 2 of day 2 2021-12-11 23:48:23 +01:00
677e28a60a Finished day 2 of advent of code with rust 2021-12-11 23:35:07 +01:00
2d5cf15bf0 Started on advent of code in Rust; o.d.z. on becoming a Rustacean 2021-12-10 15:25:20 +01:00
7af7c853c2 Changed gitignore in order to untrack extensionless files 2021-12-10 15:24:29 +01:00
Philippe Zwietering
cb14a763e1 Can't test the solution at internship, but I suspect it should be close to correct 2021-12-08 15:31:53 +01:00
93c452fdfa Started with Codeforces educational round 118, finished a and b 2021-12-07 00:43:31 +01:00
51c9a998f9 Finished g of the 226th atcoder contest 2021-12-06 00:55:13 +01:00
61b6cbc2c7 Finished c and d, e doesn't check for faulty arrangements 2021-12-05 02:35:53 +01:00
b94359378b Started on 226th beginner contest of atcoder.jp, a and b finished 2021-11-27 01:10:32 +01:00
93479faf32 Solved 72 with a good totient function I found online 2021-11-16 00:05:39 +01:00
3d1ef6360b Finished 071 by using fraction arithmetics 2021-11-15 01:39:00 +01:00
20237a22af Finished 070, by using the way quicker prime factorization it is done in 18 seconds 2021-11-14 22:25:02 +01:00
673b908d16 Edited the prime factorization function of 69 so it is quick now 2021-11-14 22:20:56 +01:00
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
d06da3219a Solved 068 by hand 2021-11-13 13:55:57 +01:00
e1ed7960aa Added txt to their problem directory 2021-11-13 13:48:46 +01:00
0e1b0de59f 067 pretty easy, just keep track of the maximum routes starting from the bottom 2021-11-13 13:29:55 +01:00
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
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
Philippe Zwietering
26b32ce7c8 Woops had a erroneous function in problem 066 2021-11-09 16:12:37 +01:00
Philippe Zwietering
2477b229d5 Found the solution for 066, now just have to work out the implementation 2021-11-09 16:11:25 +01:00
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
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
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
7eaf59bb45 Changed the folder structure of codeforces problemsets 2021-11-02 12:54:37 +01:00
5c71f0bbdd Changed the base to include all includes 2021-10-30 21:46:56 +02:00
38ad5e4d1f Cleaned up project euler folder and moved the license and readme 2021-10-30 19:59:38 +02:00
e0c627a384 Rebased projecteuler folder, now includes all contest programming stuff 2021-10-26 10:54:24 +02:00
1aa6120838 Easy one tussendoor met hulp van Miekster 2021-05-15 00:23:57 +02:00
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
dff7d5b48e Merge branch 'master' of ssh://git.pzwietering.nl:55555/flip/project-euler 2021-04-26 19:07:47 +02:00