Added the problem description to euler0064.py
_Slightly_ improved euler0064.py after confirming that the pre-period of the
continued fraction of an irrational square root is always just the first entry
Moved the implementations of Dijkstra's algorithm from euler008[123].py to
eulerlib.py and somehow ended up reducing their runtimes by 75%