[gcj] Re: Analysis of Indicium (Codejam 2020 Qualification Round)

Thanks @Wing-chung Leung, and @Facundo Parra. A crucial piece of information, which I didn't read. The solution is clear to me now. Thanks :) On Tuesday, April 7, 2020 at 6:35:20 AM UTC+5:30, Maverick wrote: > > I am unclear on the analysis of *Testset-2* of Indiciu

[gcj] Analysis of Indicium (Codejam 2020 Qualification Round)

I am unclear on the analysis of *Testset-2* of Indicium (Problem-5, Qualification Round, Codejam 2020). It is all clear up until the second last paragraph, where we construct a Latin square matrix out o

[gcj] Is there a limit to number of times I can participate in code jam?

How many times can I take part in this competition? or, is my analytics/status affected if I fail a number of times? I mean will google think of it like this that "she has failed a number of times, so this girl is not worth applying for again or worth clearing Code Jam. -- You received this me

Re: [gcj] Re: Broken Necklace problem

Hi, Sorry, I'm stuck again. almost had the solution. While we scan through the array once and divide them into regions: Are we supposed to have over lapping regions, because when we consider a 'w' it can be included in either of the regions right? -Maverick -- You receiv

Re: [gcj] Re: Broken Necklace problem

OMG.. This is amazing!!! :-) I never expected to get the answer from such a person(Peboy). Thanks Peboy.. I was able to implement & understand the algorithm more easily after your explanation. @mtsay: Thanks!! Thanks, Maverick -- You received this message because you are subscribed to

[gcj] Broken Necklace problem

made it to round 2. Thanks, Maverick -- You received this message because you are subscribed to the Google Groups "google-codejam" group. To post to this group, send email to google-c...@googlegroups.com. To unsubscribe from this group, send email to google-code+unsubscr...@googlegroup

Re: [gcj] Re: Arbitrary number of input

ction requires repeated calls? Amtep: One couldn't have explained it better.. Its all getting clear now. :-) The 2nd method where you check for the number of steps with that number was really unique!! -Maverick On Thu, May 27, 2010 at 12:00 AM, Amtep wrote: > On Wed, May 26, 2010 at 06:

Re: [gcj] Re: Arbitrary number of input

at a point. Is there any other better method? Can its complexity be reduced? I'm not able to understand the codes from the people who have solved. Can some one please give a nice algorithm for this? I've been breaking my head over this problem for way too long.. Thanks, Maverick -

Re: [gcj] Re: Arbitrary number of input

lest happy number > 1 for bases 2 and 3 is 128. Can you please help me out with this? Is my understanding wrong? Thanks, Maverick -- You received this message because you are subscribed to the Google Groups "google-codejam" group. To post to this group, send email to google-c.

Re: [gcj] Re: Arbitrary number of input

Thank U so much.. It was really helpful. I am able to understand the actual purpose for streams now. -Maverick P.S: Awaiting for round 1B!! On Tue, May 18, 2010 at 4:20 PM, Amtep wrote: > I did it this way: > > unsigned char bases[11]; > > for (casenr = 1; casenr &

[gcj] Arbitrary number of input

umber by number is one method. But the problem is for two digit numbers.. Just checked the code of others, but would be really nice if someone can explain it out more clearly in C/C++.(C would be great.) Thank you. -Maverick -- You received this message because you are subscribed to the Google G