|
|
09e0d38e47
|
PE 081, added problem framework and input data, they are getting real hard all of a sudden
|
2022-05-29 16:22:12 +02:00 |
|
|
|
6de6e057ae
|
AC 250, tried atcoder virtual contest, wasn't even half bad
|
2022-05-10 15:19:23 +02:00 |
|
|
|
dd43fcc0c5
|
PE 80, solved by digit-by-digit calculation
|
2022-05-06 15:58:38 +02:00 |
|
|
|
679022c4cd
|
PE 79, didn't need to write code for this one, just looked at the text file for a few minutes
|
2022-05-02 16:16:38 +02:00 |
|
|
|
b797dd3f84
|
PE 78, not the nicest solution, bruteforcing on euler recurrence relation
|
2022-05-02 15:55:09 +02:00 |
|
|
|
ff7e343aff
|
PE 77, used dynamic programming
|
2022-05-02 15:06:28 +02:00 |
|
|
|
fda564b4ed
|
PE 76, took a while to notice you need to subtract 1 from the partition function
|
2022-05-02 13:39:01 +02:00 |
|
|
|
c9d461ba75
|
PE 075, pretty neat
|
2022-04-22 15:04:18 +02:00 |
|
|
|
bd57e0590e
|
PE 074, for some reason I have to put in 57 instead of 60 but it works magically
|
2022-04-22 13:23:54 +02:00 |
|
|
|
bfc7106e37
|
Finished 073 of projecteuler, not very fast solution
|
2022-04-22 12:03:17 +02:00 |
|
|
|
75e7b77c2b
|
Finished beads and milk2 for usaco
|
2022-04-19 15:22:25 +02:00 |
|
|
|
7a325e8818
|
Finished 2 of usaco
|
2022-04-15 14:12:34 +02:00 |
|
|
|
a191aec9bb
|
Set up base directory for usaco and started on gift1
|
2022-01-06 19:56:43 +01:00 |
|
|
|
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 |
|
