James stop playing league

To do:

CCC problems s3: https://dmoj.ca/problem/ccc16s3 DONT USE BFS IN JAVA, even though editorial says so
https://dmoj.ca/problem/ccc11s3 Integer division , https://dmoj.ca/problem/ccc06s3, https://dmoj.ca/problem/ccc05s3, https://dmoj.ca/problem/ccc04s3, https://dmoj.ca/problem/ccc02s3, https://dmoj.ca/problem/ccc00s3

s4: https://dmoj.ca/problem/ccc08s4, https://dmoj.ca/problem/ccc06s4, https://dmoj.ca/problem/ccc98s4, https://dmoj.ca/problem/ccc17s4, https://dmoj.ca/problem/ccc04s4, https://dmoj.ca/problem/ccc14s4, https://dmoj.ca/problem/ccc14s4

https://dmoj.ca/problem/dmopc15c1p5 probably a 2d psa implementation followed by brute forcing all possible squares of max size?

https://dmoj.ca/problem/cerc2000h cancer oop

https://dmoj.ca/problem/dmopc15c1p6

https://dmoj.ca/problem/mockccc15j5

https://dmoj.ca/problem/tsoc16c2p4 easy unlimited knapsack

https://dmoj.ca/problem/cco19p2 topological sort maybe?

https://dmoj.ca/problem/cco12p3 interval dp

https://dmoj.ca/problem/ccc16s5 xor

https://dmoj.ca/problem/ccc10s4 15 points for an mst???

https://dmoj.ca/problem/ccc04s4 binary search the quadtratic distance-from-shell function for each line, using the monotonic derivative of the distance function (0 at local min). Note that you do not have to calculate derivative, just approximate limits at each check (i.e. add 0.0001). Most feasible on contest/easy code