I think that's pretty much expected (that you'd look up anything you've forgotten) in the internet rounds. However, in latter rounds when your time solving the problems is relevant (as opposed to the qualies), the time you need to figure out what you need, look it up and adapt it to your problem is probably the time that will get you eliminated at the hands of those who know the algorithm and can apply it right away.
And anyway, the finals are held in a controled, internet-disabled network. You better know your algorithms by heart by then... ;) On May 10, 2:28 am, Greg D <[email protected]> wrote: > 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 > athttp://groups.google.com/group/google-code?hl=en. -- 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.
