[gcj] Re: Dynamic Programming

> hi i recently joined topcoder  i wish to know that am i able to participate > in topcoder with language C Read the competition manual. The languages are C++, Java, and C#. The few bits of C++ that need be known aren't that hard to grasp. ulzha --~--~-~--~~~---~--~--

[gcj] Re: Subrounds: you have been assigned to all of them

As they said in the email, I think you are not allowed to partcipate in the next sub-rounds if you advanced in the previous one . If you just want try the questions, you can just do it in 'Practice mode', but I am not sure if it will be enabled before the end of sub-rounds, please ask away ! Rega

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

your method is same as what explained in code jam solution page, the solution there use previous row to calculate current row, hence, in nutshell, one can just keep 1D array of row. 2009/9/10 mogo > My solution is under nickname "mogo" in the qualification round if you > want to have a look. The

[gcj] Re: how can i know what sub-round I should be in?

> > no, actually they changed the rules, so you can be in the 3 sub- > rounds, if you qualify in one of them, then you can't participate in > the next. > To clarify, we didn't change the rules -- the rules always said we'd assign you to 2 or 3 sub-rounds. This is different from last year, though,

[gcj] Re: Easiest Round?

> > any one got mail of round one ? > > it's nearly Thursday over > Not in California when you sent that email. :) You should have received it by now. --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups "google-cod

[gcj] Re: how can i know what sub-round I should be in?

no, actually they changed the rules, so you can be in the 3 sub- rounds, if you qualify in one of them, then you can't participate in the next. On 10 sep, 11:51, Wang lei wrote: > Till now, i am not sure what sub-round i should be in? > > There are 3 sub-rounds in the code jam page once i logi

[gcj] Re: Subrounds: you have been assigned to all of them

> > If a person got in top 1000 in round-1A itself, then *can* he > participate in 1B, 1C? I remember it as, he/she can participate but it > wont affect the competition i.e. in those rounds (1B,1C in this > example) > No, there's currently no mechanism for doing that. Vexorian: to answer your con

[gcj] Re: Egg Drop

Ignoring the programming and only addressing the logic to figure it out, one way to solve is using halves, so test at 32, 16, 8, 4, 2, 1. Of course if it breaks past 8 that gives you more than 3 breaks so that doesn't work by itself. So instead of doing halves you could drop by 75% and go 32, 8,

[gcj] Re: Easiest Round?

any one got mail of round one ? it's nearly Thursday over On Sep 10, 9:27 am, ASTS wrote: > same for me not yet! but surely selected... > On Thu, Sep 10, 2009 at 9:33 AM, jiangwen jiang wrote: > > > not yet! > > > 2009/9/10 Bey > > >> So have you guys received your confirmation email? Coz

[gcj] Re: Easiest Round?

i didn't get any email, and actually i got 33 points too. They say that there has been a delay with the confirmation because they are detecting cheating on the Qualification round, have anyone received the confirmation email? On 9 sep, 22:48, Bey wrote: > So have you guys received your co

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

É super legal escrever algo em seu próprio idioma exótico em uma lista "habitada" por pessoas de diferentes nacionalidades que usam o inglês como o idioma de integração. Néé não? Alexandre On 9 Sep, 2009, at 04:34 , Misha Marchenko wrote: > Кажется у меня появилась идея как это > можно с

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

My solution is under nickname "mogo" in the qualification round if you want to have a look. The only thing that I save is a single dimension array of length 19. The solution to this problem is based dynamic programming and here's a short explanation of the way it works: The first thing that you h

[gcj] Re: Easiest Round?

round one, you need to be in 1000 out of 78xx frankly speaking 1 /8 round two, you need to be in 1000 out of 68xx frankly speaking 1 /7 round three you need to be in 1000 out of 58xx frankly speaking 1 /6 Considering all participant participate in all rounds On Sep 10, 8:19 am, Brian Watkins

[gcj] Re: Subrounds: you have been assigned to all of them

If a person got in top 1000 in round-1A itself, then *can* he participate in 1B, 1C? I remember it as, he/she can participate but it wont affect the competition i.e. in those rounds (1B,1C in this example) Thanks, Santosh On Sep 9, 1:10 pm, Bartholomew Furrow wrote: > No, Igor has it right.  Th

[gcj] Re: Has anyone received 'Sub-round' assignments for Round 1 yet?

I received the notification from codejam admin a few minutes ago that we are allowed in all three subrounds. I had more than 33 points although I am not sure from the language if they allowed everyone including those with less than 33 points to advance. Probably not, though. On Sep 10, 3:28 pm,

[gcj] Re: Has anyone received 'Sub-round' assignments for Round 1 yet?

I've just received the email, so the ufficial notification has been sent! On Thu, Sep 10, 2009 at 10:21 PM, romanr wrote: > Well, seems there won't be any invitation to Round 1, so anybody can > participate? > Or entrance will be restricted by web-site? > > David M. wrote: > > Carlos is right, r

