On Mon, May 13, 2013 at 1:15 PM, <[email protected]> wrote:
> Today's Topic Summary > > Group: http://groups.google.com/group/google-code/topics > > - [No Subject] <#13e9d99dc82462c0_group_thread_0> [1 Update] > - 1C - Problem A - large_input <#13e9d99dc82462c0_group_thread_1> [1 > Update] > - If you are using c++,can you expect to go to round 3 without using > STL? <#13e9d99dc82462c0_group_thread_2> [2 Updates] > - SPOJ ABA12B <#13e9d99dc82462c0_group_thread_3> [2 Updates] > - Can anyone pls provide me idea or partial solution on this problem > in c++ without using STL? <#13e9d99dc82462c0_group_thread_4> [5 > Updates] > - 1C_Problem_A <#13e9d99dc82462c0_group_thread_5> [4 Updates] > - Round 1A 2013 - C. Good Luck <#13e9d99dc82462c0_group_thread_6> [2 > Updates] > - Is participating in code jam helpful to find job in > google?<#13e9d99dc82462c0_group_thread_7>[1 Update] > > [No Subject]<http://groups.google.com/group/google-code/t/2cc4dc5b693b0c1a> > > Vaibhav Tulsyan <[email protected]> May 13 04:33PM +0530 > > I solved the problem in Java. > My logic to solve the 'Consonants' problem is as follows: > 1. Find all possible substrings from the name of length 'n' or greater > (using substring( ) function) > 2. In each substring, check if 'n' consonants appear consecutively. > > > > This is an O(N^4) solution. For names of length (10^6), I thought I'd > use 'long' instead of 'int', but the substring( ) function works only > for integers. What should I do in order to resolve this, if I intend > to use the same logic? (Or should I change the logic) > -- > Regards, > Vaibhav Tulsyan. > > > > 1C - Problem A - > large_input<http://groups.google.com/group/google-code/t/224f0ad2d153a8ae> > > Vaibhav Tulsyan <[email protected]> May 13 04:31PM +0530 > > I solved the problem in Java. > My logic to solve the 'Consonants' problem is as follows: > 1. Find all possible substrings from the name of length 'n' or greater > (using substring( ) function) > 2. In each substring, check if 'n' consonants appear consecutively. > > > > This is an O(N^4) solution. For names of length (10^6) > > -- > Regards, > Vaibhav Tulsyan. > > > > If you are using c++,can you expect to go to round 3 without using > STL?<http://groups.google.com/group/google-code/t/643b369213bb757f> > > Saurabh Mishra <[email protected]> May 12 11:49PM -0700 > > On Friday, May 10, 2013 5:14:19 PM UTC+5:30, Adii wrote: > > @Vaibhav, the best way to learn that would be a lot of practice. > > > > > Vaibhav Tulsyan <[email protected]> May 13 01:16PM +0530 > > That would be true for all of Programming, I think :) > > > > -- > Regards, > Vaibhav Tulsyan. > > > > SPOJ ABA12B<http://groups.google.com/group/google-code/t/e4f02ed7942e4c20> > > Piyush Raman <[email protected]> May 12 02:21PM -0700 > > I have been trying to solve this problem- > http://www.spoj.com/problems/ABA12B/ > but am having difficulty in finding any efficient approach. Kindly > help. > Can we use suffix arrays to solve this problem? > > > > > Akshay Vishnu <[email protected]> May 13 01:13PM +0530 > > Most of the compression algorithms do something similar. Probably will > help > you solve the problem. Good luck > > > > Can anyone pls provide me idea or partial solution on this problem in > c++ without using > STL?<http://groups.google.com/group/google-code/t/5da653da7f70f702> > > Stanislav Zholnin <[email protected]> May 12 09:43AM -0700 > > суббота, 11 мая 2013 г., 9:09:18 UTC-5 пользователь umang shukla > написал: > > > A) study. If you are studying programming in University - then it > works. If not - then go to coursera, udacity, edx and study. > > > Please would you throw more light on course which are best for > programming at coursera, udacity, edx > > Thanks > > Coursera's course by Tim Roughgarden - fantastic. Two parts. (Design > and Analysis of Algorithms, Part I and II) > Coursera's course by Robert Sedgewick - very different from Tim's, but > still fantastic. In a different sense. (Algorithms I and II) > Udacity's course on Algorithms - a little bit to short, but still nice. > Udacity's course on Introduction to Theoretical Computer Science - > super/ > Analytic Combinatorics, part I and II by Sedgewick - not exactly about > programming, but there is certain type of problems in Codejam which are > solved through this. > > Just some stuff which I did recently. There is more than that if you > know how to search web. > > > Analytic Combinatorics > > > > > Vaibhav Tulsyan <[email protected]> May 12 10:21PM +0530 > > Is Tim Roughgarden's course better than Sedgewick's? > > > On Sun, May 12, 2013 at 10:13 PM, Stanislav Zholnin < > > -- > Regards, > Vaibhav Tulsyan. > > > > > wonjun <[email protected]> May 12 10:33PM +0530 > > That doesn't matter. They're both excellent courses and their > objectives > are very much different. > On May 12, 2013 10:22 PM, "Vaibhav Tulsyan" <[email protected]> > wrote: > > > > > > Vaibhav Tulsyan <[email protected]> May 12 11:12PM +0530 > > Ok :) > > > > -- > Regards, > Vaibhav Tulsyan. > > > > > Stanislav Zholnin <[email protected]> May 12 12:43PM -0700 > > воскресенье, 12 мая 2013 г., 11:51:52 UTC-5 пользователь Vaibhav > Tulsyan написал: > > > -- > > Regards, > > Vaibhav Tulsyan. > > > They are just different. Sedgewicks course seems to be more formal and > streamlined. I loved practice problems there - though you are limited to > Java, but grader not only grades - it really gives you lots of suggestions. > Roughgarden's course seems more informal - like you are chatting with a > friend - but this is just a feeling. In most cases Tim goes deeper into > algorithm proofs and gives lots of useful information. Sedgewick's course > is probably much deeper if you by his book, which I haven't done yet. > > > > 1C_Problem_A<http://groups.google.com/group/google-code/t/c8f834ad2e60fe9c> > > Vaibhav Tulsyan <[email protected]> May 12 07:10PM +0530 > > I got the Small Input correct. > When I paste the large input in my Eclipse console, I get output for > the > last 25 cases, number as Case#1: , Case#2, and so on.. > even though Last 25 cases should be Case #75: , Case#76: and so on.. > ideally.. > Any idea what could be the problem? > I am using InputStreamReader and BufferedReader for i/o. > > -- > Regards, > Vaibhav Tulsyan. > > > > > Akshay Vishnu <[email protected]> May 12 07:14PM +0530 > > I usually redirect input to file directly instead of copy paste. No > buffer > issues. Use System.setIn(new FileInputStream("path")). Similarly I > redirect > output using eclipsr run configurations. > > > > > Vaibhav Tulsyan <[email protected]> May 12 07:26PM +0530 > > Can you tell me your username please? I'll read from your code. > > > > -- > Regards, > Vaibhav Tulsyan. > > > > > Akshay Vishnu <[email protected]> May 12 08:06PM +0530 > > Its "LivE". I do this simply because I can just comment out that code > and > it will work with stdin. > > Sample - > > try { > > > System.setIn(newFileInputStream("/Users/akshaya.vishnu/Downloads/A-large-practice.in" > )); > } catch (FileNotFoundException e) {} > > Scanner in = new Scanner(System.in); > > // you can read data using in.nextInt(), in.next() etc. > > For testing, if you want to type in console input, you can just > comment out > that code. :) > > > > On Sun, May 12, 2013 at 7:26 PM, Vaibhav Tulsyan > > > > Round 1A 2013 - C. Good > Luck<http://groups.google.com/group/google-code/t/9b92a62f0f3cf5a3> > > Sujit Sali <[email protected]> May 12 09:09AM +0530 > > Hi All, > > In problem (C. Good Luck), in the problem statement there is a sentence > "(each card is taken with probability 0.5)", so can anybody please > explain > me, what dose this actually means? > > I am not getting this for understanding of the problem. Can you please > explain me this with examples. > > Thanks, > Sujit > > > > > Joseph DeVincentis <[email protected]> May 12 10:28AM -0400 > > There are N cards. > The probability that the first card is in the subset is 0.5. > The probability that the second card is in the subset is 0.5. > ... > The probability that the Nth card is in the subset is 0.5. > > So if there were 3 cards called A, B, and C, then there are 8 equally > likely subsets: ABC, AB, AC, BC, A, B, C, and the empty set. > > > > > > > Is participating in code jam helpful to find job in > google?<http://groups.google.com/group/google-code/t/d7bd0b0886a13dc0> > > Vexorian <[email protected]> May 12 04:41AM -0700 > > Participation in contests even if it is not great seems to increase > your likely to get an interview. Even I was offered the chance to get > interview thrice, but I chickened out, thrice. > > Of course, the ticket to interview is just that. You'll still have to > do well in the interview and demonstrate that you are a good hire and would > fit what they are looking for in an employee. But high performance in > coding contests is correlated a bit with getting hired by Google or > Facebook. > > > On Thursday, May 9, 2013 6:59:59 AM UTC-4, supermind wrote: > > > > You received this message because you are subscribed to the Google Group > google-code. > You can post via email <[email protected]>. > To unsubscribe from this group, > send<[email protected]>an empty message. > For more options, > visit<http://groups.google.com/group/google-code/topics>this group. > > -- > You received this message because you are subscribed to the Google Groups > "Google Code Jam" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected]. > To post to this group, send email to [email protected]. > For more options, visit https://groups.google.com/groups/opt_out. > > > -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/CAKMwf83KrcXcm%2Bx2D69vn7t%3DkKZ1eD%3DxHnegCPhPCJU2SbNcjQ%40mail.gmail.com. For more options, visit https://groups.google.com/groups/opt_out.
