That is a thing in the ACM-ICPC. Typically competitors would come in with printouts of times they've implemented a tricky algorithm like the Hungarian Algorithm

That is a thing in the ACM-ICPC. Typically competitors would come in with printouts of times they've implemented a tricky algorithm like the Hungarian Algorithm or the Blossom Algorithm in the past, so that having it would help jog their memory and let them be constrained only by typing speed once they've figured out how to adapt it to their problem. It was referred to as "book code."