[gcj] Re: Has anyone received 'Sub-round' assignments for Round 1 yet?

Well, seems there won't be any invitation to Round 1, so anybody can participate? Or entrance will be restricted by web-site? David M. wrote: > Carlos is right, read this > thread: > http://groups.google.com/group/google-code/browse_thread/thread/95af9c6dc8cc43a7?hl=en# > > 2009/9/10 nowhereman m

[gcj] Re: Dynamic Programming

hi i recently joined topcoder i wish to know that am i able to participate in topcoder with language C On Wed, Sep 9, 2009 at 11:10 PM, Kaushalya Madhawa wrote: > This is good! > http://www.topcoder.com/tc?module=Static&d1=tutorials&d2=dynProg

[gcj] Re: Has anyone received 'Sub-round' assignments for Round 1 yet?

Carlos is right, read this thread: http://groups.google.com/group/google-code/browse_thread/thread/95af9c6dc8cc43a7?hl=en# 2009/9/10 nowhereman > > I dont believe, we can participate in all the 3 sub-rounds. GCJ is > going to PICK the sub-rounds for us, and we cannot change/choose them. > Atleas

[gcj] Re: Has anyone received 'Sub-round' assignments for Round 1 yet?

I dont believe, we can participate in all the 3 sub-rounds. GCJ is going to PICK the sub-rounds for us, and we cannot change/choose them. Atleast thats what it is mentioned in the 'Rules' and also in the last year's Round-1 assignments On Sep 10, 3:17 pm, Carlos Guia wrote: > There hasn't been a

[gcj] Re: Has anyone received 'Sub-round' assignments for Round 1 yet?

There hasn't been an email, thought you can find in another thread in the group that you can participate an all 3 of them. Carlos Guía On Thu, Sep 10, 2009 at 2:42 PM, nowhereman wrote: > > Hi, > Has anyone received their 'Sub-round' assignments for Round 1 yet (in > e-mail)? It just 2 more da

[gcj] Has anyone received 'Sub-round' assignments for Round 1 yet?

Hi, Has anyone received their 'Sub-round' assignments for Round 1 yet (in e-mail)? It just 2 more days to go, but dont know which sub-round 1A/ 1B/1C i am going to participate. Or does it mean that i am eliminated if i dont receive a e-mail? --~--~-~--~~~---~--~~ Y

[gcj] Re: Intuitive explanation of an efficient solution for problem C "Welcome to Code Jam"

Ah, sorry I did not notice that before, Sameer. Nice code! Glad you worked out your problem, Vitus. It might have just been an old file or something like that. Good luck on the next round, everyone! On Sep 8, 2:39 am, sameer mhatre wrote: > Yes smloh you are right. Hash map does not return

[gcj] Re: how can i know what sub-round I should be in?

You can participate in all 3 sub rounds, 1A is highlighted so you know which is the *next *sub round. Carlos Guía On Thu, Sep 10, 2009 at 1:10 PM, Wang lei wrote: > i am qualified to join the Round 1. > Just now, in the http://code.google.com/codejam/ after login on, i found > that only sub-rou

[gcj] Re: how can i know what sub-round I should be in?

i am qualified to join the Round 1. Just now, in the http://code.google.com/codejam/ after login on, i found that only sub-round A is listed there, so i think i should enter sub-round A 2009/9/10 Mahendra Kariya > Nope. I dont think so. And as per the announcement, we can participate in > any

[gcj] Re: is it true?

As long as I know you are eligible only if you have at least 33 points On Sep 10, 8:26 pm, vicky wrote: > i have just come to know that every-body is eligible for round 1 of > code jam . i had rank 8080 ,  am i too  eligible??? --~--~-~--~~~---~--~~ Yo

[gcj] Re: is it true?

You have to have least 33 points. On Fri, Sep 11, 2009 at 12:56 PM, vicky wrote: > > i have just come to know that every-body is eligible for round 1 of > code jam . i had rank 8080 , am i too eligible??? > > > -- Saul Hidalgo --~--~-~--~~~---~

[gcj] is it true?

i have just come to know that every-body is eligible for round 1 of code jam . i had rank 8080 , am i too eligible??? --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups "google-codejam" group. To post to th

[gcj] Re: Dynamic Programming

Hi Anil , Have completed the topcoder Marathon match problem? jawahar On Thu, Sep 10, 2009 at 8:07 PM, Anil Kishore wrote: > You may wanna try the Problem in Todays TopCoder SRM , > http://www.topcoder.com/stat?c=problem_statement&pm=10620 > >

[gcj] Re: how can i know what sub-round I should be in?

Nope. I dont think so.And as per the announcement, we can participate in any sub rounds if we have not qualified in the previous ones. I suggest keep on participating you we are in. I think I will try all three. Regards, Mahendra Kariya http://www.mahendrakariya.blogspot.com On Thu, Sep 10, 20

