codeforces-514

ICPC practice, week 1

More detailed comments in file headers.

Progress

Finished A - simple
Finished B - created complicated but still linear scheme for checking
Finished C - whiteboarded nice recurrence solution... how to reduce # of base cases??
Partial implementation of D - missing minimum circles cover problem, maybe easier way to do this?
Thinking on E - seems like should be easy recursive problem?

need to create c++ geometry library
must create some baseline c++ implementations of common trees to drop in for solutions

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
README.md		README.md
a-cashier.cpp		a-cashier.cpp
b-forgery.cpp		b-forgery.cpp
c-sequence.cpp		c-sequence.cpp
d-nature.cpp		d-nature.cpp
e-tree.cpp		e-tree.cpp