[gcj] Re: Any Ruby programmers on Windows?

Even then I think you would not want to parse input using C++, you'd rather use Python's regex for that task On Wed, Sep 2, 2009 at 2:21 PM, Bartholomew Furrow wrote: > I think is best to use the language you are most comfortable with, usually >> how good the algorithm is more important than how

[gcj] Re: how is everyone going on the qualification round

Ken:I guess most of the programmers that do in C/C++ learned it in school and did several years in them. Books like Ritch & Kenni etc would be their best friends. They are so experienced that they can program without exceptions and stuff that we are used to in our day to day programming (at softw

[gcj] Re: perl solutions

You guys are all damn good at regex's I think. For the life of me, I simply thought regex's can't be done because I have to count the number of matches. Can you give the regex you've used? On Fri, Sep 4, 2009 at 5:21 AM, krzych wrote: > > Hi, > > I solved first problem correctly in Perl for both

[gcj] Fwd: Competency levels

-- Forwarded message -- From: Prolific Coder Date: Fri, Sep 4, 2009 at 11:25 AM Subject: Competency levels To: google-code@googlegroups.com I do programming for a living and I think I am not bad. I have been in programming interviews before and could solve 90% of questions. But t

[gcj] Re: Fwd: Competency levels

gt;> ever >> seen. But in this group I'm going to be lucky to finish in the top third. >> These guys are really really good!!! >> >> Your best bet is to keep working on the 2008 practice problems. >> Techniques >> you find there are often helpful in

[gcj] Re: Suggestion for next year

Now that you say this, I initially submitted my output format as "Case 1#: " and system rejected it! I was petrified, terrified and had to do a retry but finally it worked and also worked for large output, so I am qualified On Fri, Sep 4, 2009 at 3:33 PM, Bartholomew Furrow wrote: > 25 hours

[gcj] Re: Algorithm book

CLRS is the definitive book but its prettty pretty big and intimidating. I have it before me and dozing off ;) On Sat, Sep 5, 2009 at 3:42 PM, SB wrote: > > Kudos to these guys who prepared these qualification round problem. > > Credits > > Problem A. Alien Language Written by Junbin Teng. Prepa

[gcj] Re: Scoreboard with Filters

That's pretty quick and slick app. Good job! On Sat, Sep 5, 2009 at 4:28 PM, Sandaruwan Gunathilake < sandaru...@gunathilake.com> wrote: > Hello All, > > Here is a codejam scoreboard with few filtering features : > http://apps.facebook.com/thecodejam/ > > Assign your facebook account with the cod

[gcj] Re: Practice-C EggDrop output set

Can any one explain how to formulate a solution for this? I mean what is the algorithm and the premise?I've seen one top coders(jonick) solution and he solved it with dynamic programming all the way. But what is mystic for me is how was he able to find the relation between the current problem and t

[gcj] Re: Practice-C EggDrop output set

Thanks! Nice website. On Sun, Sep 6, 2009 at 3:53 PM, Luke Pebody wrote: > > This blog here has a detailed explanation for that problem: > http://blog.puzzlearena.com/search/label/GoogleCodeJam > > On Sun, Sep 6, 2009 at 7:21 PM, Satyajit > Malugu wrote: > > Can any one

[gcj] Re: Any Ruby programmers on Windows?

If I understood your cryptic message and shortcuts (any1, cud). You are asking for a good debugger on Windows for Ruby. Then I would say it is Netbeans in the downloads section you can just get the Ruby components. --~--~-~--~~~---~--~~ You received this message b

[gcj] Re: Кто решил задачу С на квалифике йшн раунде?

Last year the contest was won by a chinese. Though the questions are given in English and we'd be interested in knowing what all the talking, we can't force anyone to communicate with rest of us :) --~--~-~--~~~---~--~~ You received this message because you are subs

[gcj] Re: Any good editors for Ruby and specifically Ruby on Rails

Even debugging? The reason GUI IDE's are famous is for their debuggers otherwise command line VIM is simple and cute On Mon, Sep 7, 2009 at 1:41 PM, Francesco Vollero wrote: > > On Mon, Sep 7, 2009 at 7:30 PM, gun wrote: > > > > As there had been a discussion for ruby programmer, > [snip] > > > P

[gcj] Re: Round 1B 2008 - Number sets

So is it like finally we should have all the numbers with prime factor higher than P (in this case 3) should be in one setand rest constitutes individual sets? >From the problem statement - " If the two integers share a prime factor which is at least *P*, then you merge the two sets to which the t

[gcj] Re: Round 1B 2008 - Number sets

> > I think that it's harder to do it that way. Do you know how to do those set merge operations efficiently? >From the contest analysis its union find (graph operation) Set operations can be done efficiently in C++ STL sets or java Set which I think uses this Union find mechanism. I will try t

[gcj] Re: Egg Drop

Then why not the number is 8? Using your logic, 3 attempts and 3 broken eggs can be used on a 8 floor building. Part of the explanation. Attempt on 4, does not break, attempt on 6- does not break, attempt on 8. If breaks answer is 7 does not answer is 8. Attemp on 4, breaks, attempt on 2, breaks

[gcj] Re: Egg Drop

@sajith "so total breaks become, 1 + F(D-1, B-1) + F(D-1,B)" Isn't it the total floors? That's what I got from code of top players. Also what I don't understand is - How you can combine if and else cases to a same equation - 1 + F(D-1, B-1) + F(D-1,B) May be I am missing something.. but all of th

[gcj] Re: favorite programming language?

Wtf? How can he manage that? First time I am seeing that there is language called Brainfuck - http://en.wikipedia.org/wiki/Brainfuck#Brainfuck.27s_formal_.22parent_language.22 Its really crazy language... I don't wa

[gcj] Re: favorite programming language?

[ Brainf**k adaptation of Welcome to Code Jam Problem Provided files: Welcome.bf bf2c.c To create output file c-small.out from c-small.in: gcc -o bf2c bf2c.c bf2c Welcome.bf Welcome.c gcc -o Wel Welcome.c download c-small.in Wel 0c-small.out ] Memory cell 0 = 16

[gcj] Re: IS THIS THE OUTPUT:round 1A 2009 minimum scalar product

Yeah exactly! This is why though 85% of folks got the small one right only 46% could get the second one right. Java implicitly thinks that any number calculation is int. For eg: long count=1*1*800 would be a garbage value. One of the right way to do is long count= (long)1*1*800 ;

[gcj] Re: favorite programming language?

Hail! Hail! Luke 'Skywalker' :) On Wed, Sep 9, 2009 at 4:03 PM, Luke Pebody wrote: > > i'm Bozzball. Not a monster. I just thought it would be fun. > > On Wed, Sep 9, 2009 at 7:29 PM, Satyajit > Malugu wrote: > > [ > > Brainf**k adaptation of Welco

[gcj] Re: Multibase Happiness

I've put all the results in Java Set and if its a repeat. Then I breaked. But this does not a good strategy as I got bugs for large input On Sat, Sep 12, 2009 at 6:00 AM, NacRuno wrote: > > In this question how do you define the size of the array to store > previous results while looking for a