[gcj] how can i know what sub-round I should be in?

Till now, i am not sure what sub-round i should be in? There are 3 sub-rounds in the code jam page once i login on, and the first one is highlighted, does it mean i should be in that? --~--~-~--~~~---~--~~ You received this message because you are subscribed to the

[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 Welcome to Code Jam Problem > > Provided files: > >

[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: IS THIS THE OUTPUT:round 1A 2009 minimum scalar product

bro.there is a problem with the data type in which u are storing the value check it again..and dont rely on the submission of the smalll input that u will get the submission for the large input well the correct output is. Case #1: -7839202227936 Case #2: 7999201712083 Case #

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

What is the input ? Perhaps, you get an input file randomly. Kindly specify the input test cases so that the output can be checked against. Moreover, its round 1A 2008 ! Regards, Mahendra Kariya http://www.mahendrakariya.blogspot.com On Thu, Sep 10, 2009 at 9:04 PM, prithu <07pri...@gmail.com> w

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

for the minimum scalar product i got the following as output for large input Case #1: -886912736 Case #2: 1972606931 Case #3: 830755729 Case #4: 464004126 Case #5: -421765596 Case #6: -627423377 Case #7: -1594352757 Case #8: 1208215078 Case #9: 1325434972 Case #10: -1264828651 but its shown inco

[gcj] Re: Dynamic Programming

You may wanna try the Problem in Todays TopCoder SRM , http://www.topcoder.com/stat?c=problem_statement&pm=10620 Its a good problem. Give it a try :) ,, Don't worry, we are there to explain in case. - Anil Kishore, IIIT-Hyderabad. On T

[gcj] Re: Dynamic Programming

Dynamic programing gives the effective way of recursion, with table that contains the previous results Regards Jawahar On Thu, Sep 10, 2009 at 5:55 PM, amit jain wrote: > thanx buddy > > On Thu, Sep 10, 2009 at 2:11 PM, Mayank Jaiswal wrote: > >> Hi amit, >> >> I'll try to help you. >> Recal

[gcj] Re: Dynamic Programming

thanx buddy On Thu, Sep 10, 2009 at 2:11 PM, Mayank Jaiswal wrote: > Hi amit, > > I'll try to help you. > Recall the definition of dynamic programming. > *Dynamic programming is a method of solving complex problems by breaking > them down into simpler steps. > * > So, when solving a problem,

[gcj] Re: Dynamic Programming

Hi amit, I'll try to help you. Recall the definition of dynamic programming. *Dynamic programming is a method of solving complex problems by breaking them down into simpler steps. * So, when solving a problem, think that whether you are solving same subproblem again and again or not. If yes, just

[gcj] Re: Dynamic Programming

thanks a lot On Thu, Sep 10, 2009 at 1:55 PM, Anil Kishore wrote: > > If you think of it as some standard step-by-step thinking, then it may not > work most of the time.By more practice, you will develop the art of DPing > ;) . . . Its all about, 'remember your past to your memory capacity' > > M

[gcj] Re: Dynamic Programming

If you think of it as some standard step-by-step thinking, then it may not work most of the time.By more practice, you will develop the art of DPing ;) . . . Its all about, 'remember your past to your memory capacity' May be its something like this. , -> Hmm the Problem looks good , lemme imagine

[gcj] Re: Dynamic Programming

okk how do you think optimal substructure step ? On Thu, Sep 10, 2009 at 1:34 PM, Hawston LLH wrote: > i guess only practice more and get more familiar with it is the only useful > trick if there is any. :) > > On Thu, Sep 10, 2009 at 3:57 PM, amit jain wrote: > >> u know we have not enough time

[gcj] Problem in 2008 round 1a problem 3 i.e number

not giving correct result import java.io.*; public class Main { int N,n; int mod=1000; long a[][]; static BufferedReader br; //static Scanner sc; static PrintWriter p; public static void main(String[] args) throws Exception { //sc=new Scanner(new File("C-small-practice.

[gcj] Re: Dynamic Programming

i guess only practice more and get more familiar with it is the only useful trick if there is any. :) On Thu, Sep 10, 2009 at 3:57 PM, amit jain wrote: > u know we have not enough time during competition and sol of dp looks like > they will take 1 complete day.. > now a days i m spending my whol

[gcj] Re: Dynamic Programming

u know we have not enough time during competition and sol of dp looks like they will take 1 complete day.. now a days i m spending my whole day to solve a single dp problem like we had in qualification round. and i read out both clrs and as well as topcoder link so plz suggest me useful trick to so

[gcj] Re: I'm in???

Looks like we missed today, but they're pretty much ready to go and they'll go out on Thursday. On Tue, Sep 8, 2009 at 8:32 PM, Bartholomew Furrow wrote: > I'm estimating tomorrow (Wednesday, UTC -7). And, just so there's > absolutely nothing useful to you in that email: > All contestants will