Computer Science Canada Round 2 Question 4 lucky solution |
Author: | ttm [ Wed Nov 30, 2011 9:36 pm ] | ||
Post subject: | Round 2 Question 4 lucky solution | ||
During the contest, I coded this solution for question 4. It turns out that the algorithm isn't actually correct, but by chance it got 4 of the 5 test cases correct. Woot! Basically it counts the occurrences of each cavern number in the input file and outputs the max - 1.
Also, appreciations on supporting OpenTuring. |
Author: | crossley7 [ Wed Nov 30, 2011 10:31 pm ] |
Post subject: | RE:Round 2 Question 4 lucky solution |
My friend and I used a similar idea where we found the node with the most connections and outputted the number of connections. It ended up with 3/5. |
Author: | Revolution [ Thu Dec 01, 2011 11:11 am ] |
Post subject: | RE:Round 2 Question 4 lucky solution |
^ did the same thing as crossley after my partner tried 45min to do a backtracking method since he didnt read the question and didn't know it was a tree >.> |