|
karelvancamp's
repositories
|
|
339 [Hard] Severing the Power Grid
|
|
339 [Intermediate] A car renting problem
|
|
340 [Intermediate] Walk in a Minefield
|
|
348 [Hard] Square Sum Chains
|
|
350 [Hard] Which Number Recurs First
|
|
351 [Hard] Star Battle solver
|
|
366 [Hard] Incomplete word ladders
|
|
367 [Hard] The Mondrian Puzzle
|
|
375 [Hard] Graph of Thrones
|
|
999 [Intermediate] Student preferences
|
|
tmp
|
|
340 [Hard] Web crawler.ipynb
|
|
341 [Easy] Repeating Numbers.ipynb
|
|
341 [Hard] Finding a Map Subsection.ipynb
|
|
341 [Intermediate] Listening for Incoming Aircraft.ipynb
|
|
342 [Easy] ASCII85 Encoding and Decoding.ipynb
|
|
342 [Hard] Snake in a Box.ipynb
|
|
343 [Hard] Procedural music generation.ipynb
|
|
343 [Intermediate] Mozart's Musical Dice.ipynb
|
|
344 [Intermediate] Banker's Algorithm.ipynb
|
|
345 [Hard] 2D Triangle Mesh Generator.ipynb
|
|
347 [Hard] Hue drops.ipynb
|
|
348 [Easy] The rabbit problem.ipynb
|
|
349 [Hard] Divide Polygons into Equal Regions.ipynb
|
|
351 [Hard] Star Battle solver.ipynb
|
|
359 [Hard] Primes in Grids.ipynb
|
|
360 [Intermediate] Find the Nearest Aeroplane.ipynb
|
|
Basic vectorization and distributed computation (Numpy and Dask and Numba).ipynb
|
|
Basic vectorization and distributed computation (Numpy and Dask).ipynb
|
|
README.md
|
|
fasc5c.pdf
|
|
mozart-dice-starting.txt
|
|
pytsp2.py
|