Hi sap queue/sap30, the array bounds are based on the limits specified in the problem for the large dataset. This way the program can handle up to the maximum-sized data fed to it in testing. So, in this case 5000 max words in the dictionary, and 15 max characters per word + 1 end of string null character=16 (which should be enough although maybe 20 is used for convenience or to be "safe").
To improve your coding skill, you might want to study the ways of solving some different types of common programming problems - eg. searching and sorting, permutations, tree traversal, etc. These will give you the fundamentals which you can use to figure out how to solve more complex problems. Eventually you also need to learn how to determine the efficiency of your algorithms so you can pick the best solution. That is the fun part. On Sep 6, 12:07 am, sap queue <[email protected]> wrote: > i am using C now plz tell me that how you person take the array bound > [5000] [20] approx in C thanx > > > > On Sun, Sep 6, 2009 at 11:52 AM, Viswanath <[email protected]> wrote: > > If the array size is unpredictable and large, you can use data structures > > like vectors if the language you're using supports it > > > On Sun, Sep 6, 2009 at 3:06 AM, sap30 <[email protected]> wrote: > > >> hi i am very new to coding first of all i want to know the solution of > >> the first problem how you people decide the size array you take > >> initially means some take [5000] [17],and kindly explain me in detail > >> and second that what should i do to improve my coding skill means so > >> that i can solve problem upto this level- Hide quoted text - > > - Show quoted text - --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
