An interesting problem arose while practicing for ICPC, attempting The Net. The problem was inherently a shortest path problem using breadth-first search; however, the interesting aspect was the input which was an absolute string representation of an adjacency list.
I am a torrent of ingenuity (or insanity) with a myriad of innovations (sometimes fallacies) and a wealth of inspiration (possibly naiveté). My name is Gio Carlo Cielo Borje and I like puffer fish because they're just cooltalkin', highwalkin' and fastlivin'.
I'm also nineteen and a current student at UC Irvine for Computer Science.