Programming C, C++, Java, PHP, Ruby, Turing, VB
Computer Science Canada 
Programming C, C++, Java, PHP, Ruby, Turing, VB  

Username:   Password: 
 RegisterRegister   
 Round 2 Question 4 lucky solution
Index -> CompSci.ca, Contests -> DWITE
View previous topic Printable versionDownload TopicSubscribe to this topicPrivate MessagesRefresh page View next topic
Author Message
ttm




PostPosted: 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 <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.
Sponsor
Sponsor
Sponsor
sponsor
crossley7




PostPosted: 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




PostPosted: 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:   
   Index -> CompSci.ca, Contests -> DWITE
View previous topic Tell A FriendPrintable versionDownload TopicSubscribe to this topicPrivate MessagesRefresh page View next topic

Page 1 of 1  [ 3 Posts ]
Jump to:   


Style:  
Search: