Computer Science Canada Programming C, C++, Java, PHP, Ruby, Turing, VB   Username:   Password: Wiki   Blog   Search   Turing   Chat Room  Members
Round 2 Question 4 lucky solution
Author Message
ttm

Posted: 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.

 code: #include 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.
Sponsor
Sponsor

crossley7

Posted: 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.
Revolution

Posted: 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 >.>
 Display posts from previous: All Posts1 Day7 Days2 Weeks1 Month3 Months6 Months1 Year Oldest FirstNewest First

Page 1 of 1  [ 3 Posts ]
 Jump to:  Select a forum  CompSci.ca ------------ - Network News - General Discussion     General Forums   -----------------   - Hello World   - Featured Poll   - Contests     Contest Forums   -----------------   - DWITE   - [FP] Contest 2006/2008   - [FP] 2005/2006 Archive   - [FP] 2004/2005 Archive   - Off Topic     Lounges   ---------   - User Lounge   - VIP Lounge     Programming -------------- - General Programming     General Programming Forums   --------------------------------   - Functional Programming   - Logical Programming   - C     C   --   - C Help   - C Tutorials   - C Submissions   - C++     C++   ----   - C++ Help   - C++ Tutorials   - C++ Submissions   - Java     Java   -----   - Java Help   - Java Tutorials   - Java Submissions   - Ruby     Ruby   -----   - Ruby Help   - Ruby Tutorials   - Ruby Submissions   - Turing     Turing   --------   - Turing Help   - Turing Tutorials   - Turing Submissions   - PHP     PHP   ----   - PHP Help   - PHP Tutorials   - PHP Submissions   - Python     Python   --------   - Python Help   - Python Tutorials   - Python Submissions   - Visual Basic and Other Basics     VB   ---   - Visual Basic Help   - Visual Basic Tutorials   - Visual Basic Submissions     Education ----------- - Student Life   Graphics and Design ----------------------- - Web Design     Web Design Forums   ---------------------   - (X)HTML Help   - (X)HTML Tutorials   - Flash MX Help   - Flash MX Tutorials   - Graphics     Graphics Forums   ------------------   - Photoshop Tutorials   - The Showroom   - 2D Graphics   - 3D Graphics     Teams ------ - dTeam Public

 Style: Appalachia blueSilver eMJay subAppalachia subBlue subCanvas subEmjay subGrey subSilver subVereor Search: