I've been looking at previous Code Jams. In the 2009 CJ, to solve the second problem in Round 1A, you needed to use a shortest path algorithm. The analysis suggested using Bellman-Ford or Dijkstra's algorithm.
Off the top of my head, I don't know either algorithm. Would it have been cheating to look up and implement one of those algorithms during the competition? What exactly ARE the limits on use of outside sources? TIA, Greg -- You received this message because you are subscribed to the Google Groups "google-codejam" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/google-code?hl=en.
