Round 2 Question 4 lucky solution

[ttm]

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.

code:

#include <iostream> using namespace std; int main (int argc, char *argv[]) {         freopen ("DATA4.txt", "r", stdin);         freopen ("OUT4.txt", "w", stdout);         for (int count = 0; count < 5; ++count)         {                 int n;                 cin >> n;                                 int v[1000];                 for (int i = 0; i < n; ++i) v[i] = 0;                 v[0]++;                 int p;                 for (int i = 0; i < n - 1; ++i)                 {                         cin >> p;                         v[p]++;                         cin >> p;                         v[p]++;                 }                                 int m = 0;                 for (int i = 0; i < n; ++i) m = max (v[i], m);                 cout << m - 1 << endl;         } }

Also, appreciations on supporting OpenTuring.

[crossley7]

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.

[Revolution]

^ 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 >.>