Progress during contest
Solved A small

Too slow for A large input.
Updated gitignore
Fixed A solution to work for large input

Switched to using ints and xor for detecting bit flips and
doing the flipping.
Added python template file
Add solution to 2014-1A-B

Only works for the small input. Gives incorrect answer for
large input.
Fixed 2014-1A-B for larg input

Instead of trying to prune the smallest number of nodes,
just compute the maximum size of the tree that we can get if
we choose a given node as the root.
Updated python template
Updated gitignore